Integer Programming and Combinatorial Optimization
From MaRDI portal
Publication:5712477
DOI10.1007/b97946zbMath1092.90531OpenAlexW2484779063MaRDI QIDQ5712477
Publication date: 23 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b97946
Programming involving graphs or networks (90C35) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (10)
K-Adaptability in Two-Stage Robust Binary Programming ⋮ Approximation algorithms for facility location problems with a special class of subadditive cost functions ⋮ Unnamed Item ⋮ Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems ⋮ Commitment under uncertainty: Two-stage stochastic matching problems ⋮ Hedging uncertainty: approximation algorithms for stochastic optimization problems ⋮ An approximation algorithm for a facility location problem with stochastic demands and inventories ⋮ Probabilistic models for the Steiner Tree problem ⋮ On the power of static assignment policies for robust facility location problems ⋮ Two-stage flexible-choice problems under uncertainty
This page was built for publication: Integer Programming and Combinatorial Optimization
