Pages that link to "Item:Q4530653"
From MaRDI portal
The following pages link to A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem (Q4530653):
Displaying 50 items.
- A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem (Q323161) (← links)
- A continuous bi-level model for the expansion of highway networks (Q336804) (← links)
- A Lagrangian relaxation approach for expansion of a highway network (Q512983) (← links)
- Benders, metric and cutset inequalities for multicommodity capacitated network design (Q632387) (← links)
- Scatter search for network design problem (Q817138) (← links)
- A capacity scaling heuristic for the multicommodity capacitated network design problem (Q837097) (← links)
- Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks (Q953207) (← links)
- Alternating control tree search for knapsack/covering problems (Q972644) (← links)
- The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation (Q987675) (← links)
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- A local branching heuristic for the capacitated fixed-charge network design problem (Q1038297) (← links)
- Service network design in freight transportation (Q1582187) (← links)
- A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem'' (Q1600948) (← links)
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
- Matheuristics for the single-path design-balanced service network design problem (Q1652031) (← links)
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design (Q1754304) (← links)
- Selecting hierarchical facilities in a service-operations environment (Q1873008) (← links)
- Separating tight metric inequalities by bilevel programming (Q1939716) (← links)
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design (Q2064301) (← links)
- Parallel subgradient algorithm with block dual decomposition for large-scale optimization (Q2077960) (← links)
- Directed fixed charge multicommodity network design: a cutting plane approach using polar duality (Q2077967) (← links)
- Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design (Q2248747) (← links)
- Algorithms for the non-bifurcated network design problem (Q2271128) (← links)
- Sustainability SI: multimode multicommodity network design model for intermodal freight transportation with transfer and emission costs (Q2357879) (← links)
- A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design (Q2357911) (← links)
- Multiobjective design of survivable IP networks (Q2379874) (← links)
- Solving a capacitated hub location problem (Q2384615) (← links)
- A cutting plane algorithm for the capacitated connected facility location problem (Q2393652) (← links)
- Mathematical programming based heuristics for the 0--1 MIP: a survey (Q2401328) (← links)
- Revisiting Lagrangian relaxation for network design (Q2414466) (← links)
- Lagrangian based heuristics for the multicommodity network flow problem with fixed costs on paths (Q2469589) (← links)
- Metric inequalities and the network loading problem (Q2471279) (← links)
- A first multilevel cooperative algorithm for capacitated multicommodity network design (Q2489307) (← links)
- Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734) (← links)
- Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design (Q2514794) (← links)
- Memetic algorithms (Q2573010) (← links)
- The transit time constrained fixed charge multi-commodity network design problem (Q2669603) (← links)
- Benders Decomposition for Capacitated Network Design (Q2835663) (← links)
- Anycasting in connection-oriented computer networks: Models, algorithms and results (Q2930587) (← links)
- On the minimum cost multiple-source unsplittable flow problem (Q3004201) (← links)
- Linear programming and Lagrangian relaxation heuristics for designing a material flow network on a block layout (Q3055322) (← links)
- Lower bounding techniques for the degree-constrained network design problem (Q3057091) (← links)
- Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints (Q3057143) (← links)
- Applications of meta-heuristics to traffic engineering in IP networks (Q3087845) (← links)
- Effective material flow at an assembly facility (Q3168925) (← links)
- Optimization of OSPF Routing in IP Networks (Q3404471) (← links)
- Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times (Q3458742) (← links)
- A three-phase heuristic algorithm for fixed-charge capacitated material flow network design with input/output points location (Q3532778) (← links)
- Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities (Q4599310) (← links)
- MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem (Q5149549) (← links)
