Pages that link to "Item:Q5917572"
From MaRDI portal
The following pages link to Random knapsack in expected polynomial time (Q5917572):
Displaying 29 items.
- Smoothed performance guarantees for local search (Q403643) (← links)
- Performance guarantees for scheduling algorithms under perturbed machine speeds (Q496438) (← links)
- Smoothed analysis of integer programming (Q877191) (← links)
- On the growth of random knapsacks (Q916565) (← links)
- Random knapsacks with many constraints (Q1315463) (← links)
- Average saving effects in enumerative methods for solving knapsack problems (Q1319356) (← links)
- Integer optimization with penalized fractional values: the knapsack case (Q1631508) (← links)
- A universally-truthful approximation scheme for multi-unit auctions (Q1735729) (← links)
- Smoothed analysis of partitioning algorithms for Euclidean functionals (Q1950395) (← links)
- Shortest paths with a cost constraint: a probabilistic analysis (Q2043355) (← links)
- An experimental study of random knapsack problems (Q2369879) (← links)
- Decision-making based on approximate and smoothed Pareto curves (Q2371803) (← links)
- On smoothed analysis of quicksort and Hoare's find (Q2428694) (← links)
- Bounds for the Convergence Time of Local Search in Scheduling Problems (Q2959840) (← links)
- The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization (Q2988849) (← links)
- Lower Bounds for the Smoothed Number of Pareto Optimal Solutions (Q3010422) (← links)
- The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance (Q3116733) (← links)
- Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm (Q3196427) (← links)
- Smoothed Analysis of Local Search Algorithms (Q3449848) (← links)
- Smoothed Analysis of the Successive Shortest Path Algorithm (Q3457194) (← links)
- Multi-objective Problems in Terms of Relational Algebra (Q3498407) (← links)
- Probabilistic Analysis of the Multidimensional Knapsack Problem (Q3832316) (← links)
- On Geometric Set Cover for Orthants (Q5075763) (← links)
- Smoothed Analysis of the Minimum-Mean Cycle Canceling Algorithm and the Network Simplex Algorithm (Q5119385) (← links)
- Algorithms – ESA 2004 (Q5464619) (← links)
- (Q5743441) (← links)
- Random knapsack in expected polynomial time (Q5901087) (← links)
- The smoothed number of Pareto-optimal solutions in bicriteria integer optimization (Q6044982) (← links)
- The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability (Q6599765) (← links)