Towards Copeland optimization in combinatorial problems
From MaRDI portal
Publication:2170176
Recommendations
Cites work
- scientific article; zbMATH DE number 3361657 (Why is no real title available?)
- Combining leximax fairness and efficiency in a mathematical programming model
- Essence: A constraint language for specifying combinatorial problems
- Handbook of Computational Social Choice
- Handbook of constraint programming.
- Lazy clause generation: combining the power of SAT and CP (and MIP?) solving
- Multicriteria Optimization
- Price of fairness for allocating a bounded resource
- The price of fairness
Cited in
(7)- On simple combinatorial optimization problems. A collection of contributions in honour of Jack van Lint
- scientific article; zbMATH DE number 2118654 (Why is no real title available?)
- A group decision-making and optimization method based on relative inverse number
- Combinatorial optimization with interaction costs: complexity and solvable cases
- Discovery Science
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems
- A portable and scalable algorithm for a class of constrained combinatorial optimization problems
This page was built for publication: Towards Copeland optimization in combinatorial problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170176)