Pages that link to "Item:Q2806865"
From MaRDI portal
The following pages link to Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams (Q2806865):
Displaying 12 items.
- Characteristics of the maximal independent set ZDD (Q405673) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Uncertain vertex coloring problem (Q2001167) (← links)
- Comparison of the number of nodes explored by cyclic best first search with depth contour and best first search (Q2026990) (← links)
- Graph coloring with decision diagrams (Q2118148) (← links)
- Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem (Q2195980) (← links)
- Exact solution of network flow models with strong relaxations (Q2689828) (← links)
- Graph Coloring Lower Bounds from Decision Diagrams (Q5041761) (← links)
- Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms (Q5060784) (← links)
- An Improved Branch-and-Bound Algorithm for the One-Machine Scheduling Problem with Delayed Precedence Constraints (Q5085478) (← links)
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances (Q5106421) (← links)
- A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching (Q5137961) (← links)
