The smoothed number of Pareto-optimal solutions in bicriteria integer optimization
Open Access
- 27 September 2022
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 200 (1) , 319-355
Abstract
No abstract availableKeywords
Funding Information
- DFG Grant (VO 889/2)
- ERC starting Grant (306465)
- EU within the 6th Framework Programme (001907 (DELIS))
This publication has 19 references indexed in Scilit:
- Pareto Optimal Solutions for Smoothed AnalystsSIAM Journal on Computing, 2012
- Smoothed analysisCommunications of the ACM, 2009
- Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems2007
- The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization2006
- Efficiently computing succinct trade-off curvesTheoretical Computer Science, 2005
- Random knapsack in expected polynomial timeJournal of Computer and System Sciences, 2004
- Smoothed analysis of algorithmsJournal of the ACM, 2004
- A label correcting approach for solving bicriterion shortest-path problemsComputers & Operations Research, 2000
- Finding integer efficient solutions for bicriteria and tricriteria network flow problems using DINASComputers & Operations Research, 1998
- Shortest paths in networks with vector weightsJournal of Optimization Theory and Applications, 1985