Pages that link to "Item:Q3392143"

The following pages link to The Capacitated <i>m</i>-Ring-Star Problem (Q3392143):

Displaying 50 items.

• Optimal capacitated ring trees (Q286687) (← links)
• Models for a Steiner multi-ring network design problem with revenues (Q301388) (← links)
• Capacitated \(m\) two-node survivable star problem (Q325452) (← links)
• A branch-and-cut algorithm for two-level survivable network design problems (Q342262) (← links)
• An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem (Q439317) (← links)
• Multiperiod location-routing with decoupled time scales (Q439365) (← links)
• Multiple depot ring star problem: a polyhedral study and an exact algorithm (Q513163) (← links)
• A heuristic procedure for the capacitated \(m\)-ring-star problem (Q613432) (← links)
• Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
• The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm (Q643033) (← links)
• Heuristic algorithms for the multi-depot ring-star problem (Q1043363) (← links)
• The \(p\)-arborescence star problem: formulations and exact solution approaches (Q1628121) (← links)
• Exact algorithms for bi-objective ring tree problems with reliability measures (Q1652601) (← links)
• A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution (Q1681304) (← links)
• Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms (Q1683123) (← links)
• Exact and heuristic approaches for the cycle hub location problem (Q1686520) (← links)
• A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem (Q1759849) (← links)
• An integer programming-based local search for the covering salesman problem (Q1761202) (← links)
• Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach (Q1761989) (← links)
• General network design: a unified view of combined location and network design problems (Q1926688) (← links)
• A branch-and-price algorithm for a vehicle routing with demand allocation problem (Q1991157) (← links)
• The capacitated directed cycle hub location and routing problem under congestion (Q2030629) (← links)
• Algorithms for the metric ring star problem with fixed edge-cost ratio (Q2051906) (← links)
• A parallel variable neighborhood search for solving covering salesman problem (Q2070124) (← links)
• A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak (Q2070131) (← links)
• A covering traveling salesman problem with profit in the last mile delivery (Q2070135) (← links)
• Spatial coverage in routing and path planning problems (Q2083923) (← links)
• A branch-and-price algorithm for the ring-tree facility location problem (Q2132327) (← links)
• A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem (Q2140329) (← links)
• Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
• A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system (Q2160517) (← links)
• A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand (Q2208355) (← links)
• Capacitated ring arborescence problems with profits (Q2284638) (← links)
• A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836) (← links)
• An efficient evolutionary algorithm for the ring star problem (Q2356203) (← links)
• Metaheuristics and cooperative approaches for the bi-objective ring star problem (Q2654392) (← links)
• Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q2670579) (← links)
• Upper and lower bounding procedures for the minimum caterpillar spanning problem (Q2840519) (← links)
• A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem (Q2840522) (← links)
• An Integer Linear Programming Formulation and Branch-and-Cut Algorithm for the Capacitated m-Ring-Star Problem (Q2840722) (← links)
• (Q2861517) (← links)
• (Q2861518) (← links)
• A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization (Q2883580) (← links)
• Column Generation Algorithms for the Capacitated m-Ring-Star Problem (Q3511375) (← links)
• An exact algorithm for solving the ring star problem (Q3553757) (← links)
• A decomposition algorithm for the ring spur assignment problem (Q4921258) (← links)
• School bus routing—a column generation approach (Q4980002) (← links)
• The capacitated m two node survivable star problem (Q4987700) (← links)
• Facet-inducing inequalities with acyclic supports for the caterpillar-packing polytope (Q5244302) (← links)
• A branch‐and‐cut algorithm for the ring spur assignment problem (Q5326781) (← links)