Decomposition Principle for Linear Programs
From MaRDI portal
Publication:3270239
Cited in
(only showing first 100 items - show all)- Multi-commodity supply network planning in the forest supply chain
- Some Results on Sparse Matrices
- A mixed integer programming model for multiple stage adaptive testing
- Developing childhood vaccine administration and inventory replenishment policies that minimize open vial wastage
- Statistical estimation of operating reserve requirements using rolling horizon stochastic optimization
- Multi-objective temporal bin packing problem: an application in cloud computing
- Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints
- Modern view on Kantorovich's work in software
- A branch-and-cut approach to the crossing number problem
- On solution of multicoupled models
- Planning online advertising using Gini indices
- Reduced gradient decomposition in multistage linear programming
- Decomposition of loosely coupled integer programs: a multiobjective perspective
- Column generation for a UAV assignment problem with precedence constraints
- Integrated production and transportation scheduling problem under nonlinear cost structures
- Primal Heuristics for Branch-and-Price Algorithms
- 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
- Bilevel linear programming
- A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem
- 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
- Massive data classification via unconstrained support vector machines
- Column generation approaches to ship scheduling with flexible cargo sizes
- Nested decomposition of multistage nonlinear programs with recourse
- The envy-free pricing problem, unit-demand markets and connections with the network pricing problem
- A Lagrangean Relaxation Scheme for Structured Linear Programs With Application To Multicommodity Network Flows
- Integrating Individual and Aggregate Diversity in Top-N Recommendation
- Column generation applied to linear programs in course registration
- A finite algorithm to maximize certain pseudoconcave functions on polytopes
- Periodic airline fleet assignment with time windows, spacing constraints, and time dependent revenues
- Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints
- Grafting for combinatorial binary model using frequent itemset mining
- Reductions of non-separable approximate linear programs for network revenue management
- A column generation approach to the discrete barycenter problem
- DeCODe: a community-based algorithm for generating high-quality decompositions of optimization problems
- Cutting planes for branch-and-price algorithms
- A stabilized structured Dantzig-Wolfe decomposition method
- An exact branch-and-price algorithm for scheduling rescue units during disaster response
- Accelerating column generation for aircraft scheduling using constraint propagation
- LAND USE OPTIMIZATION USING SELF-ORGANIZING ALGORITHMS
- A scenario-based stochastic programming approach for technology and capacity planning
- A projective method for structured nonlinear programs
- Approximations in proximal bundle methods and decomposition of convex programs
- Lagrangian decomposition of block-separable mixed-integer all-quadratic programs
- A proximal trust-region algorithm for column generation stabilization
- An exact algorithm for IP column generation
- Converging upon basic feasible solutions through Dantzig-Wolfe decomposition
- Large-scale unit commitment under uncertainty: an updated literature survey
- Chunking for massive nonlinear kernel classification
- Basic feasible solutions and decomposition principle for linear fractional functionals programming problem
- A two-stage solution approach for personalized multi-department multi-day shift scheduling
- Applications of the method of partial inverses to convex programming: Decomposition
- A Unified Framework for Pricing in Nonconvex Resource Allocation Games
- Using \(\ell^p\)-norms for fairness in combinatorial optimisation
- On one class of dynamic transportation models
- A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages
- Optimizing location-routing and demand allocation in the household waste collection system using a branch-and-price algorithm
- A convergence proof for linear mean value cross decomposition
- Special simplex algorithm for multi-sector problems
- Threshold accepting heuristic for fair flow optimization in wireless mesh networks
- An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
- A method for decomposing mixed-integer linear programming problems with angular structure
- A matrix generation approach for eigenvalue optimization
- Optimisation of maintenance routing and scheduling for offshore wind farms
- A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry
- Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem
- Parallelization of the FICO Xpress-Optimizer
- Bundle-based decomposition for large-scale convex optimization: Error estimate and application to block-angular linear programs
- Solving embedded generalized network problems
- A nontangential cutting plane algorithm
- Timed route approaches for large multi-product multi-step capacitated production planning problems
- Column generation heuristics for multiple machine, multiple orders per job scheduling problems
- Subgradient regularized multivariate convex regression at scale
- An efficient algorithm for optimal routing through constant function market makers
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems
- Network flow problems with one side constraint: A comparison of three solution methods
- A Nested Cross Decomposition Algorithm for Power System Capacity Expansion with Multiscale Uncertainties
- 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
- Load balancing in the parallel optimization of block-angular linear programs
- Analysis of three mathematical models of the staff rostering problem
- Assigning Team Tasks and Multiple Activities to Fixed Work Shifts
- Multi-period stochastic portfolio optimization: block-separable decomposition
- Cross decomposition for mixed integer programming
- Partitioning procedures for solving mixed-variables programming problems
- DEPLETION OF NATURAL RESOURCES AND ACCUMULATION OF CAPITAL WHEN POPULATION IS ENDOGENOUS AN ACTIVITY ANALYSIS
- Bounds on penalties for dummy arcs in transportation networks
- A branch-and-price algorithm for the windy rural postman problem
- Triangularity of the basis in linear programs for material requirements planning
- Dual inequalities for stabilized column generation revisited
- Consistency cuts for Dantzig-Wolfe reformulations
- A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling
- ALGORITHMS FOR OPTIMIZATION OF POWER SYSTEMS SCHEDULES BASED ON THE SIMPLEX METHOD
- The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology
- Application of particle swarm optimization algorithm for solving bi-level linear programming problem
- Elective course planning
- Dynamic factorization in large-scale optimization
- An advanced implementation of the Dantzig—Wolfe decomposition algorithm for linear programming
- Identification of special structure constraints in linear programs
- Dantzig-Wolfe reformulations for binary quadratic problems
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)