Decomposition Principle for Linear Programs

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

zbMATH Keywords

applications of probability theory and statistics

Related Items

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, 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, Lagrangean relaxation. (With comments and rejoinder)., Dynamic factorization in large-scale optimization, On using approximations of the Benders master problem, Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs, On solution of multicoupled models, Ranking lower bounds for the bin-packing problem, A column generation approach to job grouping for flexible manufacturing systems, On the efficacy of distributed simplex algorithms for linear programming, Cascading-heuristics for the solution of staircase linear programs, Network planning under uncertainty with an application to hydropower generation, Approximations in proximal bundle methods and decomposition of convex programs, Dantzig-Wolfe decomposition approach to the vehicle assignment problem with demand uncertainty in a hybrid hub-and-spoke network, Hierarchical multiobjective analysis for large-scale systems: Review and current status, A linear programming approach to reasoning about probabilities, Network flow problems with one side constraint: A comparison of three solution methods, An exact algorithm for IP column generation, Empirical analysis for the VRPTW with a multigraph representation for the road network, Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem, A heuristic solution procedure for multicommodity integer flows, Exact computational solution of modularity density maximization by effective column generation, A column generation approach for the location-routing problem with time windows, A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine, A profit-maximization location-routing-pricing problem: a branch-and-price algorithm, GNU Oflox: an academic software for the minimal cost network flow problem, Decomposition methods in stochastic programming, Maximal closure on a graph with resource constraints, Decomposition of linear programs using parallel computation, Parallel optimization for traffic assignment, Bounds on penalties for dummy arcs in transportation networks, Triangularity of the basis in linear programs for material requirements planning, A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems, Lagrangian dual ascent by generalized linear programming, Partitioning mathematical programs for parallel solution, Partitioning procedures for solving mixed-variables programming problems, Hierarchical structures in organizations: A conceptual framework, Column generation applied to linear programs in course registration, Variable neighborhood search accelerated column generation for the nurse rostering problem, Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows, Coordinated lab-clinics: a tactical assignment problem in healthcare, Scheduling cleaning activities on trains by minimizing idle times, A heuristic decomposition approach to optimal control in a water supply model, A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem, Compatibility of short and long term objectives for dynamic patient admission scheduling, Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing, Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm, A column generation approach to capacitated \(p\)-median problems, Large-scale unit commitment under uncertainty: an updated literature survey, The sport teams grouping problem, Optimality tests for partitioning and sectional search algorithms, An optimal tool selection procedure for the initial design phase of a flexible manufacturing system, Efficient solution selection for two-stage stochastic programs, A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, The envy-free pricing problem, unit-demand markets and connections with the network pricing problem, Integrated optimization of strategic and tactical planning decisions in forestry, Optimisation of maintenance routing and scheduling for offshore wind farms, A multi-item approach to repairable stocking and expediting in a fluctuating demand environment, A new cross decomposition method for stochastic mixed-integer linear programming, A column generation approach to high school timetabling modeled as a multicommodity flow problem, A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function, Solving the team orienteering arc routing problem with a column generation approach, The demand weighted vehicle routing problem, Linear mean value cross decomposition: A generalization of the Kornai- Liptak method, A decomposition technique for mixed integer programming problems, The min-conflict packing problem, Strong bounds with cut and column generation for class-teacher timetabling, A branch-and-price approach to \(p\)-median location problems, Lagrangian decomposition of block-separable mixed-integer all-quadratic programs, Decentralized control of linear multivariable systems, Reduced gradient decomposition in multistage linear programming, Decomposition theorems for linear programs, Multistage linear programming for discrete optimal control with distributed-lags, A primal algorithm for interval linear-programming problems, Parallel decomposition of multistage stochastic programming problems, Hierarchical design of an integrated production and 2-echelon distribution system, Fleet assignment and routing with schedule synchronization constraints, Multi-depot vehicle scheduling problems with time windows and waiting costs, On the choice of explicit stabilizing terms in column generation, Solving a tactical operating room planning problem by a column-generation-based heuristic procedure with four criteria, Multi-commodity supply network planning in the forest supply chain, Price-directive decomposition applied to routing in telecommunication networks, Mean value cross decomposition applied to integer programming problems, Crew pairing at Air France, Locomotive assignment with heterogeneous consists at CN North America, Accelerating the regularized decomposition method for two stage stochastic linear problems, Two- and three-index formulations of the minimum cost multicommodity \(k\)-splittable flow problem, Plant location with minimum inventory, A generalized linear programming model for nurse scheduling, Planning models for long-haul operations of postal and express shipment companies, Optimization analysis for design and planning of multi-project programs, HOP: A software tool for production scheduling at Bridgestone/Firestone Off-The-Road, Solving embedded generalized network problems, Parallel computing in nonconvex programming, A penalty function approach for solving bi-level linear programs, Capital budgeting with Benders' decomposition, An exact algorithm for multiple depot bus scheduling, Load balancing in the parallel optimization of block-angular linear programs, A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem, Transfer pricing and decentralized dynamic lot-sizing in multistage, multiproduct production processes, A nontangential cutting plane algorithm, Integrated job scheduling and network routing, Basic feasible solutions and decomposition principle for linear fractional functionals programming problem, Matheuristics: survey and synthesis, Vessel Service Planning in Seaports, An Image-Based Approach to Detecting Structural Similarity Among Mixed Integer Programs, A Nested Cross Decomposition Algorithm for Power System Capacity Expansion with Multiscale Uncertainties, Efficient emission reduction through dynamic supply mode selection, CPM-Cost: Ein parametrischer Dekompositionsalgorithmus, Decomposition principle for indefinite quadratic programe, Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows, Foundations of operations research: from linear programming to data envelopment analysis, Routing in offshore wind farms: a multi-period location and maintenance problem with joint use of a service operation vessel and a safe transfer boat, Integer programming models for round Robin tournaments, A Unified Framework for Pricing in Nonconvex Resource Allocation Games, An Adaptive Optimization Method for Chop Saw Systems, Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows, Assigning Team Tasks and Multiple Activities to Fixed Work Shifts, Consensus-based Dantzig-Wolfe decomposition, Reductions of non-separable approximate linear programs for network revenue management, Solving a real-world multi-depot multi-period petrol replenishment problem with complex loading constraints, The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm, A statistical reliability approach to linear programming, A projective method for structured nonlinear programs, Planning Online Advertising Using Gini Indices, Ein Lösungsansatz für ein spezielles zweistufiges stochastisches Optimierungsproblem, Exact Approaches for Designing Multifacility Buy-at-Bulk Networks, From High-Level Model to Branch-and-Price Solution in G12, A branch-and-price algorithm for the windy rural postman problem, Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach, A column generation approach for the split delivery vehicle routing problem, Some Results on Sparse Matrices, On one class of dynamic transportation models, Budgeting with bounded multiple-choice constraints., Scenario aggregation for supply chain quantity-flexibility contract, Multistage quadratic stochastic programming, Primal Heuristics for Branch-and-Price Algorithms, A scenario-based stochastic programming approach for technology and capacity planning, Beiträge zur Dekomposition von linearen Programmen, A Time-Indexed Generalized Vehicle Routing Model and Stabilized Column Generation for Military Aircraft Mission Planning, Primal- und Dual-Algorithmen zur Optimierung von Markov-Prozessen, Decentralized control of large scale systems with dynamic interconnected subsystems, A branch-and-price-and-cut approach for sustainable crop rotation planning, Column generation for a UAV assignment problem with precedence constraints, Randomized parameterized algorithms for the kidney exchange problem, Distributed Optimization in Networking: Recent Advances in Combinatorial and Robust Formulations, Consistency Cuts for Dantzig-Wolfe Reformulations, LAND USE OPTIMIZATION USING SELF-ORGANIZING ALGORITHMS, Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem, New techniques for cost sharing in combinatorial optimization games, Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems, A Constructive Proof of the Representation Theorem for Polyhedral Sets Based on Fundamental Definitions, A convergence proof for linear mean value cross decomposition, Network Inspection for Detecting Strategic Attacks, Genetic Column Generation: Fast Computation of High-Dimensional Multimarginal Optimal Transport Problems, LP-based dual bounds for the maximum quasi-clique problem, Using \(\ell^p\)-norms for fairness in combinatorial optimisation, Multi-objective temporal bin packing problem: an application in cloud computing, Simultaneously exploiting two formulations: an exact Benders decomposition approach, Nested decomposition of multistage nonlinear programs with recourse, Selective routing problem with synchronization, On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms, A two-phase Pareto front method for solving the bi-objective personnel task rescheduling problem, A time-space formulation for the locomotive routing problem at the Canadian National Railways, Decomposition Branching for Mixed Integer Programming, A POINT BASIS FOR MULTIVARIABLE PIECEWISE LINEAR INTERPOLATION AND DESIGN CENTERING, An improved formulation for the inventory routing problem with time-varying demands, Stochastic Decomposition Method for Two-Stage Distributionally Robust Linear Optimization, Parallelization of the FICO Xpress-Optimizer, A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service, On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage, Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches, Generalized cross decomposition applied to nonlinear integer programming problems: duality gaps and convexification in parts, Chunking for massive nonlinear kernel classification, ALGORITHMS FOR OPTIMIZATION OF POWER SYSTEMS SCHEDULES BASED ON THE SIMPLEX METHOD, A column generation approach to the discrete barycenter problem, Revised dantzig-wolfe decomposition for staircase-structured linear programs, A note on column generation in Dantzig—Wolfe decomposition algorithms, A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows, An Investigation of Heuristic Decomposition to Tackle Workforce Scheduling and Routing with Time-Dependent Activities Constraints, A simple modification of dantzig-wolfe decomposition, The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures, A finite algorithm to maximize certain pseudoconcave functions on polytopes, A Decomposition Method for Interval Linear Fractional Programming, Lösung großer linearer Regionalplanungsprobleme mit der Methode vonDantzig undWolfe, Integer multicommodity flow problems, Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem, On finding and detecting efficient assignments in the case of multiple inputs and outputs, Stochastic unit commitment problem, Concepts of optimality and their uses, A dual decomposition algorithm, Decentralized control systems theory A critical evaluation, Simplicial decomposition in nonlinear programming algorithms, A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron, A revised iterative algorithm for decomposition goal programming, ALMOST OPTIMAL SOLUTIONS TO k-CLUSTERING PROBLEMS, Strategic capacity planning in supply chain design for a new market opportunity, A method for decomposing mixed-integer linear programs with staircase structure, On a distributed implementation of a decomposition method for multistage linear stochastic programs, The use of relaxation techniques to solve certain mathematical decision‐making problems, Linear programming by nested decomposition : the primal decomplex method, A decomposition algorithm for quadratic programming, The decentralized profit maximization of interconnected production systems Part II. Price coordination and buffer storage, Un algoritmo para el problema de maxima entropia en el caso discreto, Reductions of Approximate Linear Programs for Network Revenue Management, Optimal design of a manpower system, Massive data discrimination via linear support vector machines, Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis, A decomposition principle for a generalized linear and piece-wise linear program, Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams, Dual Inequalities for Stabilized Column Generation Revisited, Unit Commitment by Column Generation, Rank-Cluster-and-Prune: An algorithm for generating clusters in complex set partitioning problems, DEPLETION OF NATURAL RESOURCES AND ACCUMULATION OF CAPITAL WHEN POPULATION IS ENDOGENOUS AN ACTIVITY ANALYSIS, A branch-price-and-cut algorithm for the min-maxk-vehicle windy rural postman problem, Column-Generation in Integer Linear Programming, Vector Space Decomposition for Solving Large-Scale Linear Programs, Parallelization of the FICO Xpress-Optimizer, An Asymptotic Solution of Dresher’s Guessing Game, Decentralized control of large scale systems with dynamic interconnected subsystems, Hierarchical Benders Decomposition for Open-Pit Mine Block Sequencing, A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling, A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times, A method for decomposing mixed-integer linear programming problems with angular structure, Identification of special structure constraints in linear programs, An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming, Branch-Price-and-Cut Algorithms for the Vehicle Routing Problem with Stochastic and Correlated Travel Times, Integrating Individual and Aggregate Diversity in Top-N Recommendation, The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm, The vehicle routing problem with time windows and temporal dependencies, Cutting planes for branch-and-price algorithms, Estimation of a distribution function by extrapolating upper and lower bounds, Cross decomposition for mixed integer programming, Parallel implementation of augmented Lagrangian method within L-shaped method for stochastic linear programs, Decentralization model with flexible multi-goals and concessions, Unnamed Item, The D_LP decision support system and its extension to stochastic programming^∗, George B. Dantzig: a legendary life in mathematical programming, Applications of the method of partial inverses to convex programming: Decomposition, Solving staircase linear programs by the simplex method, 1: Inversion, Unnamed Item