How to select a small set of diverse solutions to mixed integer programming problems

DOI10.1016/j.orl.2009.03.004zbMath1167.90603OpenAlexW2007872274MaRDI QIDQ833594

David L. Woodruff, Emilie Danna

Publication date: 14 August 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2009.03.004

zbMATH Keywords

integer programmingmultiple solutionsMIPsolution diversitysolution variety

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items

Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory, Initialization of metaheuristics: comprehensive review, critical analysis, and research directions, Diverse fair allocations: complexity and algorithms, MILP models for the selection of a small set of well-distributed points, Enriching Solutions to Combinatorial Problems via Solution Engineering, On multiobjective selection for multimodal optimization

Uses Software

• MIPLIB
• CPLEX
• MIPLIB2003

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimizing over the first Chvátal closure
• Experiments concerning sequential versus simultaneous maximization of objective function and distance
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Optimizing over the split closure
• Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
• L’algebre de Boole et ses applications en recherche operationnelle
• Generating Multiple Solutions for Mixed Integer Programming Problems