Generating Multiple Solutions for Mixed Integer Programming Problems

DOI10.1007/978-3-540-72792-7_22MaRDI QIDQ5429274zbMATH OpenOpenAlexFDO

Authors Emilie Danna, Mary Fenelon, Zonghao Gu, 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

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11)

Recommendations

• How to select a small set of diverse solutions to mixed integer programming problems
• Finding multiple solutions to general integer linear programs
• Generation and presentation of nearly optimal solutions for mixed-integer linear programming, applied to a case in faming system design
• Multi-objective integer programming: a general approach for generating all non-dominated solutions
• Exploring relaxation induced neighborhoods to improve MIP solutions

Cited in

(18)

• MILP models for the selection of a small set of well-distributed points
• Experiments concerning sequential versus simultaneous maximization of objective function and distance
• Fair integer programming under dichotomous and cardinal preferences
• How to select a small set of diverse solutions to mixed integer programming problems
• Compact representation of near-optimal integer programming solutions
• Efficient enumeration of the optimal solutions to the correlation clustering problem
• Pisot unit generators in number fields
• Counting Solutions of Integer Programs Using Unrestricted Subtree Detection
• Constraint Orbital Branching
• Accelerating the branch-and-price algorithm using machine learning
• Finding all solution sets of piecewise-linear interval equations using an integer programming solver
• Generation and presentation of nearly optimal solutions for mixed-integer linear programming, applied to a case in faming system design
• D<scp>iversi</scp>T<scp>ree</scp>: A New Method to Efficiently Compute Diverse Sets of Near-Optimal Solutions to Mixed-Integer Optimization Problems
• PEBBL: an object-oriented framework for scalable parallel branch and bound
• Fast enumeration of all cost-bounded solutions for combinatorial problems using ZDDs
• Energy efficient spatial TDMA scheduling in wireless networks
• Finding multiple solutions to general integer linear programs
• Enriching Solutions to Combinatorial Problems via Solution Engineering

Describes a project that uses

Uses Software

• CPLEX
• MIPLIB

This page was built for publication: Generating Multiple Solutions for Mixed Integer Programming Problems

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