Primal-Dual Schema and Lagrangian Relaxation for the k-Location-Routing Problem (Q3088086): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Subtour Elimination Constraints and Connectivity Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for minimizing routing and operating costs in depot location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined location-routing problems: A synthesis and future research directions / rank
 
Normal rank

Latest revision as of 10:17, 4 July 2024

scientific article
Language Label Description Also known as
English
Primal-Dual Schema and Lagrangian Relaxation for the k-Location-Routing Problem
scientific article

    Statements