Decision Diagrams for Discrete Optimization: A Survey of Recent Advances (Q5106421): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 15:56, 30 December 2024

scientific article; zbMATH DE number 7587569

Language	Label	Description	Also known as
English	Decision Diagrams for Discrete Optimization: A Survey of Recent Advances	scientific article; zbMATH DE number 7587569

Statements

scholarly article

0 references

Decision Diagrams for Discrete Optimization: A Survey of Recent Advances (English)

0 references

Margarita P. Castro

0 references

0 references

J. Christopher Beck

0 references

INFORMS Journal on Computing

0 references

publication date

19 September 2022

0 references

full work available at URL

https://arxiv.org/abs/2201.11536

0 references

zbMATH Keywords

decision diagrams

0 references

discrete optimization

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

Binary Decision Diagrams

0 references

New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem

0 references

New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows

0 references

Branch-and-Price: Column Generation for Solving Huge Integer Programs

0 references

Experimental and Efficient Algorithms

0 references

On threshold BDDs and the optimal variable ordering problem

0 references

0/1 vertex and facet enumeration with BDDs

0 references

Partitioning procedures for solving mixed-variables programming problems

0 references

Decomposition Based on Decision Diagrams

0 references

Theoretical insights and algorithmic tools for decision diagram-based optimization

0 references

On finding the optimal BDD relaxation

0 references

Decision Diagram Decomposition for Quadratically Constrained Binary Optimization

0 references

Binary decision diagrams for bin packing with minimum color fragmentation

0 references

MDD Propagation for Sequence Constraints

0 references

Lagrangian bounds from decision diagrams

0 references

Manipulating MDD Relaxations for Combinatorial Optimization

0 references

Optimization Bounds from Binary Decision Diagrams

0 references

Decision diagrams for optimization

0 references

Discrete Optimization with Decision Diagrams

0 references

Parallel Combinatorial Optimization with Decision Diagrams

0 references

0 references

Improving the variable ordering of OBDDs is NP-complete

0 references

Graph-Based Algorithms for Boolean Function Manipulation

0 references

An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP

0 references

A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming

0 references

Solving Delete Free Planning with Relaxed Decision Diagram Based Heuristics

0 references

An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints

0 references

State-space relaxation procedures for the computation of bounds to routing problems

0 references

Multivalued Decision Diagrams for Sequencing Problems

0 references

Integer Programming

0 references

Valid inequalities for mixed integer linear programs

0 references

Strong relaxations for continuous nonlinear programs based on decision diagrams

0 references

Outer approximation for integer nonlinear programs via decision diagrams

0 references

Arc flow formulations based on dynamic programming: theoretical foundations and applications

0 references

Compiling CP subproblems to MDDs and d-DNNFs

0 references

Single-machine scheduling with release times, deadlines, setup times, and rejection

0 references

A note on two problems in connexion with graphs

0 references

MDD propagators with explanation

0 references

Improving the filtering of branch-and-bound MDD solver

0 references

Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem

0 references

BDD-based optimization for the quadratic stable set problem

0 references

Logic-Based Benders Decomposition and Binary Decision Diagram Based Approaches for Stochastic Distributed Operating Room Scheduling

0 references

Cost-Bounded Binary Decision Diagrams for 0-1 Programming

0 references

Compact representations of all members of an independence system

0 references

Decision Diagrams and Dynamic Programming

0 references

A\textsuperscript{*}-based compilation of relaxed decision diagrams for the longest common subsequence problem

0 references

\( \mathrm{A}^*\) -based construction of decision diagrams for a prize-collecting scheduling problem

0 references

Exact Multiple Sequence Alignment by Synchronized Decision Diagrams

0 references

Checking constraint satisfaction

0 references

An MDD Approach to Multidimensional Bin Packing

0 references

BDD-Guided Clause Generation

0 references

Hybrid optimization methods for time-dependent sequencing problems

0 references

A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching

0 references

A binary decision diagram based algorithm for solving a class of binary two-stage stochastic programs

0 references

On the Consistent Path Problem

0 references

Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition

0 references

Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams

0 references

Network-Based Approximate Linear Programming for Discrete Optimization

0 references

Decision diagrams for solving traveling salesman problems with pickup and delivery in real time

0 references

Improving branch-and-bound using decision diagrams and reinforcement learning

0 references

Constructions and In-Place Operations for MDDs Based Constraints

0 references

MDDs are efficient modeling tools: an application to some statistical constraints

0 references

A local search framework for compiling relaxed decision diagrams

0 references

0 references

Enumerative branching with less repetition

0 references

Compact representation of near-optimal integer programming solutions

0 references

Last-mile scheduling under uncertainty

0 references

Exact computation of strongly connected reliability by binary decision diagrams

0 references

Target Cuts from Relaxed Decision Diagrams

0 references

Incorporating bounds from decision diagrams into integer programming

0 references

Multi-machine scheduling lower bounds using decision diagrams

0 references

Graph Coloring Lower Bounds from Decision Diagrams

0 references

Graph coloring with decision diagrams

0 references

Extending compact-diagram to basic smart multi-valued variable diagrams

0 references

From MDD to BDD and arc consistency

0 references

Branching Programs and Binary Decision Diagrams

0 references

0 references

Embedding decision diagrams into generative adversarial networks

0 references

Identifiers

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1287/IJOC.2022.1170

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5106421

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5106421&oldid=39532311"