Skip to main navigation
Skip to search
Skip to main content
Maastricht University Home
Support & FAQ
Link opens in a new tab
Search content at Maastricht University
Home
Researchers
Publications
Activities
Press/Media
Prizes
Organisations
Dataset/Software
Projects
Approximation algorithms for capacitated location routing
T. Harks
*
, F.G. Koenig
, J. Matuschke
*
Corresponding author for this work
Quantitative Economics
Research output
:
Contribution to journal
›
Article
›
Academic
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Approximation algorithms for capacitated location routing'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Approximation Algorithms
100%
Capacitated Location
100%
Location-routing
100%
Polynomial Time
25%
Optimization Problem
25%
Computational Study
25%
Depot
25%
Benchmark Instances
25%
Combined Algorithm
25%
Approximation Factor
25%
Cross-docking
25%
Capacitated Vehicle Routing
25%
Original Problem
25%
Vehicle Routing
25%
Optimality Gap
25%
Multi-depot
25%
Prize-collecting
25%
Constrained Optimality
25%
INIS
algorithms
100%
approximations
100%
routing
100%
vehicles
50%
solutions
33%
cost
16%
optimization
16%
relaxation
16%
benchmarks
16%
polynomials
16%
Computer Science
Approximation Algorithms
100%
Vehicle Routing
50%
Polynomial Time
25%
Optimization Problem
25%
Benchmark Instance
25%
Randomly Generated Instance
25%
Computed Solution
25%
approximation factor
25%