The Capacitated m-Ring-Star Problem
From MaRDI portal
Publication:3392143
DOI10.1287/opre.1070.0432zbMath1167.90416OpenAlexW1999752715WikidataQ59222269 ScholiaQ59222269MaRDI QIDQ3392143
J. Salazar González, Mauro Dell'Amico, Roberto Baldacci
Publication date: 13 August 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1070.0432
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18)
Related Items
A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization, Optimal capacitated ring trees, A branch-and-price algorithm for the ring-tree facility location problem, The \(p\)-arborescence star problem: formulations and exact solution approaches, Models for a Steiner multi-ring network design problem with revenues, A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem, Exact algorithms for budgeted prize-collecting covering subgraph problems, Capacitated \(m\) two-node survivable star problem, Exact algorithms for bi-objective ring tree problems with reliability measures, A branch-and-cut algorithm for two-level survivable network design problems, A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system, Metaheuristics and cooperative approaches for the bi-objective ring star problem, A branch‐and‐cut algorithm for the ring spur assignment problem, Minimum‐weight subgraphs with unicyclic components and a lower‐bounded girth, General network design: a unified view of combined location and network design problems, Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks, A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution, A heuristic procedure for the capacitated \(m\)-ring-star problem, Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms, Exact and heuristic approaches for the cycle hub location problem, Branch‐and‐cut algorithms for the ‐arborescence star problem, Configuration‐based approach for topological problems in the design of wireless sensor networks, Heuristic and exact algorithms for a min-max selective vehicle routing problem, New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems, Column Generation Algorithms for the Capacitated m-Ring-Star Problem, The cumulative school bus routing problem: Polynomial‐size formulations, An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem, Multiperiod location-routing with decoupled time scales, A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand, The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm, An exact algorithm for solving the ring star problem, The caterpillar-packing polytope, Multiple depot ring star problem: a polyhedral study and an exact algorithm, A branch-and-price algorithm for a vehicle routing with demand allocation problem, A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem, A decomposition algorithm for the ring spur assignment problem, An integer programming-based local search for the covering salesman problem, Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach, Unnamed Item, Unnamed Item, The capacitated directed cycle hub location and routing problem under congestion, Capacitated ring arborescence problems with profits, Algorithms for the metric ring star problem with fixed edge-cost ratio, School bus routing—a column generation approach, A parallel variable neighborhood search for solving covering salesman problem, A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak, A covering traveling salesman problem with profit in the last mile delivery, The capacitated m two node survivable star problem, Upper and lower bounding procedures for the minimum caterpillar spanning problem, A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem, An Integer Linear Programming Formulation and Branch-and-Cut Algorithm for the Capacitated m-Ring-Star Problem, Heuristic algorithms for the multi-depot ring-star problem, Facet-inducing inequalities with acyclic supports for the caterpillar-packing polytope, Spatial coverage in routing and path planning problems, A branch-and-cut algorithm for the capacitated profitable tour problem, An efficient evolutionary algorithm for the ring star problem
