Imagen de Portada

A Tight Formulation for the Dial-a-Ride Problem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gaul, Daniela, Klamroth, Kathrin, Pfeiffer, Christian, Schulz, Arne, Stiglmayr, Michael
Formato:	Preprint
Publicado:	2023
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

On the Computational Complexity of Multi-Objective Ordinal Unconstrained Combinatorial Optimization
por: Figueira, José Rui, et al.
Publicado: (2024)

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

Event-based MILP models for ride pooling applications
por: Gaul, Daniela, et al.
Publicado: (2021)

The Line-Based Dial-a-Ride Problem
por: Reiter, Kendra, et al.
Publicado: (2024)

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

Tight Bounds for the Maximum Distance Over a Polytope to a Given Point
por: Costandin, Marius, et al.
Publicado: (2023)

Highly Connected Graph Partitioning: Exact Formulation and Solution Methods
por: Swamy, Rahul, et al.
Publicado: (2024)

Recommend-to-Match with Random Supply Rejections: Formulation, Approximation, and Analysis
por: Liu, Haoyue, 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)

Facet-Defining Inequalities for the Angle-Based DC Optimal Transmission Switching Formulation
por: Jabbari-Marand, Behnam, et al.
Publicado: (2026)

A Decomposition Method for the Hybrid Quantum-Classical Solution of the Number Partitioning Problem
por: Li, Zongji, et al.
Publicado: (2023)

The Mixed Integer Trust Region Problem
por: Del Pia, Alberto
Publicado: (2024)

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

Minimum 0-Extension Problems on Directed Metrics
por: Hirai, Hiroshi, et al.
Publicado: (2020)

Asymptotic Bounds for the Traveling Salesman Problem with Drone
por: Lee, Jae Hyeok, et al.
Publicado: (2026)

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

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

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

Branch and Price for the Length-Constrained Cycle Partition Problem
por: Ghannam, Mohammed, et al.
Publicado: (2024)

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)

Lower bounds for the integrality gap of the bi-directed cut formulation of the Steiner Tree Problem
por: Bernardelli, Ambrogio Maria, et al.
Publicado: (2024)

Constrained Shortest-Path Reformulations via Decision Diagrams for Structured Two-stage Optimization Problems
por: Lozano, Leonardo, et al.
Publicado: (2022)

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)

Solving the Line-Based Dial-a-Ride Problem by Generating Stopping Patterns
por: Lauerbach, Antonio, et al.
Publicado: (2026)

System Architecture Optimization Strategies: Dealing with Expensive Hierarchical Problems
por: Bussemaker, Jasper H., et al.
Publicado: (2025)

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

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

A Knowledge Compilation Take on Binary Polynomial Optimization
por: Capelli, Florent, et al.
Publicado: (2023)

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

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

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

A generic Branch-and-Cut algorithm for bi-objective binary linear programs
por: Fouilhoux, Pierre, et al.
Publicado: (2024)

A study of distributionally robust mixed-integer programming with Wasserstein metric: on the value of incomplete data
por: Ketkov, Sergey S.
Publicado: (2023)

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

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

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)

Economic Dispatch of a Single Micro-Gas Turbine Under CHP Operation with Uncertain Demands
por: Sharf, Miel, et al.
Publicado: (2021)

The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization
por: Del Pia, Alberto, et al.
Publicado: (2023)

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)