Generating Multiple Solutions for Mixed Integer Programming Problems
From MaRDI portal
Publication:5429274
DOI10.1007/978-3-540-72792-7_22zbMath1136.90416OpenAlexW1885159080MaRDI QIDQ5429274
Mary Fenelon, Zonghao Gu, Emilie Danna, Roland Wunderling
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_22
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (12)
How to select a small set of diverse solutions to mixed integer programming problems ⋮ Pisot unit generators in number fields ⋮ Accelerating the branch-and-price algorithm using machine learning ⋮ Constraint Orbital Branching ⋮ Compact representation of near-optimal integer programming solutions ⋮ Efficient enumeration of the optimal solutions to the correlation clustering problem ⋮ PEBBL: an object-oriented framework for scalable parallel branch and bound ⋮ Counting Solutions of Integer Programs Using Unrestricted Subtree Detection ⋮ MILP models for the selection of a small set of well-distributed points ⋮ Enriching Solutions to Combinatorial Problems via Solution Engineering ⋮ Energy efficient spatial TDMA scheduling in wireless networks ⋮ Finding all solution sets of piecewise-linear interval equations using an integer programming solver
Uses Software
This page was built for publication: Generating Multiple Solutions for Mixed Integer Programming Problems
