Decomposition Principle for Linear Programs
From MaRDI portal
Publication:3270239
DOI10.1287/OPRE.8.1.101zbMATH Open0093.32806OpenAlexW2105560970WikidataQ56814042 ScholiaQ56814042MaRDI QIDQ3270239FDOQ3270239
Authors: George Dantzig, Philip Wolfe
Publication date: 1960
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.8.1.101
Cited In (only showing first 100 items - show all)
- Bilevel linear programming
- Massive data classification via unconstrained support vector machines
- Column generation approaches to ship scheduling with flexible cargo sizes
- Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues
- Accelerating column generation for aircraft scheduling using constraint propagation
- Approximations in proximal bundle methods and decomposition of convex programs
- A proximal trust-region algorithm for column generation stabilization
- A two-stage solution approach for personalized multi-department multi-day shift scheduling
- A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages
- A matrix generation approach for eigenvalue optimization
- A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
- Assigning Team Tasks and Multiple Activities to Fixed Work Shifts
- Dual inequalities for stabilized column generation revisited
- Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
- Bi-dynamic constraint aggregation and subproblem reduction
- Simplicial decomposition in nonlinear programming algorithms
- Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis
- Column-Generation in Integer Linear Programming
- Transfer pricing and decentralized dynamic lot-sizing in multistage, multiproduct production processes
- Revised dantzig-wolfe decomposition for staircase-structured linear programs
- Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times
- The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
- A branch-and-price algorithm for stable workforce assignments with hierarchical skills
- Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- A constraint programming based column generation approach to nurse rostering problems
- Exact algorithms for the double vehicle routing problem with multiple stacks
- Stochastic unit commitment problem
- Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework
- Strategic capacity planning in supply chain design for a new market opportunity
- Flexible weekly tour scheduling for postal service workers using a branch and price
- Branch-and-price approach for the multi-skill project scheduling problem
- Generalized cross decomposition applied to nonlinear integer programming problems: duality gaps and convexification in parts
- Hybrid column generation for large-size covering integer programs: application to transportation planning
- A hybrid column generation with GRASP and path relinking for the network load balancing problem
- A new formulation and approach for the black and white traveling salesman problem
- Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks
- Massive data discrimination via linear support vector machines
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- A general unconstrained model for transfer pricing in multinational supply chains
- A hybrid of genetic algorithm and particle swarm optimization for solving bi-level linear programming problem -- a case study on supply chain model
- Hybrid methods for lot sizing on parallel machines
- Exactly solving packing problems with fragmentation
- Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams
- Concepts of optimality and their uses
- Towards a practical parallelisation of the simplex method
- A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks
- The constrained compartmentalized knapsack problem: mathematical models and solution methods
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
- Airline crew scheduling: state-of-the-art
- On compact formulations for integer programs solved by column generation
- A comparison of five heuristics for the multiple depot vehicle scheduling problem
- A model-based approach and analysis for multi-period networks
- Decentralized control of linear multivariable systems
- Exact algorithms for the matrix bid auction
- Multi-dimensional bin packing problems with guillotine constraints
- Efficient heuristics for two-echelon spare parts inventory systems with an aggregate mean waiting time constraint per local warehouse
- On the choice of explicit stabilizing terms in column generation
- On using approximations of the Benders master problem
- The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm
- Maximal closure on a graph with resource constraints
- A hybrid approach of bundle and Benders applied large mixed linear integer problem
- An introduction to dynamic generative networks: minimum cost flow
- A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
- Locomotive assignment with heterogeneous consists at CN North America
- Plant location with minimum inventory
- A column generation approach to high school timetabling modeled as a multicommodity flow problem
- Hierarchical multiobjective analysis for large-scale systems: Review and current status
- Ranking lower bounds for the bin-packing problem
- Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing
- A branch-and-price approach to \(p\)-median location problems
- Hierarchical design of an integrated production and 2-echelon distribution system
- Packing Steiner trees: A cutting plane algorithm and computational results
- Partitioning mathematical programs for parallel solution
- Combining column generation and constraint programming to solve the tail assignment problem
- Stabilized branch and price with dynamic parameter updating for discontinuous tour scheduling
- Constrained shortest path tour problem: branch-and-price algorithm
- Decomposition theory for multidisciplinary design optimization problems with mixed integer quasiseparable subsystems
- 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
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)