Pages that link to "Item:Q4474293"

The following pages link to The Ring Star Problem: Polyhedral analysis and exact algorithm (Q4474293):

Displaying 38 items.

• Optimal capacitated ring trees (Q286687) (← links)
• Models for a Steiner multi-ring network design problem with revenues (Q301388) (← links)
• MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem (Q322470) (← links)
• The tree-star problem: a formulation and a branch-and-cut algorithm (Q325465) (← links)
• The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach (Q336445) (← links)
• Single string planning problem arising in liner shipping industries: a heuristic approach (Q336521) (← 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)
• The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm (Q643033) (← links)
• Tight bounds from a path based formulation for the tree of hub location problem (Q833527) (← links)
• The tree of hubs location problem (Q1039782) (← links)
• The attractive traveling salesman problem (Q1043335) (← links)
• Heuristic algorithms for the multi-depot ring-star problem (Q1043363) (← links)
• The periodic vehicle routing problem with driver consistency (Q1622811) (← links)
• The \(p\)-arborescence star problem: formulations and exact solution approaches (Q1628121) (← links)
• The bi-objective insular traveling salesman problem with maritime and ground transportation costs (Q1653384) (← 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)
• An integer programming-based local search for the covering salesman problem (Q1761202) (← links)
• A new formulation and an exact approach for the many-to-many hub location-routing problem (Q1789047) (← links)
• General network design: a unified view of combined location and network design problems (Q1926688) (← links)
• The single-vehicle two-echelon one-commodity pickup and delivery problem (Q2027019) (← 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 covering traveling salesman problem with profit in the last mile delivery (Q2070135) (← links)
• A tailored Benders decomposition approach for last-mile delivery with autonomous robots (Q2077920) (← links)
• A decomposition algorithm for the ring spur assignment problem (Q4921258) (← 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)
• Minimum‐weight subgraphs with unicyclic components and a lower‐bounded girth (Q5326798) (← links)
• Branch‐and‐cut algorithms for the ‐arborescence star problem (Q6071060) (← links)
• Configuration‐based approach for topological problems in the design of wireless sensor networks (Q6088118) (← links)
• New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems (Q6109802) (← links)
• A survivable variant of the ring star problem (Q6196876) (← links)