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)
Power efficient uplink scheduling in SC-FDMA: benchmarking by column generation ⋮ Dantzig-Wolfe reformulations for binary quadratic problems ⋮ Bilevel linear programming ⋮ Massive data classification via unconstrained support vector machines ⋮ Building an iterative heuristic solver for a quantum annealer ⋮ Distributed integral column generation for set partitioning problems ⋮ Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times ⋮ Column generation approaches to ship scheduling with flexible cargo sizes ⋮ Dynamic capacitated lot-sizing problems: a classification and review of solution approaches ⋮ Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems ⋮ Constrained shortest path tour problem: branch-and-price algorithm ⋮ A continuous location and maintenance routing problem for offshore wind farms: mathematical models and hybrid methods ⋮ Solving dynamic stochastic economic models by mathematical programming decomposition methods ⋮ Circulation of railway rolling stock: a branch-and-price approach ⋮ A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition ⋮ Efficient decomposition and linearization methods for the stochastic transportation problem ⋮ Generalized proximal point algorithm for convex optimization ⋮ Primal partition programming for block diagonal matrices ⋮ The summed start-up costs in a unit commitment problem ⋮ On augmented Lagrangian decomposition methods for multistage stochastic programs ⋮ Packing Steiner trees: A cutting plane algorithm and computational results ⋮ Investment in electricity networks with transmission switching ⋮ A prototype column generation strategy for the multiple container loading problem ⋮ New formulations for variable cost and size bin packing problems with item fragmentation ⋮ Exact algorithms to minimize makespan on single and parallel batch processing machines ⋮ Dynamic location of modular manufacturing facilities with relocation of individual modules ⋮ A so-called cluster Benders decomposition approach for solving two-stage stochastic linear problems ⋮ Dantzig-Wolfe decomposition and branch-and-price solving in G12 ⋮ Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues ⋮ Analysis of three mathematical models of the staff rostering problem ⋮ Vyacheslav Tanaev: contributions to scheduling and related areas ⋮ Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows ⋮ Determining the optimal flows in zero-time dynamic networks ⋮ Converging upon basic feasible solutions through Dantzig-Wolfe decomposition ⋮ Reverse bridge theorem under constraint partition ⋮ Grafting for combinatorial binary model using frequent itemset mining ⋮ Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints ⋮ Bi-dynamic constraint aggregation and subproblem reduction ⋮ Interior point stabilization for column generation ⋮ A general unconstrained model for transfer pricing in multinational supply chains ⋮ Formulations and exact algorithms for the vehicle routing problem with time windows ⋮ On the trade-off between staff-decomposed and activity-decomposed column generation for a staff scheduling problem ⋮ Solving two-stage stochastic programming problems with level decomposition ⋮ An exact approach for the personnel task rescheduling problem with task retiming ⋮ The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time ⋮ An exact branch-and-price algorithm for scheduling rescue units during disaster response ⋮ The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology ⋮ Alternative mathematical models and solution approaches for lot-sizing and scheduling problems in the brewery industry: analyzing two different situations ⋮ A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing ⋮ Multi-period stochastic portfolio optimization: block-separable decomposition ⋮ Service network design for freight transportation: a review ⋮ Strategic planning in fractional aircraft ownership programs ⋮ Stabilized branch and price with dynamic parameter updating for discontinuous tour scheduling ⋮ Clustering clinical departments for wards to achieve a prespecified blocking probability ⋮ Accelerating column generation for aircraft scheduling using constraint propagation ⋮ Vehicle routing problem with elementary shortest path based column generation ⋮ Decomposition and dynamic cut generation in integer linear programming ⋮ Lagrangian duality applied to the vehicle routing problem with time windows ⋮ Branch and price for the vehicle routing problem with discrete Split deliveries and time windows ⋮ A multistage stochastic programming approach for preventive maintenance scheduling of GENCOs with natural gas contract ⋮ Solving a class of stochastic mixed-integer programs with branch and price ⋮ Simulation-based optimisation for stochastic maintenance routing in an offshore wind farm ⋮ Coordinating resources in Stackelberg security games ⋮ A study on distributed optimization over large-scale networked systems ⋮ Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition ⋮ A resource constrained scheduling problem with multiple independent producers and a single linking constraint: a coal supply chain example ⋮ Formulations for a problem of petroleum transportation ⋮ Partially distributed outer approximation ⋮ A simplex-type algorithm for continuous linear programs with constant coefficients ⋮ A decomposition method for structured quadratic programming problems ⋮ Branch-and-price for a class of nonconvex mixed-integer nonlinear programs ⋮ A column generation approach to multiscale capacity planning for power-intensive process networks ⋮ DeCODe: a community-based algorithm for generating high-quality decompositions of optimization problems ⋮ Coordination mechanisms with mathematical programming models for decentralized decision-making: a literature review ⋮ Lagrangian relaxation of the generic materials and operations planning model ⋮ Special simplex algorithm for multi-sector problems ⋮ A decomposition method for structured linear and nonlinear programs ⋮ On direct sums of Markovian decision process ⋮ Solving robust bin-packing problems with a branch-and-price approach ⋮ On the complexity of surrogate and group relaxation for integer linear programs ⋮ Design and implementation of a modular interior-point solver for linear optimization ⋮ Decomposition of mathematical programming problems by dynamic programming and its application to block-diagonal geometric programms ⋮ An augmented Lagrangian decomposition method for block diagonal linear programming problems ⋮ Optimization of large-scale systems ⋮ Scheduling heterogeneous delivery tasks on a mixed logistics platform ⋮ A two-stage solution approach for personalized multi-department multi-day shift scheduling ⋮ Alternating direction splittings for block angular parallel optimization ⋮ Modern view on Kantorovich's work in software ⋮ Dynamic decision making without expected utility: an operational approach ⋮ A proximal trust-region algorithm for column generation stabilization ⋮ Threshold accepting heuristic for fair flow optimization in wireless mesh networks ⋮ A decomposition-based approach for the multiperiod multiproduct distribution planning problem ⋮ An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems ⋮ Decomposition of loosely coupled integer programs: a multiobjective perspective ⋮ Stochastic dual dynamic programming for multistage stochastic mixed-integer nonlinear optimization ⋮ Large-scale unit commitment under uncertainty ⋮ Timed route approaches for large multi-product multi-step capacitated production planning problems ⋮ A decomposition approach for the general lotsizing and scheduling problem for parallel production lines ⋮ A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages ⋮ Row-reduced column generation for degenerate master problems
This page was built for publication: Decomposition Principle for Linear Programs
