Enriching Solutions to Combinatorial Problems via Solution Engineering
From MaRDI portal
Recommendations
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
- scientific article; zbMATH DE number 2087094
- Combinatorial optimization problems in engineering applications
- scientific article; zbMATH DE number 4156211
- A unified modeling and solution framework for combinatorial optimization problems
- Theory and Applications of Satisfiability Testing
- scientific article; zbMATH DE number 780787
- Application of SAT-approach for solving combinatorial problems
- scientific article; zbMATH DE number 2086995
- Enumerating All Solutions for Constraint Satisfaction Problems
Cites work
- A framework for participatory decision support using Pareto frontier visualization, goal identification and arbitration
- A genetic algorithm for the generalised assignment problem
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- A survey and annotated bibliography of multiobjective combinatorial optimization
- Canonical Cuts on the Unit Hypercube
- Consistency restoration and explanations in dynamic CSPs---Application to configuration
- Constraint acquisition
- Experiments concerning sequential versus simultaneous maximization of objective function and distance
- Finding multiple solutions to general integer linear programs
- Finding similar/diverse solutions in answer set programming
- Fractional Programming. II, On Dinkelbach's Algorithm
- Generating a representative subset of the nondominated frontier in multiple criteria decision making
- Generating Diverse Solutions in SAT
- Generating Multiple Solutions for Mixed Integer Programming Problems
- Global constraint catalogue: past, present and future
- Goal programming for decision making: An overview of the current state-of-the-art
- Heuristic algorithms for the maximum diversity problem
- How to select a small set of diverse solutions to mixed integer programming problems
- scientific article; zbMATH DE number 2172949 (Why is no real title available?)
- Imposing Connectivity Constraints in Forest Planning Models
- New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach
- On Nonlinear Fractional Programming
- Optimality in musical melodies and harmonic progressions: The travelling musician
- Optimization-based approaches for maximizing aggregate recommendation diversity
- Persistence in discrete optimization under data uncertainty
- Recent Advances in Constraints
- Scheduling scientific experiments for comet exploration
- Soft constraints of difference and equality
- SPREAD: A Balancing Constraint Based on Statistics
- STR3: a path-optimal filtering algorithm for table constraints
- The Deviation Constraint
- Three generalizations of the FOCUS constraint
Cited in
(8)- Engineering a combinatorial Laplacian solver: lessons learned
- Inferring linear feasible regions using inverse optimization
- On the linear ordering problem and the rankability of data
- 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
- 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
- Algorithms for the diverse-k-SAT problem: the geometry of satisfying assignments
This page was built for publication: Enriching Solutions to Combinatorial Problems via Solution Engineering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5139605)
