Discrepancy-based additive bounding procedures

DOI10.1287/IJOC.1050.0168MaRDI QIDQ2892304zbMATH OpenOpenAlexFDO

Authors Andrea Lodi, Michela Milano, Louis-Martin Rousseau

Publication date 18 June 2012

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.1050.0168

zbMATH Keywords

additive boundingconstraint programminglimited discrepancy searchrelaxations

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Deterministic discrepancy minimization
• Deterministic discrepancy minimization
• Discrepancy norm: approximation and variations
• Upper bounds in discrepancy theory
• scientific article; zbMATH DE number 3161280
• scientific article; zbMATH DE number 3965335
• Calculation of discrepancy measures and applications
• An Additive Bounding Procedure for Combinatorial Optimization Problems
• Discrepancy, integration and tractability

Cited in

(2)

• Hybrid optimization methods for time-dependent sequencing problems
• Improved filtering for weighted circuit constraints

This page was built for publication: Discrepancy-based additive bounding procedures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892304)