Cover Image

Decision Diagram-Based Branch-and-Bound with Caching for Dominance and Suboptimality Detection

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Coppé, Vianney, Gillard, Xavier, Schaus, Pierre
Format:	Preprint
Published:	2022
Subjects:	Data Structures and Algorithms Artificial Intelligence Discrete Mathematics Optimization and Control 90C39, 90C27, 90C57 I.2.8; G.2.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Polynomial and Pseudopolynomial Algorithms for Two Classes of Bin Packing Instances
by: da Silva, Renan Fernando Franco, et al.
Published: (2026)

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)

Solving Hard Instances from Knapsack and Bounded Knapsack Problems: A new state-of-the-art solver
by: da Silva, Renan F. F., et al.
Published: (2026)

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

Finding Short Paths on Simple Polytopes
by: Black, Alexander E., et al.
Published: (2026)

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

Polyhedral approach to weighted connected matchings in general graphs
by: Samer, Phillippe, et al.
Published: (2023)

Benders decomposition algorithms for minimizing the spread of harmful contagions in networks
by: Tanınmış, Kübra, 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)

Efficient Tree Generation for Globally Optimal Decisions under Probabilistic Outcomes
by: Ozturk, Berk, et al.
Published: (2025)

Modern column generation for estimating single- and multi-purchase ranked list choice models
by: Costa, Luciano, et al.
Published: (2026)

Troika algorithm: approximate optimization for accurate clique partitioning and clustering of weighted networks
by: Aref, Samin, et al.
Published: (2025)

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

A Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion
by: Ammann, Sabrina C. L., et al.
Published: (2024)

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

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

The exact subgraph hierarchy and its vertex-transitive variant for the stable set problem for Paley graphs
by: Gaar, Elisabeth, 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)

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

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

The rainbow covering number of clean tangled clutters
by: Abdi, Ahmad, et al.
Published: (2025)

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

Steiner Cut Dominants
by: Conforti, Michele, et al.
Published: (2022)

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

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

Measuring diversity. A review and an empirical analysis
by: Parreño, Francisco, et al.
Published: (2024)

Computing distances is FPT on graph associahedra and W[2]-hard on hypergraphic polytopes
by: Cunha, Luís Felipe I., et al.
Published: (2025)

Learning Dominant States in Elementary Resource Constrained Shortest Path Problems
by: Basso, Saverio, et al.
Published: (2026)

The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty
by: Goerigk, Marc, et al.
Published: (2026)

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

IP Models for Minimum Zero Forcing Sets, Forts, and Related Graph Parameters
by: Cameron, Thomas R., et al.
Published: (2025)

Binary Cyclic Transversal Polytopes
by: Frede, Jonas, et al.
Published: (2024)

Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
by: Emmerich, Michael T. M.
Published: (2026)

Exact Decomposition Branching exploiting Lattice Structures
by: Halbig, Katrin, et al.
Published: (2024)

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

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

Extending the definition of set tolerances
by: Jäger, Gerold, et al.
Published: (2024)

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