Designing optimization problems with diverse solutions

DOI10.1007/978-3-031-32726-1_13zbMath1528.90147MaRDI QIDQ6086000

Oussama Hanguir, Will Ma, Christopher Thomas Ryan

Publication date: 9 November 2023

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

zbMATH Keywords

linear programmingtriangulationsdiversity

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Sensitivity, stability, parametric optimization (90C31) Linear programming (90C05)

Cites Work

• Unnamed Item
• Rigidity and the lower bound theorem. I
• Triangulations. Structures for algorithms and applications
• Variation of cost functions in integer programming
• Lifting projections of convex polyhedra
• OR PRACTICE—Scheduling of Dynamic In-Game Advertising
• Parametric Integer Programming in Fixed Dimension
• Computing the Continuous Discretely
• Parametric Objective Function (Part 1)
• The maximum numbers of faces of a convex polytope
• Marginal Values in Linear Programming

This page was built for publication: Designing optimization problems with diverse solutions