Sequential-Merge Facets for Two-Dimensional Group Problems

DOI10.1007/978-3-540-72792-7_3MaRDI QIDQ5429255zbMATH OpenOpenAlexFDO

Authors Jean-Philippe Richard, Santanu S. Dey

Publication date 29 November 2007

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72792-7_3

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• scientific article; zbMATH DE number 1031385
• Parallel algorithms for solvable permutation groups
• Reaching the bound in the \((2,n)\) merging problem
• The complexity of two group scheduling problems
• The clique partitioning problem: Facets and patching facets
• Efficient splitting and merging algorithms for order decomposable problems
• NP-completeness of some optimal sequencing problems with a given grouping of elements
• Grouping algorithm for linear goal programming problems
• Gracefulness, group sequencings and graph factorizations
• Facets of Two-Dimensional Infinite Group Problems

Cited in

(8)

• The master equality polyhedron with multiple rows
• Sequential pairing of mixed integer inequalities
• Two row mixed-integer cuts via lifting
• New inequalities for finite and infinite group problems from approximate lifting
• Approximate and exact merging of knapsack constraints with cover inequalities
• On the extreme inequalities of infinite group problems
• Relations between facets of low- and high-dimensional group problems
• Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions

This page was built for publication: Sequential-Merge Facets for Two-Dimensional Group Problems

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