Cover Image

Competing for the most profitable tour: The orienteering interdiction game

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Álvarez-Miranda, Eduardo, Sinnl, Markus, Tanınmış, Kübra
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Discrete Mathematics 90B06, 90C10, 90C57
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Benders decomposition algorithms for minimizing the spread of harmful contagions in networks
by: Tanınmış, Kübra, et al.
Published: (2023)

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

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

Implied Integrality in Mixed-Integer Optimization
by: van der Hulst, Rolf, et al.
Published: (2025)

Equitable Routing--Rethinking the Multiple Traveling Salesman Problem
by: Bhadoriya, Abhay Singh, et al.
Published: (2024)

Assignment-Routing Optimization with Cutting-Plane Subtour Elimination: Solver and Benchmark Dataset
by: Yuan, Qilong
Published: (2025)

Linear Decision Tree Policies for Integer Linear Programs
by: Guyard, Théo, et al.
Published: (2026)

On the redundancy of transitivity constraints in the clique partitioning problem
by: Sukegawa, Noriyoshi
Published: (2026)

A branch-and-cut algorithm for vehicle routing problems with three-dimensional loading constraints
by: Tamke, Felix, et al.
Published: (2024)

Rescue Craft Allocation in Tidal Waters of the North and Baltic Sea
by: Mucke, Tom, et al.
Published: (2024)

Solving Combinatorial Pricing Problems using Embedded Dynamic Programming Models
by: Bui, Quang Minh, et al.
Published: (2024)

Cutting planes for signomial programming
by: Xu, Liding, et al.
Published: (2022)

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

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

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

Convex quadratic sets and the complexity of mixed integer convex quadratic programming
by: Del Pia, Alberto
Published: (2023)

Solving Cutting Stock Problems via an Extended Ryan-Foster Branching Scheme and Fast Column Generation
by: da Silva, Renan F. F., et al.
Published: (2023)

The Binary Linearization Complexity of Pseudo-Boolean Functions
by: Walter, Matthias
Published: (2023)

Computing All Shortest Passenger Routes with a Tropical Dijkstra Algorithm
by: Masing, Berenike, et al.
Published: (2024)

Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem
by: Kim, Junyoung, et al.
Published: (2024)

Generalizations of Total Dual Integrality
by: Guenin, Bertrand, et al.
Published: (2025)

An Exact Algorithm for Public Transport Line Planning Considering Passenger and Operational Costs and Lost Demand
by: Hansen, Siv Marie Cartland, et al.
Published: (2026)

Bi-Objective Optimization over the Efficient Set of Multi-Objective Integer Quadratic Problem
by: Bencheikh, Ali, et al.
Published: (2024)

A Computational Search for Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
by: Au, Yu Hin, et al.
Published: (2025)

A Multi-Reference Relaxation Enforced Neighborhood Search Heuristic in SCIP
by: Bolusani, Suresh, et al.
Published: (2024)

Assignment-Routing Optimization : Efficient Heuristic Solver with Shaking Algorithm
by: Qilong, Yuan, et al.
Published: (2025)

Relaxation strength for multilinear optimization: McCormick strikes back
by: Schutte, Emily, et al.
Published: (2023)

Introducing Clause Cuts: Strong No-Good Cuts for MaxSAT Problems in Mixed Integer Linear Programming
by: Engelhardt, Max, et al.
Published: (2025)

The Cooperative Maximal Covering Location Problem with ordered partial attractions
by: Domínguez, Concepción, et al.
Published: (2023)

Data-Driven Hull-Fouling Cleaning Schedule Optimization to Reduce Carbon Footprint of Vessels
by: Ward, Samuel, et al.
Published: (2026)

Bus Fleet Electrification Planning Through Logic-Based Benders Decomposition and Restriction Heuristics
by: Legault, Robin, et al.
Published: (2025)

A Comparison of Models for Rolling Stock Scheduling
by: Grimm, Boris, et al.
Published: (2023)

An extended version of the Ordered Median Tree Location Problem including appendices and detailed computational results
by: Pozo, Miguel A., et al.
Published: (2022)

Assignment-Routing Optimization: Solvers for Problems Under Constraints
by: Qilong, Yuan, et al.
Published: (2025)

Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
by: Nikolaev, Andrei V., et al.
Published: (2022)

Structural Insights and an IP-based Solution Method for Patient-to-room Assignment under Consideration of Single Room Entitlements
by: Brandt, Tabea, et al.
Published: (2023)

A Successive Refinement for Solving Stochastic Programs with Decision-Dependent Random Capacities
by: Medal, Hugh, et al.
Published: (2024)

Better and Simpler Reducibility Bounds over the Integers
by: Levin, Asaf
Published: (2025)

Branch-Price-and-Cut Accelerated with a Pricing for Integrality Heuristic for the Electrical Vehicle Routing Problem with Time Windows and Charging Time Slots
by: Eveborn, Lukas, et al.
Published: (2026)

Proximal Limited-Memory Quasi-Newton Methods for Nonsmooth Nonconvex Optimization
by: Dahl, Simeon vom, et al.
Published: (2026)