Extended formulations via decision diagrams

DOI10.1007/978-3-031-49193-1_2MaRDI QIDQ6591617

Haruki Hamasaki, Eiji Takimoto, Yuta Kurokawa, Kohei Hatano, Holakou Rahmanian, Ryotaro Mitsuboshi

Publication date: 22 August 2024

zbMATH Keywords

mixed integer programsdecision diagramsextend formulation

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Decision diagrams for optimization
• Expressing combinatorial optimization problems by linear programs
• A decision-theoretic generalization of on-line learning and an application to boosting
• Strengthening convex relaxations of 0/1-sets using Boolean formulas
• Fast \(q\)-gram mining on SLP compressed strings
• Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams
• Algorithmics on SLP-compressed strings: a survey
• Manipulating MDD Relaxations for Combinatorial Optimization
• An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
• Processing Compressed Texts: A Tractability Border
• Graph-Based Algorithms for Boolean Function Manipulation
• Minimal NFA Problems are Hard
• Automata, Languages and Programming
• Extended formulations in combinatorial optimization
• Boosting over non-deterministic ZDDs

This page was built for publication: Extended formulations via decision diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6591617)