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
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?)
An investigation of heuristic decomposition to tackle workforce scheduling and routing with time-dependent activities constraints
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
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
Operational transportation planning of freight forwarding companies in horizontal coalitions
An optimization framework for the development of efficient one-way car-sharing systems
A nonlinear bilevel model for analysis of electric utility demand-side planning issues
Planning models for long-haul operations of postal and express shipment companies
The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach
Solving a tactical operating room planning problem by a column-generation-based heuristic procedure with four criteria
Decomposition methods in stochastic programming
Parallel processors for planning under uncertainty
Column generation approaches for the software clustering 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)