Optimization over Integers with Robustness in Cost and Few Constraints
From MaRDI portal
Publication:2896381
DOI10.1007/978-3-642-29116-6_8zbMath1242.90110OpenAlexW1417235971MaRDI QIDQ2896381
Kai-Simon Goetzmann, Sebastian Stiller, Claudio Telha
Publication date: 16 July 2012
Published in: Approximation and Online Algorithms (Search for Journal in Brave)
Full work available at URL: https://depositonce.tu-berlin.de/handle/11303/15722
integer programmingrobust optimizationtotal unimodularityunbounded knapsackinteger programs with two variables per inequality
Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (8)
Packing a Knapsack of Unknown Capacity ⋮ Constant-Ratio Approximation for Robust Bin Packing with Budgeted Uncertainty ⋮ Robust combinatorial optimization with knapsack uncertainty ⋮ Robust scheduling with budgeted uncertainty ⋮ Single machine robust scheduling with budgeted uncertainty ⋮ The robust vehicle routing problem with time windows: solution by branch and price and cut ⋮ The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach ⋮ Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations
This page was built for publication: Optimization over Integers with Robustness in Cost and Few Constraints
