Decomposition Principle for Linear Programs

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

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
Chunking for massive nonlinear kernel classification
Optimisation of maintenance routing and scheduling for offshore wind farms
Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
A nontangential cutting plane algorithm
Solving embedded generalized network problems
Network flow problems with one side constraint: A comparison of three solution methods
Analysis of three mathematical models of the staff rostering problem
Multi-period stochastic portfolio optimization: block-separable decomposition
An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming
Identification of special structure constraints in linear programs
Solving staircase linear programs by the simplex method, 1: Inversion
Dynamic factorization in large-scale optimization
An optimal tool selection procedure for the initial design phase of a flexible manufacturing system
Primal partition programming for block diagonal matrices
Solving a class of stochastic mixed-integer programs with branch and price
Comparing branch-and-price algorithms for the multi-commodity \(k\)-splittable maximum flow problem
Parallel implementation of augmented Lagrangian method within L-shaped method for stochastic linear programs
The binary search decomposition in a decentralized organization
Vector Space Decomposition for Solving Large-Scale Linear Programs
An augmented Lagrangian decomposition method for block diagonal linear programming problems
Exact decomposition approaches for Markov decision processes: a survey
A Branch and Price algorithm for the \(k\)-splittable maximum flow problem
Decentralized control of large scale systems with dynamic interconnected subsystems
Two- and three-index formulations of the minimum cost multicommodity \(k\)-splittable flow problem
Decentralization model with flexible multi-goals and concessions
Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times
Lösung großer linearer Regionalplanungsprobleme mit der Methode vonDantzig undWolfe
A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron
A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
Optimization analysis for design and planning of multi-project programs
Hierarchical benders decomposition for open-pit mine block sequencing
Numerical behavior of LP algorithms based upon the decomposition principle
A shortest path-based approach to the multileaf collimator sequencing problem
An exact algorithm for multiple depot bus scheduling
Convergence behavior of decomposition algorithms for linear programs
Decomposition of linear programs using parallel computation
A generalization of column generation to accelerate convergence
Turning restriction design in traffic networks with a budget constraint
The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time
Integrated job scheduling and network routing
Multistage quadratic stochastic programming
Generalized proximal point algorithm for convex optimization
Exact and heuristic solution approaches for the integrated job scheduling and constrained network routing problem
From High-Level Model to Branch-and-Price Solution in G12
Bi-level programming problem in the supply chain and its solution algorithm
A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool
Reductions of approximate linear programs for network revenue management
About the minimum mean cycle-canceling algorithm
Title not available (Why is that?)
Optimization of oil tanker schedules by decomposition, column generation, and time-space network techniques
Maximum flow problem on dynamic generative network flows with time-varying bounds
Die Bedeutung des Operations Research fuer die hierarchische Produktionsplanung
Parallel decomposition of multistage stochastic programming problems
A robust framework for task-related resident scheduling
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
Decomposition and dynamic cut generation in integer linear programming
Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
Multi-commodity supply network planning in the forest supply chain
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

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)