Decomposition Principle for Linear Programs

Cited In (only showing first 100 items - show all)

Cutting planes for branch-and-price algorithms
DeCODe: a community-based algorithm for generating high-quality decompositions of optimization problems
A stabilized structured Dantzig-Wolfe decomposition method
Applications of the method of partial inverses to convex programming: Decomposition
An exact algorithm for IP column generation
A convergence proof for linear mean value cross decomposition
Parallelization of the FICO Xpress-Optimizer
Column generation heuristics for multiple machine, multiple orders per job scheduling problems
Cross decomposition for mixed integer programming
Partitioning procedures for solving mixed-variables programming problems
Application of particle swarm optimization algorithm for solving bi-level linear programming problem
Elective course planning
Crew pairing at Air France
Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization
A penalty function approach for solving bi-level linear programs
Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs
A linear programming approach to reasoning about probabilities
Efficient geometric operations on convex polyhedra, with an application to reachability analysis of hybrid systems
A column generation approach to capacitated \(p\)-median problems
A decomposition algorithm for quadratic programming
Branch-and-price and constraint programming for solving a real-life technician dispatching problem
Operational transportation planning of freight forwarding companies in horizontal coalitions
An optimization framework for the development of efficient one-way car-sharing systems
A nonlinear bilevel model for analysis of electric utility demand-side planning issues
Planning models for long-haul operations of postal and express shipment companies
The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach
Solving a tactical operating room planning problem by a column-generation-based heuristic procedure with four criteria
Decomposition methods in stochastic programming
Parallel processors for planning under uncertainty
Column generation approaches for the software clustering problem
On the convergence of cross decomposition
Polylithic modeling and solution approaches using algebraic modeling systems
About Lagrangian methods in integer optimization
A column generation approach for the split delivery vehicle routing problem
A generalized linear programming model for nurse scheduling
Budgeting with bounded multiple-choice constraints.
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
Mathematical programming algorithms for bin packing problems with item fragmentation
The new Fundamental Tree Algorithm for production scheduling of open pit mines
A branch-price-and-cut algorithm for the workover rig routing problem
A branch-and-price algorithm for the capacitated facility location problem
Stochastic dual dynamic programming for multistage stochastic mixed-integer nonlinear optimization
A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
A framework for collaborative planning and state-of-the-art
Linear mean value cross decomposition: A generalization of the Kornai- Liptak method
Mean value cross decomposition applied to integer programming problems
Strong bounds with cut and column generation for class-teacher timetabling
Integer programming models for round Robin tournaments
Fleet assignment and routing with schedule synchronization constraints
Multi-depot vehicle scheduling problems with time windows and waiting costs
Large-scale unit commitment under uncertainty
A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition
A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
Composite-variable modeling for service parts logistics
Accelerating the regularized decomposition method for two stage stochastic linear problems
Dynamic decision making without expected utility: an operational approach
The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
Column generation decomposition with the degenerate constraints in the subproblem
Efficient decomposition and linearization methods for the stochastic transportation problem
Lagrangean relaxation. (With comments and rejoinder).
Branch and price for the vehicle routing problem with discrete Split deliveries and time windows
A prototype column generation strategy for the multiple container loading problem
A so-called cluster Benders decomposition approach for solving two-stage stochastic linear problems
Compatibility of short and long term objectives for dynamic patient admission scheduling
Decomposition theorems for linear programs
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
On augmented Lagrangian decomposition methods for multistage stochastic programs
Distributed integral column generation for set partitioning problems
Solving the team orienteering arc routing problem with a column generation approach
A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing
Investment in electricity networks with transmission switching
Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
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
Service network design for freight transportation: a review
Vehicle routing problem with elementary shortest path based column generation
Lagrangian duality applied to the vehicle routing problem with time windows
Formulations for a problem of petroleum transportation
The vehicle routing problem with time windows and temporal dependencies
Circulation of railway rolling stock: a branch-and-price approach
A decomposition approach for the general lotsizing and scheduling problem for parallel production lines
Integrated optimization of strategic and tactical planning decisions in forestry
A branch-and-price-and-cut approach for sustainable crop rotation planning
New techniques for cost sharing in combinatorial optimization games
A branch-and-cut approach to the crossing number problem
A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
A finite algorithm to maximize certain pseudoconcave functions on polytopes
The double pivot simplex method
Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
Decomposition in general mathematical programming
A scenario-based stochastic programming approach for technology and capacity planning
LAND USE OPTIMIZATION USING SELF-ORGANIZING ALGORITHMS
A column generation approach to the discrete barycenter problem
An Investigation of Heuristic Decomposition to Tackle Workforce Scheduling and Routing with Time-Dependent Activities Constraints

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)