Greedy heuristic guided by lexicographic excellence
From MaRDI portal
Publication:6635980
DOI10.1007/978-3-031-57712-3_7MaRDI QIDQ6635980
Satya Tamby, Laurent Gourvès, Stefano Moretti
Publication date: 12 November 2024
Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs
- Some axiomatic and algorithmic perspectives on the social ranking problem
- Lexicographic solutions for coalitional rankings
- Lexicographic solutions for coalitional rankings based on individual and collective performances
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- Ranking objects from a preference relation over their subsets
- Hedonic Coalitions: Optimality and Stability
- P-Complete Approximation Problems
- Comments on bases in dependence structures
- Combinatorial optimization. Theory and algorithms.
This page was built for publication: Greedy heuristic guided by lexicographic excellence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635980)
