Pages that link to "Item:Q1180838"
From MaRDI portal
The following pages link to A polyhedral approach to edge coloring (Q1180838):
Displayed 20 items.
- ATM VP-based network design (Q596263) (← links)
- A comparison of two edge-coloring formulations (Q688209) (← links)
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results (Q1015318) (← links)
- Min-cut clustering (Q1321669) (← links)
- Solving binary cutting stock problems by column generation and branch- and-bound (Q1326509) (← links)
- The dynamic-demand joint replenishment problem with approximated transportation costs (Q1734353) (← links)
- Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation (Q1774528) (← links)
- How important are branching decisions: fooling MIP solvers (Q1785358) (← links)
- Optimal multicast route packing (Q2378485) (← links)
- A stabilized column generation scheme for the traveling salesman subtour problem (Q2433808) (← links)
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement (Q2471278) (← links)
- Total coloring and total matching: polyhedra and facets (Q2673562) (← links)
- Cutting planes for branch-and-price algorithms (Q3113514) (← links)
- The Proportional Colouring Problem: Optimizing Buffers in Wireless Mesh Networks (Q3503543) (← links)
- Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows (Q3564367) (← links)
- Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound (Q4212712) (← links)
- Column-Generation in Integer Linear Programming (Q4450558) (← links)
- Densities, Matchings, and Fractional Edge-Colorings (Q4620419) (← links)
- Consistency Cuts for Dantzig-Wolfe Reformulations (Q5058051) (← links)
- An integer programming approach to the time slot assignment problem in SS/TDMA systems with intersatellite links (Q5954827) (← links)