Imagen de Portada

An exact approach for the multi-depot electric vehicle scheduling problem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Haslinger, Xenia, Gaar, Elisabeth, Parragh, Sophie N.
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The exact subgraph hierarchy and its vertex-transitive variant for the stable set problem for Paley graphs
por: Gaar, Elisabeth, et al.
Publicado: (2024)

Exact solution approaches for the discrete $α$-neighbor $p$-center problem
por: Gaar, Elisabeth, et al.
Publicado: (2022)

A column-generation approach for an electricity technician routing and scheduling problem with a lexicographic objective
por: Bangerter, Elise, et al.
Publicado: (2026)

Investigating mixed-integer programming approaches for the $p$-$α$-closest-center problem
por: Gaar, Elisabeth, et al.
Publicado: (2026)

On different Versions of the Exact Subgraph Hierarchy for the Stable Set Problem
por: Gaar, Elisabeth
Publicado: (2020)

Adaptive Improvements of Multi-Objective Branch and Bound
por: Bauß, Julius, et al.
Publicado: (2023)

Strong SDP based bounds on the cutwidth of a graph
por: Gaar, Elisabeth, et al.
Publicado: (2023)

Order acceptance and scheduling in capacitated job shops
por: Linß, Florian, et al.
Publicado: (2024)

Tree-based formulation for the multi-commodity flow problem
por: Spoorendonk, Simon, et al.
Publicado: (2025)

Capacitated power dominating set problem: a solution approach based on forbidden propagation sets
por: Lucci, Mauro, et al.
Publicado: (2026)

Mixed-integer linear programming approaches for nested $p$-center problems with absolute and relative regret objectives
por: Brandstetter, Christof, et al.
Publicado: (2024)

An efficient optimization model and tabu search-based global optimization approach for continuous p-dispersion problem
por: Lai, Xiangjing, et al.
Publicado: (2024)

Revisiting some classical linearizations of the quadratic binary optimization problem
por: Punnen, Abraham P., et al.
Publicado: (2024)

A parallel pull labelling algorithm for the resource constrained shortest path problem
por: Petersen, Bjørn, et al.
Publicado: (2025)

Towards a geometric characterization of unbounded integer cubic optimization problems via thin rays
por: Del Pia, Alberto
Publicado: (2025)

Minimum Cut Representability of Stable Matching Problems
por: Faenza, Yuri, et al.
Publicado: (2025)

Real-time Optimization of Transport Chains for Single Wagon Load Railway Transport
por: Moldenhauer, Carsten, et al.
Publicado: (2025)

Geoffrion's theorem beyond finiteness and rationality
por: Dey, Santanu S., et al.
Publicado: (2025)

A review of minimum cost box searching games
por: Lidbetter, Thomas
Publicado: (2025)

On Supportedness in Multi-Objective Combinatorial Optimization
por: Könen, David, et al.
Publicado: (2025)

Projection-width as a structural parameter for discrete separable optimization
por: Del Pia, Alberto
Publicado: (2025)

Normalizations of factorizations over convex cones and their effects on extension complexity
por: Brown, Adam, et al.
Publicado: (2025)

Extended formulations for the multilinear polytope of acyclic hypergraphs
por: Del Pia, Alberto, et al.
Publicado: (2025)

The complete edge relaxation for binary polynomial optimization
por: Del Pia, Alberto, et al.
Publicado: (2025)

Aircraft routing: periodicity and complexity
por: Meunier, Frédéric, et al.
Publicado: (2025)

On the integrality Gap of Small Asymmetric Traveling Salesman Problems: A Polyhedral and Computational Approach
por: Vercesi, Eleonora, et al.
Publicado: (2025)

Efficient Sparse Flow Decomposition Methods for RNA Multi-Assembly
por: Besançon, Mathieu
Publicado: (2025)

Geometry of the Reformulation-Linearization-Technique: Domination of Disjunctions
por: Hof, Hugo A., et al.
Publicado: (2025)

Combinatorial Algorithm for Tropical Linearly Factorized Programming
por: Nishida, Yuki
Publicado: (2025)

Linear Programming Hierarchies Collapse under Symmetry
por: Faenza, Yuri, et al.
Publicado: (2025)

A Branch-and-Cut Algorithm for the Optimal Design of Parking Lots with One-way and Two-way Lanes
por: Thomas, Helen, et al.
Publicado: (2025)

Scheduling on identical machines with conflicts to minimize the mean flow time
por: Tellache, Nour ElHouda, et al.
Publicado: (2025)

On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
por: Tellache, Nour ElHouda, et al.
Publicado: (2025)

Recommend-to-Match with Random Supply Rejections: Formulation, Approximation, and Analysis
por: Liu, Haoyue, et al.
Publicado: (2025)

The Integrality Gap of the Traveling Salesman Problem is $4/3$ if the LP Solution Has at Most $n+6$ Non-zero Components
por: Villa, Tullio, et al.
Publicado: (2025)

Vehicle Routing Problems in the Age of Semi-Autonomous Driving
por: Hu, Hins, et al.
Publicado: (2025)

Multilevel Facility Location Optimization: A Novel Integer Programming Formulation and Approaches to Heuristic Solutions
por: Alidaee, Bahram, et al.
Publicado: (2024)

An SDP Relaxation for the Sparse Integer Least Squares Problem
por: Del Pia, Alberto, et al.
Publicado: (2022)

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
por: Proença, Nathan Benedetto, et al.
Publicado: (2026)

Randomized Max-Vertex-Cover Interdiction with Matroid Constraints
por: Wang, Changjun, et al.
Publicado: (2026)