Enriching Solutions to Combinatorial Problems via Solution Engineering
From MaRDI portal
Publication:5139605
DOI10.1287/ijoc.2018.0855OpenAlexW2941382125WikidataQ128027670 ScholiaQ128027670MaRDI QIDQ5139605
Thierry Petit, Andrew C. Trapp
Publication date: 9 December 2020
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2018.0855
Related Items (5)
Persistence in complex systems ⋮ Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory ⋮ The structural complexity landscape of finding balance-fair shortest paths ⋮ Inferring linear feasible regions using inverse optimization ⋮ On the linear ordering problem and the rankability of data
Uses Software
Cites Work
- Unnamed Item
- Constraint acquisition
- How to select a small set of diverse solutions to mixed integer programming problems
- Global constraint catalogue: past, present and future
- New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach
- Experiments concerning sequential versus simultaneous maximization of objective function and distance
- A framework for participatory decision support using Pareto frontier visualization, goal identification and arbitration
- A genetic algorithm for the generalised assignment problem
- Optimality in musical melodies and harmonic progressions: The travelling musician
- Goal programming for decision making: An overview of the current state-of-the-art
- A survey and annotated bibliography of multiobjective combinatorial optimization
- STR3: a path-optimal filtering algorithm for table constraints
- Scheduling scientific experiments for comet exploration
- Finding multiple solutions to general integer linear programs
- Three generalizations of the FOCUS constraint
- Persistence in discrete optimization under data uncertainty
- Optimization-Based Approaches for Maximizing Aggregate Recommendation Diversity
- Soft Constraints of Difference and Equality
- Generating Diverse Solutions in SAT
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- SPREAD: A Balancing Constraint Based on Statistics
- The Deviation Constraint
- Fractional Programming. II, On Dinkelbach's Algorithm
- Heuristic algorithms for the maximum diversity problem
- Imposing Connectivity Constraints in Forest Planning Models
- Generating a Representative Subset of the Nondominated Frontier in Multiple Criteria Decision Making
- Finding similar/diverse solutions in answer set programming
- Generating Multiple Solutions for Mixed Integer Programming Problems
- On Nonlinear Fractional Programming
- Canonical Cuts on the Unit Hypercube
- Recent Advances in Constraints
- Consistency restoration and explanations in dynamic CSPs---Application to configuration
This page was built for publication: Enriching Solutions to Combinatorial Problems via Solution Engineering
