A new method for solving capacitated location problems based on a set partitioning approach

DOI10.1016/S0305-0548(00)00072-1zbMath0994.90087WikidataQ59195757 ScholiaQ59195757MaRDI QIDQ5959081

Vittorio Maniezzo, Eleni Hadjiconstantinou, Aristide Mingozzi, Roberto Baldacci

Publication date: 24 July 2002

Published in: Computers \& Operations Research (Search for Journal in Brave)

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items

STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES, An implementation of exact knapsack separation, A review of congestion models in the location of facilities with immobile servers, A cutting plane method for knapsack polytope, A matheuristic for large-scale capacitated clustering, Solving the bi‐objective capacitated p‐median problem with multilevel capacities using compromise programming and VNS, Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning, Locating Satellite Yards in Forestry Operations, Two‐stage stochastic one‐to‐many driver matching for ridesharing, An effective VNS for the capacitated \(p\)-median problem, An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts, A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes, A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem, Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction, The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem, Greedy random adaptive memory programming search for the capacitated clustering problem, Model-based capacitated clustering with posterior regularization, A computational evaluation of a general branch-and-price framework for capacitated network location problems, Queueing maximal covering location-allocation problem: an extension with \textit{M/G/1} queueing systems, Matheuristics for the capacitated p‐median problem, A scatter search heuristic for the capacitated clustering problem

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving capacitated clustering problems
• Efficient algorithms for the capacitated concentrator location problem
• An algorithm for solving large capacitated warehouse location problems
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
• Valid inequalities and facets of the capacitated plant location problem
• A bionomic approach to the capacitated \(p\)-median problem
• Capacitated facility location: Separation algorithms and computational experience
• Cluster analysis and mathematical programming
• A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
• Facility location on a tree with maximum distance constraints
• An Exact Method for the Vehicle Routing Problem with Backhauls
• An Analysis of Network Location Problems with Distance Constraints
• An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
• Using simulated annealing to solve routing and location problems
• A Cross Decomposition Algorithm for Capacitated Facility Location
• A Set Partitioning Approach to the Crew Scheduling Problem
• Capacitated clustering problems by hybrid simulated annealing and tabu search