Dual-feasible functions for integer programming and combinatorial optimization. Basics, extensions and applications

DOI10.1007/978-3-319-27604-5zbMath1354.90101OpenAlexW2497946352MaRDI QIDQ2634938

Jürgen Rietz, François Clautiaux, Cláudio Alves, José M. Valério de Carvalho

Publication date: 10 February 2016

Published in: EURO Advanced Tutorials on Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-27604-5

zbMATH Keywords

integer programming combinatorial optimization dual feasible functions

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Combinatorial optimization (90C27) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Related Items (12)

Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem ⋮ Single batch machine scheduling with dual setup times for autoclave molding manufacturing ⋮ Structure and interpretation of dual-feasible functions ⋮ Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems ⋮ Equivariant perturbation in Gomory and Johnson's infinite group problem (V). Software for the continuous and discontinuous 1-row case ⋮ A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ Number of bins and maximum lateness minimization in two-dimensional bin packing ⋮ Software for Cut-Generating Functions in the Gomory–Johnson Model and Beyond ⋮ Dual-feasible functions for integer programming and combinatorial optimization: algorithms, characterizations, and approximations ⋮ A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem

This page was built for publication: Dual-feasible functions for integer programming and combinatorial optimization. Basics, extensions and applications