Research map / Learning theory and algorithms / Combinatorial and search optimization
A Complexity-theoretic Analysis of Green Pickup-and-Delivery Problems
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Restrict GPD to one vehicle, one depot/fuel station, and unit workload | GPD · GPDstn | complexity | Mixed |
| Bound each city's in-degree and out-degree to at most 2 | GPD · GPDdgr | complexity | Mixed |
| Combine one depot/fuel station with in-degree and out-degree at most 2 | GPD · GPDstn dgr | complexity | Mixed |
| Restrict the task graph to a ring | GPDstn dgr · GPDring stn dgr | complexity: strongly NP-complete -> weakly NP-complete | Helped |
| Use dynamic programming over city and fuel-consumption states | GPDring stn dgr · GPDring stn dgr | running time: O(n × fvhl) | Helped |
Closest papers by meaning
- Hybrid-Balance GFlowNet for Solving Vehicle Routing Problems (NeurIPS 2025 · similarity 0.84)
- A Combinatorial Algorithm for the Semi-Discrete Optimal Transport Problem (NeurIPS 2024 · similarity 0.81)
- The Complexity of Optimizing Atomic Congestion (AAAI 2024 · similarity 0.81)
- Semidefinite Relaxations of the Gromov-Wasserstein Distance (NeurIPS 2024 · similarity 0.81)
- SVRPBench: A Realistic Benchmark for Stochastic Vehicle Routing Problem (NeurIPS 2025 · similarity 0.81)
- Rethinking Neural Combinatorial Optimization for Vehicle Routing Problems with Different Constraint Tightness Degrees (NeurIPS 2025 · similarity 0.80)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.