Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
From MaRDI portal
Recommendations
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- scientific article; zbMATH DE number 1187079
- scientific article; zbMATH DE number 1264406
Cites work
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- A generalization of Polyak's convergence result for subgradient optimization
- A Simplex-Based Tabu Search Method for Capacitated Network Design
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Capacitated Network Design—Polyhedral Structure and Computation
- Conditional subgradient optimization -- theory and applications
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Generalized Bundle Methods
- scientific article; zbMATH DE number 1187079 (Why is no real title available?)
- scientific article; zbMATH DE number 3783030 (Why is no real title available?)
- scientific article; zbMATH DE number 193993 (Why is no real title available?)
- scientific article; zbMATH DE number 3529629 (Why is no real title available?)
- scientific article; zbMATH DE number 3557512 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- scientific article; zbMATH DE number 1131473 (Why is no real title available?)
- scientific article; zbMATH DE number 1560348 (Why is no real title available?)
- Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems
- Minimization of unsmooth functionals
- Modeling and Solving the Two-Facility Capacitated Network Loading Problem
- Models for planning capacity expansion in local access telecommunication networks
- Networks synthesis and optimum network design problems: Models, solution methods and applications
- On improvements to the analytic center cutting plane method
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- The Cutting-Plane Method for Solving Convex Programs
- Topological design of telecommunication networks --- local access design methods
- Validation of subgradient optimization
Cited in
(82)- Reconstructing (0,1)-matrices from projections using integer programming
- 0-1 reformulations of the multicommodity capacitated network design problem
- A local branching heuristic for the capacitated fixed-charge network design problem
- Service network design in freight transportation
- Planning models for long-haul operations of postal and express shipment companies
- A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- A comparison of formulations and relaxations for cross-dock door assignment problems
- A method for convex minimization based on translated first-order approximations
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
- Fixed charge multicommodity network design using p-partition facets
- Multi-commodity variable upper bound flow models
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design
- Efficient metaheuristics to solve the intermodal terminal location problem
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality
- Alternating Lagrangian decomposition for integrated airline crew scheduling problem
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design
- A Lagrangian relaxation approach for stochastic network capacity expansion with budget constraints
- A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design
- A cutting plane algorithm for the capacitated connected facility location problem
- Revisiting Lagrangian relaxation for network design
- A class of Dantzig-Wolfe type decomposition methods for variational inequality problems
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- Service network design models for two-tier city logistics
- Metric inequalities and the network loading problem
- A first multilevel cooperative algorithm for capacitated multicommodity network design
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
- Solving network design problems via iterative aggregation
- Memetic algorithms
- COLE: a new heuristic approach for fixed charge problem computational results
- New approaches for optimizing over the semimetric polytope
- Prim-based support-graph preconditioners for min-cost flow problems
- New partial aggregations for multicommodity network flow problems: an application to the fixed-charge network design problem
- The transit time constrained fixed charge multi-commodity network design problem
- Benders decomposition for capacitated network design
- On the minimum cost multiple-source unsplittable flow problem
- Linear programming and Lagrangian relaxation heuristics for designing a material flow network on a block layout
- Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints
- An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP
- Improved branching disjunctions for branch-and-bound: an analytic center approach
- A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem
- Applying two efficient hybrid heuristics for hub location problem with fully interconnected backbone and access networks
- A continuous bi-level model for the expansion of highway networks
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
- Model-based automatic neighborhood design by unsupervised learning
- Minimum-cost network design with (dis)economies of scale
- A three-phase heuristic algorithm for fixed-charge capacitated material flow network design with input/output points location
- A stabilized structured Dantzig-Wolfe decomposition method
- A combined matheuristic for the piecewise linear multicommodity network flow problem
- Incremental bundle methods using upper models
- Accelerating the Benders decomposition method: application to stochastic network design problems
- A Closest Benders Cut Selection Scheme for Accelerating the Benders Decomposition Algorithm
- A Lagrangian relaxation approach for expansion of a highway network
- The Benders dual decomposition method
- MIP neighborhood search heuristics for a capacitated fixed-charge network design problem
- Flots entiers et multiflots fractionnaires couplés par une contrainte de capacité
- A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Mathematical formulations for multi-period network design with modular capacity adjustments
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods
- An exact algorithm for the service network design problem with hub capacity constraints
- Avoiding unnecessary demerging and remerging of multi‐commodity integer flows
- Scalable timing-aware network design via Lagrangian decomposition
- Consensus-based Dantzig-Wolfe decomposition
- Benders, metric and cutset inequalities for multicommodity capacitated network design
- A hybrid algorithm for large-scale service network design considering a heterogeneous fleet
- Literature review on Benders cut selection and a multiple cut generation scheme
- Lagrangian relaxation for airport gate assignment problem
- Integrated airline aircraft routing and crew pairing by alternating Lagrangian decomposition
- Sparse dynamic discretization discovery via arc-dependent time discretizations
- New bundle methods for solving Lagrangian relaxation dual problems
- Strengthening dual bounds for multicommodity capacitated network design with unsplittable flow constraints
- About Lagrangian methods in integer optimization
- Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
- A capacity scaling heuristic for the multicommodity capacitated network design problem
- An enhanced dynamic slope scaling procedure with tabu scheme for fixed charge network flow problems
- A hub location problem with fully interconnected backbone and access networks
- Cyclic preference scheduling of nurses using a Lagrangian-based heuristic
- Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design
This page was built for publication: Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5946817)
