Locating median cycles in networks
From MaRDI portal
Publication:1887911
DOI10.1016/j.ejor.2003.07.010zbMath1067.90109OpenAlexW2081248050MaRDI QIDQ1887911
Gilbert Laporte, Martine Labbé, Juan-José Salazar-González, Inmaculada Rodríguez-Martín
Publication date: 22 November 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2003.07.010
Integer programming (90C10) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
The \(p\)-arborescence star problem: formulations and exact solution approaches, Distribution network design on the battlefield, Exact algorithms for budgeted prize-collecting covering subgraph problems, Mathematical models for the variable weights version of the inverse minimax circle location problem, Location-routing: issues, models and methods, Rapid transit network design for optimal cost and origin-destination demand capture, The bi-objective insular traveling salesman problem with maritime and ground transportation costs, Metaheuristics and cooperative approaches for the bi-objective ring star problem, Extensive facility location problems on networks: an updated review, General network design: a unified view of combined location and network design problems, Variable neighbourhood structures for cycle location problems, A heuristic procedure for the capacitated \(m\)-ring-star problem, Exact and heuristic approaches for the cycle hub location problem, Configuration‐based approach for topological problems in the design of wireless sensor networks, An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem, Multiperiod location-routing with decoupled time scales, Fitting concentric circles to measurements, Geometric fit of a point set by generalized circles, The stop-and-drop problem in nonprofit food distribution networks, An exact algorithm for solving the ring star problem, 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, An integer programming-based local search for the covering salesman problem, A location-routing problem in glass recycling, Location of speed-up subnetworks, A practical exact algorithm for the shortest loop design problem in a block layout, Insertion heuristics for central cycle problems, The single-vehicle two-echelon one-commodity pickup and delivery problem, The capacitated directed cycle hub location and routing problem under congestion, Transport clustering and routing as a visual meshing process, Locating a general minisum `circle' on the plane, The capacitated m two node survivable star problem, A tailored Benders decomposition approach for last-mile delivery with autonomous robots, The attractive traveling salesman problem, Heuristic algorithms for the multi-depot ring-star problem, Spatial coverage in routing and path planning problems, A taxonomical analysis, current methods and objectives on location-routing problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The median tour and maximal covering tour problems: Formulations and heuristics
- Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
- Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
- The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
- Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search
- Optimal location of a path or tree on a network with cycles
- On finding the core of a tree with a specified length
- Locating A Median Subtree On A Network
- The optimal location of a path or tree in a tree network
- The prize collecting traveling salesman problem
- TSPLIB—A Traveling Salesman Problem Library
- The Circuit Polytope: Facets
- The Covering Tour Problem
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- Solving the Orienteering Problem through Branch-and-Cut
