Pages that link to "Item:Q3637378"
From MaRDI portal
The following pages link to Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design (Q3637378):
Displayed 39 items.
- Multimodal freight transportation planning: a literature review (Q297170) (← links)
- A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem (Q323161) (← links)
- Mixed integer non-linear programming models for green network design (Q339579) (← links)
- Benders, metric and cutset inequalities for multicommodity capacitated network design (Q632387) (← links)
- A hybrid algorithm for large-scale service network design considering a heterogeneous fleet (Q666955) (← links)
- A metaheuristic for stochastic service network design (Q707730) (← links)
- A capacity scaling heuristic for the multicommodity capacitated network design problem (Q837097) (← 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)
- 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)
- Optimisation of transportation service network using \(\kappa\)-node large neighbourhood search (Q1652466) (← links)
- Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design (Q1754304) (← links)
- Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design (Q2064301) (← 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)
- Modeling interdependencies in infrastructure systems using multi-layered network flows (Q2297565) (← links)
- A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design (Q2357911) (← links)
- Optimization models for forest road upgrade planning (Q2369960) (← links)
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem (Q2378415) (← links)
- A cutting plane algorithm for the capacitated connected facility location problem (Q2393652) (← links)
- Service network design models for two-tier city logistics (Q2448205) (← 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)
- The single-node dynamic service scheduling and dispatching problem (Q2572807) (← links)
- The index selection problem with configurations and memory limitation: a scatter search approach (Q2668806) (← links)
- The transit time constrained fixed charge multi-commodity network design problem (Q2669603) (← links)
- Scheduled Service Network Design for Freight Rail Transportation (Q2875607) (← links)
- Linear programming and Lagrangian relaxation heuristics for designing a material flow network on a block layout (Q3055322) (← links)
- Lagrangean-based decomposition algorithms for multicommodity network design problems with penalized constraints (Q3057143) (← links)
- Progressive hedging-based metaheuristics for stochastic network design (Q3100691) (← links)
- A three-phase heuristic algorithm for fixed-charge capacitated material flow network design with input/output points location (Q3532778) (← links)
- A novel modeling approach for express package carrier planning (Q3627939) (← links)
- A Learning-Based Matheuristic for Stochastic Multicommodity Network Design (Q4995093) (← links)
- Data-Driven Robust Resource Allocation with Monotonic Cost Functions (Q5031001) (← links)
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422) (← links)
- Minimum‐cost flow problems having arc‐activation costs (Q6077360) (← links)
- Metaheuristics: A Canadian Perspective (Q6102854) (← links)