Cover Image

Adaptive Improvements of Multi-Objective Branch and Bound

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bauß, Julius, Parragh, Sophie N., Stiglmayr, Michael
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control Discrete Mathematics Mathematical Software 90C29
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

An exact approach for the multi-depot electric vehicle scheduling problem
by: Haslinger, Xenia, et al.
Published: (2025)

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

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

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

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

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

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

A Tight Formulation for the Dial-a-Ride Problem
by: Gaul, Daniela, et al.
Published: (2023)

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

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)

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

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

Competing for the most profitable tour: The orienteering interdiction game
by: Álvarez-Miranda, Eduardo, 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)

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

Pessimistic bilevel optimization approach for decision-focused learning
by: Jiménez, Diego, et al.
Published: (2025)

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

Linear, nested, and quadratic ordered measures: Computation and incorporation into optimization problems
by: Blanco, Victor, et al.
Published: (2025)

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

Stable Set Polytopes with Rank $|V(G)|/3$ for the Lovász--Schrijver SDP Operator
by: Au, Yu Hin, et al.
Published: (2025)

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

Improving Directions in Mixed Integer Bilevel Linear Optimization
by: Battista, Federico, et al.
Published: (2025)

Valid Inequalities for Mixed Integer Bilevel Linear Optimization Problems
by: Tahernejad, Sahar, et al.
Published: (2025)

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

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

Relaxation strength for multilinear optimization: McCormick strikes back
by: Schutte, Emily, 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)

Fair Schedules for Single Round Robin Tournaments with Ranked Participants
by: Wessel, Sten, et al.
Published: (2025)

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

A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization
by: Mansueto, Pierluigi
Published: (2025)

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

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

Decision Diagram-Based Branch-and-Bound with Caching for Dominance and Suboptimality Detection
by: Coppé, Vianney, et al.
Published: (2022)

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

Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers
by: Baeckelant, Timothy, et al.
Published: (2026)

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

Robust Graph-Based Semi-Supervised Learning via $p$-Conductances
by: Robertson, Sawyer Jack, et al.
Published: (2025)