Decomposition Principle for Linear Programs
From MaRDI portal
Publication:3270239
DOI10.1287/OPRE.8.1.101zbMath0093.32806OpenAlexW2105560970WikidataQ56814042 ScholiaQ56814042MaRDI QIDQ3270239
Philip Wolfe, George B. Dantzig
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
Related Items (only showing first 100 items - show all)
Developing childhood vaccine administration and inventory replenishment policies that minimize open vial wastage ⋮ Statistical estimation of operating reserve requirements using rolling horizon stochastic optimization ⋮ Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints ⋮ Globally optimal clusterwise regression by column generation enhanced with heuristics, sequencing and ending subset optimization ⋮ Decomposition theory for multidisciplinary design optimization problems with mixed integer quasiseparable subsystems ⋮ Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs ⋮ A comparison of five heuristics for the multiple depot vehicle scheduling problem ⋮ Operational transportation planning of freight forwarding companies in horizontal coalitions ⋮ Branch-and-price and constraint programming for solving a real-life technician dispatching problem ⋮ An optimization framework for the development of efficient one-way car-sharing systems ⋮ Column generation approaches for the software clustering problem ⋮ Combining column generation and constraint programming to solve the tail assignment problem ⋮ A generalization of column generation to accelerate convergence ⋮ Decomposition based hybrid metaheuristics ⋮ The discrete time window assignment vehicle routing problem ⋮ An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP ⋮ Coordinating decentralized linear programs by exchange of primal information ⋮ Scheduling pumpoff operations in onshore oilfields under electric-power constraints ⋮ 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 branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times ⋮ The new Fundamental Tree Algorithm for production scheduling of open pit mines ⋮ Managing large fixed costs in vehicle routing and crew scheduling problems solved by column generation ⋮ Hybrid column generation for large-size covering integer programs: application to transportation planning ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ A hybrid column generation with GRASP and path relinking for the network load balancing problem ⋮ Mathematical programming algorithms for bin packing problems with item fragmentation ⋮ 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 ⋮ A branch-price-and-cut algorithm for the workover rig routing problem ⋮ A constraint programming based column generation approach to nurse rostering problems ⋮ Exact algorithms for the double vehicle routing problem with multiple stacks ⋮ Hybrid methods for lot sizing on parallel machines ⋮ Exactly solving packing problems with fragmentation ⋮ A branch-and-price algorithm for the capacitated facility location problem ⋮ A model-based approach and analysis for multi-period networks ⋮ Composite-variable modeling for service parts logistics ⋮ A matrix generation approach for eigenvalue optimization ⋮ In situ column generation for a cutting-stock problem ⋮ A stabilized structured Dantzig-Wolfe decomposition method ⋮ Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework ⋮ A hybrid approach of bundle and Benders applied large mixed linear integer problem ⋮ The binary search decomposition in a decentralized organization ⋮ A heuristic for the long-term electricity generation planning problem using the Bloom and Gallant formulation ⋮ A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry ⋮ Exact decomposition approaches for Markov decision processes: a survey ⋮ Flexible weekly tour scheduling for postal service workers using a branch and price ⋮ Optimization of oil tanker schedules by decomposition, column generation, and time-space network techniques ⋮ Elective course planning ⋮ The constrained compartmentalized knapsack problem: mathematical models and solution methods ⋮ Balanced allocation mechanism: an optimal mechanism for multiple keywords sponsored search auctions ⋮ A hybrid of genetic algorithm and particle swarm optimization for solving bi-level linear programming problem -- a case study on supply chain model ⋮ Comparing branch-and-price algorithms for the multi-commodity \(k\)-splittable maximum flow problem ⋮ MSLiP: A computer code for the multistage stochastic linear programming problem ⋮ An introduction to dynamic generative networks: minimum cost flow ⋮ Goal programming in the context of the assignment problem and a computationally effective solution method ⋮ Branch-and-price approach for the multi-skill project scheduling problem ⋮ Turning restriction design in traffic networks with a budget constraint ⋮ A Branch and Price algorithm for the \(k\)-splittable maximum flow problem ⋮ A robust framework for task-related resident scheduling ⋮ Column generation heuristics for multiple machine, multiple orders per job scheduling problems ⋮ Augmented Lagrangian method within L-shaped method for stochastic linear programs ⋮ Solving bi-level linear programming problem through hybrid of immune genetic algorithm and particle swarm optimization algorithm ⋮ Exact and heuristic solution approaches for the integrated job scheduling and constrained network routing problem ⋮ About the minimum mean cycle-canceling algorithm ⋮ George Dantzig in the development of economic analysis ⋮ A branch-and-cut approach to the crossing number problem ⋮ The double pivot simplex method ⋮ The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times ⋮ Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems ⋮ A mixed integer programming model for multiple stage adaptive testing ⋮ Exact algorithms for the matrix bid auction ⋮ The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach ⋮ Decomposition in general mathematical programming ⋮ Polylithic modeling and solution approaches using algebraic modeling systems ⋮ Towards a practical parallelisation of the simplex method ⋮ Multi-dimensional bin packing problems with guillotine constraints ⋮ A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes ⋮ Application of particle swarm optimization algorithm for solving bi-level linear programming problem ⋮ Maximum flow problem on dynamic generative network flows with time-varying bounds ⋮ A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool ⋮ Column generation decomposition with the degenerate constraints in the subproblem ⋮ A column generation based heuristic for sensor placement, activity scheduling and data routing in wireless sensor networks ⋮ Dantzig-Wolfe and block coordinate-descent decomposition in large-scale integrated refinery-planning ⋮ Efficient geometric operations on convex polyhedra, with an application to reachability analysis of hybrid systems ⋮ A framework for collaborative planning and state-of-the-art ⋮ Efficient heuristics for two-echelon spare parts inventory systems with an aggregate mean waiting time constraint per local warehouse ⋮ Parallel processors for planning under uncertainty ⋮ On the convergence of cross decomposition ⋮ Numerical behavior of LP algorithms based upon the decomposition principle ⋮ A shortest path-based approach to the multileaf collimator sequencing problem ⋮ Bi-level programming problem in the supply chain and its solution algorithm ⋮ Convergence behavior of decomposition algorithms for linear programs ⋮ Die Bedeutung des Operations Research fuer die hierarchische Produktionsplanung ⋮ A nonlinear bilevel model for analysis of electric utility demand-side planning issues ⋮ About Lagrangian methods in integer optimization ⋮ On compact formulations for integer programs solved by column generation ⋮ Airline crew scheduling: state-of-the-art
This page was built for publication: Decomposition Principle for Linear Programs
