Solving the market split problem via branch-and-cut

DOI10.1504/IJMMNO.2009.030091MaRDI QIDQ2655892zbMATH OpenFDO

Authors Haibo Wang, Gary A. Kochenberger, Bahram Alidaee, Mark W. Lewis

Publication date 26 January 2010

Published in International Journal of Mathematical Modelling and Numerical Optimisation (Search for Journal in Brave)

zbMATH Keywords

integer programmingbranch-and-cutbranch-and-boundsmall hard instances

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10)

Recommendations

• Solving market split problems with heuristical lattice reduction
• Attacking the market split problem with lattice point enumeration
• The split feasibility problem and its solution algorithm
• A cut generation algorithm of finding an optimal solution in a market competition
• Several solution methods for the split feasibility problem
• A branch-and-price algorithm for solving the cutting strips problem
• The multi-terminal vertex separator problem: branch-and-cut-and-price
• Effective branching splitting method under cost constraint
• A modified algorithm for solving the split feasibility problem
• An unconstrained optimization approach to the split feasibility problem

Cited in

(1)

• Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances

This page was built for publication: Solving the market split problem via branch-and-cut

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