The vehicle routing problem with synchronization constraints and support vehicle-dependent service times
Fuente:
arXiv
Saved in:
| Main Authors: | Wittwer, David, Tamke, Felix |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
by: Cavallaro, Dario, et al.
Published: (2026)
by: Cavallaro, Dario, et al.
Published: (2026)
Adjacency Labeling Schemes for Small Classes
by: Bonnet, Édouard, et al.
Published: (2024)
by: Bonnet, Édouard, et al.
Published: (2024)
New Results on Edge-coloring and Total-coloring of Split Graphs
by: Couto, Fernanda, et al.
Published: (2023)
by: Couto, Fernanda, et al.
Published: (2023)
Minimizing an Uncrossed Collection of Drawings
by: Hliněný, Petr, et al.
Published: (2023)
by: Hliněný, Petr, et al.
Published: (2023)
General Strong Bound on the Uncrossed Number via a Tight Bound for the Maximum Uncrossed Subgraph Number
by: Charvy, Gaspard, et al.
Published: (2025)
by: Charvy, Gaspard, et al.
Published: (2025)
On the Uncrossed Number of Graphs
by: Balko, Martin, et al.
Published: (2024)
by: Balko, Martin, et al.
Published: (2024)
The Ultimate Signs of Second-Order Holonomic Sequences
by: Hagihara, Fugen, et al.
Published: (2025)
by: Hagihara, Fugen, et al.
Published: (2025)
Searching in trees with monotonic query times
by: Dereniowski, Dariusz, et al.
Published: (2024)
by: Dereniowski, Dariusz, et al.
Published: (2024)
Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
by: Gabryelski, Wojciech, et al.
Published: (2026)
by: Gabryelski, Wojciech, et al.
Published: (2026)
The steady-states of splitter networks
by: Couëtoux, Basile, et al.
Published: (2024)
by: Couëtoux, Basile, et al.
Published: (2024)
Exploration of $k$-edge-deficient temporal graphs in linear time
by: Lahtin, Ivan, et al.
Published: (2026)
by: Lahtin, Ivan, et al.
Published: (2026)
On the spectra of prefix-reversal graphs
by: Blanco, Saúl A., et al.
Published: (2025)
by: Blanco, Saúl A., et al.
Published: (2025)
Adjacent vertex distinguishing total coloring of 3-degenerate graphs
by: Behera, Diptimaya, et al.
Published: (2025)
by: Behera, Diptimaya, et al.
Published: (2025)
Some integer values in the spectra of burnt pancake graphs
by: Blanco, Saúl A., et al.
Published: (2024)
by: Blanco, Saúl A., et al.
Published: (2024)
Counting Kernels in Directed Graphs with Arbitrary Orientations
by: Jartoux, Bruno
Published: (2022)
by: Jartoux, Bruno
Published: (2022)
Three iterations of $(d-1)$-WL test distinguish non isometric clouds of $d$-dimensional points
by: Rose, Valentino Delle, et al.
Published: (2023)
by: Rose, Valentino Delle, et al.
Published: (2023)
A biased random-key genetic algorithm with variable mutants to solve a vehicle routing problem
by: Festa, Paola, et al.
Published: (2024)
by: Festa, Paola, et al.
Published: (2024)
Slow Convergence of Ising and Spin Glass Models with Well-Separated Frustrated Vertices
by: Gillman, David, et al.
Published: (2026)
by: Gillman, David, et al.
Published: (2026)
Fast winning strategies for the attacker in eternal domination
by: Bagan, Guillaume, et al.
Published: (2024)
by: Bagan, Guillaume, et al.
Published: (2024)
Interval Graphs are Reconstructible
by: Heinrich, Irene, et al.
Published: (2025)
by: Heinrich, Irene, et al.
Published: (2025)
Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
by: Choi, Mujin, et al.
Published: (2025)
by: Choi, Mujin, et al.
Published: (2025)
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
by: Heimann, Sophia, et al.
Published: (2025)
by: Heimann, Sophia, et al.
Published: (2025)
Independent Set Enumeration in King Graphs by Tensor Network Contractions
by: Liang, Kai
Published: (2025)
by: Liang, Kai
Published: (2025)
Completely independent spanning trees in the hypercube
by: Shaw, Benedict Randall
Published: (2024)
by: Shaw, Benedict Randall
Published: (2024)
A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
by: Rockel-Wolff, Benjamin
Published: (2024)
by: Rockel-Wolff, Benjamin
Published: (2024)
Benders Cut Filtering for Affine Potential-Based Flow Problems with Robustness Scenarios and Topology Switching
by: Donkiewicz, Tim, et al.
Published: (2026)
by: Donkiewicz, Tim, et al.
Published: (2026)
Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
by: Chen, Yijia, et al.
Published: (2023)
by: Chen, Yijia, et al.
Published: (2023)
Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs
by: Büngener, Aaron, et al.
Published: (2024)
by: Büngener, Aaron, et al.
Published: (2024)
A framework for distributed discrete evacuation strategies
by: Borowiecki, Piotr, et al.
Published: (2025)
by: Borowiecki, Piotr, et al.
Published: (2025)
Constructions, bounds, and algorithms for peaceable queens
by: Clinch, Katie, et al.
Published: (2024)
by: Clinch, Katie, et al.
Published: (2024)
Homomorphism Counts to Trees
by: Dawar, Anuj
Published: (2024)
by: Dawar, Anuj
Published: (2024)
Directed Capacity-Preserving Subgraphs: Hardness and Exact Polynomial Algorithms
by: Chimani, Markus, et al.
Published: (2023)
by: Chimani, Markus, et al.
Published: (2023)
Simple Approximations for General Spanner Problems
by: Bökler, Fritz, et al.
Published: (2025)
by: Bökler, Fritz, et al.
Published: (2025)
Exact Minimum Weight Spanners via Column Generation
by: Bökler, Fritz, et al.
Published: (2024)
by: Bökler, Fritz, et al.
Published: (2024)
Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
by: Chimani, Markus, et al.
Published: (2021)
by: Chimani, Markus, et al.
Published: (2021)
On the Integrality Gap of Directed Steiner Tree LPs with Relatively Integral Solutions
by: Laekhanukit, Bundit
Published: (2024)
by: Laekhanukit, Bundit
Published: (2024)
The frequency $K_i$s for symmetrical traveling salesman problem
by: Wang, Yong
Published: (2025)
by: Wang, Yong
Published: (2025)
Golden Ratio Growth and Phase Transitions in Chromatic Counts of Circular Chord Graphs
by: Lopez-Bonilla, Rogelio N., et al.
Published: (2025)
by: Lopez-Bonilla, Rogelio N., et al.
Published: (2025)
Optimal covering of rectangular grid graphs with tours of constrained length
by: Bereg, Sergey, et al.
Published: (2025)
by: Bereg, Sergey, et al.
Published: (2025)
The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
by: Heimann, Sophia, et al.
Published: (2024)
by: Heimann, Sophia, et al.
Published: (2024)
Similar Items
-
Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
by: Cavallaro, Dario, et al.
Published: (2026) -
Adjacency Labeling Schemes for Small Classes
by: Bonnet, Édouard, et al.
Published: (2024) -
New Results on Edge-coloring and Total-coloring of Split Graphs
by: Couto, Fernanda, et al.
Published: (2023) -
Minimizing an Uncrossed Collection of Drawings
by: Hliněný, Petr, et al.
Published: (2023) -
General Strong Bound on the Uncrossed Number via a Tight Bound for the Maximum Uncrossed Subgraph Number
by: Charvy, Gaspard, et al.
Published: (2025)