Pages that link to "Item:Q2783901"
From MaRDI portal
The following pages link to A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem (Q2783901):
Displaying 15 items.
- Decomposition based hybrid metaheuristics (Q319285) (← links)
- A metaheuristic for stochastic service network design (Q707730) (← links)
- Modeling reverse logistic tasks within closed-loop supply chains: an example from the automotive industry (Q819103) (← links)
- A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem (Q992649) (← links)
- Hybridizing exact methods and metaheuristics: a taxonomy (Q1042187) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Service network design for freight transportation: a review (Q2480799) (← links)
- Network design and flow problems with cross-arc costs (Q2482771) (← links)
- Optimizing package express operations in China (Q2670590) (← links)
- Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization (Q2950518) (← links)
- CORRELATIONS IN STOCHASTIC PROGRAMMING: A CASE FROM STOCHASTIC SERVICE NETWORK DESIGN (Q3439885) (← links)
- Stochastic Network Design for Planning Scheduled Transportation Services: The Value of Deterministic Solutions (Q5137443) (← links)
- Matheuristics for the capacitated p‐median problem (Q5246830) (← links)
- Solving the bi‐objective capacitated <i>p</i>‐median problem with multilevel capacities using compromise programming and VNS (Q6088248) (← links)
- Genetic Algorithm with Hybrid Integer Linear Programming Crossover Operators for the Car-Sequencing Problem (Q6160231) (← links)
