Decomposition Principle for Linear Programs

Cited in

(only showing first 100 items - show all)

Efficient decomposition and linearization methods for the stochastic transportation problem
An exact algorithm for IP column generation
A nonlinear bilevel model for analysis of electric utility demand-side planning issues
A decomposition approach for the general lotsizing and scheduling problem for parallel production lines
DeCODe: a community-based algorithm for generating high-quality decompositions of optimization problems
New techniques for cost sharing in combinatorial optimization games
Branch and price for the vehicle routing problem with discrete Split deliveries and time windows
Application of particle swarm optimization algorithm for solving bi-level linear programming problem
A generalized linear programming model for nurse scheduling
A column generation approach for the split delivery vehicle routing problem
The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach
Solving the team orienteering arc routing problem with a column generation approach
Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs
Integer programming models for round Robin tournaments
Accelerating the regularized decomposition method for two stage stochastic linear problems
Dynamic decision making without expected utility: an operational approach
Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization
A linear programming approach to reasoning about probabilities
Elective course planning
Parallelization of the FICO Xpress-Optimizer
The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
Solving a tactical operating room planning problem by a column-generation-based heuristic procedure with four criteria
Fleet assignment and routing with schedule synchronization constraints
Multi-depot vehicle scheduling problems with time windows and waiting costs
Stochastic dual dynamic programming for multistage stochastic mixed-integer nonlinear optimization
On augmented Lagrangian decomposition methods for multistage stochastic programs
Planning models for long-haul operations of postal and express shipment companies
Circulation of railway rolling stock: a branch-and-price approach
Budgeting with bounded multiple-choice constraints.
Decomposition theorems for linear programs
Investment in electricity networks with transmission switching
Interior point stabilization for column generation
Formulations and exact algorithms for the vehicle routing problem with time windows
Solving two-stage stochastic programming problems with level decomposition
On the convergence of cross decomposition
A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
Column generation heuristics for multiple machine, multiple orders per job scheduling problems
Decomposition methods in stochastic programming
A convergence proof for linear mean value cross decomposition
Linear mean value cross decomposition: A generalization of the Kornai- Liptak method
Service network design for freight transportation: a review
Parallel processors for planning under uncertainty
Large-scale unit commitment under uncertainty
Distributed integral column generation for set partitioning problems
Column generation decomposition with the degenerate constraints in the subproblem
A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
Crew pairing at Air France
Vehicle routing problem with elementary shortest path based column generation
Column generation approaches for the software clustering problem
A stabilized structured Dantzig-Wolfe decomposition method
Composite-variable modeling for service parts logistics
Lagrangian duality applied to the vehicle routing problem with time windows
Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
Integrated optimization of strategic and tactical planning decisions in forestry
Efficient geometric operations on convex polyhedra, with an application to reachability analysis of hybrid systems
Partitioning procedures for solving mixed-variables programming problems
Polylithic modeling and solution approaches using algebraic modeling systems
Decomposition based hybrid metaheuristics
An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP
The discrete time window assignment vehicle routing problem
Coordinating decentralized linear programs by exchange of primal information
Scheduling pumpoff operations in onshore oilfields under electric-power constraints
A prototype column generation strategy for the multiple container loading problem
Lagrangean relaxation. (With comments and rejoinder).
Formulations for a problem of petroleum transportation
A column generation approach to capacitated \(p\)-median problems
A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
About Lagrangian methods in integer optimization
The vehicle routing problem with time windows and temporal dependencies
On the trade-off between staff-decomposed and activity-decomposed column generation for a staff scheduling problem
MSLiP: A computer code for the multistage stochastic linear programming problem
A framework for collaborative planning and state-of-the-art
A so-called cluster Benders decomposition approach for solving two-stage stochastic linear problems
Mathematical programming algorithms for bin packing problems with item fragmentation
A branch-price-and-cut algorithm for the workover rig routing problem
The new Fundamental Tree Algorithm for production scheduling of open pit mines
Compatibility of short and long term objectives for dynamic patient admission scheduling
Branch-and-price and constraint programming for solving a real-life technician dispatching problem
Operational transportation planning of freight forwarding companies in horizontal coalitions
A penalty function approach for solving bi-level linear programs
A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition
A decomposition algorithm for quadratic programming
Mean value cross decomposition applied to integer programming problems
An optimization framework for the development of efficient one-way car-sharing systems
A branch-and-price algorithm for the capacitated facility location problem
Cutting planes for branch-and-price algorithms
Cross decomposition for mixed integer programming
A branch-and-price-and-cut approach for sustainable crop rotation planning
Strong bounds with cut and column generation for class-teacher timetabling
Applications of the method of partial inverses to convex programming: Decomposition
A hybrid of genetic algorithm and particle swarm optimization for solving bi-level linear programming problem -- a case study on supply chain model
A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework
Stochastic unit commitment problem
Ranking lower bounds for the bin-packing problem
A two-stage solution approach for personalized multi-department multi-day shift scheduling
Simplicial decomposition in nonlinear programming algorithms
Hybrid methods for lot sizing on parallel machines
Exactly solving packing problems with fragmentation
A column generation approach to high school timetabling modeled as a multicommodity flow problem

This page was built for publication: Decomposition Principle for Linear Programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3270239)