Solving a class of stochastic mixed-integer programs with branch and price
From MaRDI portal
Publication:2502208
DOI10.1007/s10107-006-0716-6zbMath1101.90049OpenAlexW2150312772MaRDI QIDQ2502208
Eduardo F. Silva, R. Kevin Wood
Publication date: 12 September 2006
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0716-6
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Continuous location (90B85) Stochastic programming (90C15) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
Related Items (5)
Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints ⋮ The stochastic interdiction median problem with disruption intensity levels ⋮ Convex approximations for a class of mixed-integer recourse models ⋮ Developing work schedules for an inter-city transit system with multiple driver types and fleet types ⋮ Branch and Price for Chance-Constrained Bin Packing
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- A heuristic lagrangean algorithm for the capacitated plant location problem
- Partitioning procedures for solving mixed-variables programming problems
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- Stabilized column generation
- Monte Carlo bounding techniques for determinig solution quality in stochastic programs
- A genetic algorithm for the generalised assignment problem
- A column generation approach to capacitated \(p\)-median problems
- Decomposition algorithms for stochastic programming on a computational grid
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- A Suggested Computation for Maximal Multi-Commodity Network Flows
- The Sample Average Approximation Method for Stochastic Discrete Optimization
- A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
- Decomposition Principle for Linear Programs
- A Linear Programming Approach to the Cutting-Stock Problem
- An Approximation Scheme for Stochastic Integer Programs Arising in Capacity Expansion
- Warehouse-Retailer Network Design Problem
- A Column Generation Approach to the Urban Transit Crew Scheduling Problem
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- A Dual-Based Procedure for Stochastic Facility Location
- Stochastic Convex Programming: Relatively Complete Recourse and Induced Feasibility
- A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
- Exact Solution to a Location Problem with Stochastic Demands
- Introduction to Stochastic Programming
- Airline Crew Scheduling: A New Formulation and Decomposition Algorithm
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- Flight Attendant Rostering for Short-Haul Airline Operations
- Constructing robust crew schedules with bicriteria optimization
- Stochastic unit commitment problem
- Programming under uncertainty: The complete problem
- Stochastic Programs with Recourse
- A scenario-based stochastic programming approach for technology and capacity planning
- A Vehicle Routing Problem with Stochastic Demand
This page was built for publication: Solving a class of stochastic mixed-integer programs with branch and price
