Pages that link to "Item:Q4367049"
From MaRDI portal
The following pages link to A Column Generation Approach for Graph Coloring (Q4367049):
Displaying 50 items.
- A branch-and-price algorithm for the minimum sum coloring problem (Q1983110) (← links)
- A new branch-and-bound algorithm for the maximum weighted clique problem (Q2002840) (← links)
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs (Q2029946) (← links)
- An incremental search heuristic for coloring vertices of a graph (Q2056884) (← links)
- Interval scheduling with economies of scale (Q2108158) (← links)
- Graph coloring with decision diagrams (Q2118148) (← links)
- A branch and price algorithm for list coloring problem (Q2132397) (← links)
- Improving lower bounds for equitable chromatic number (Q2147053) (← links)
- Symmetry-breaking inequalities for ILP with structured sub-symmetry (Q2196292) (← links)
- Directed weighted improper coloring for cellular channel allocation (Q2255043) (← links)
- Combining lithography and directed self assembly for the manufacturing of vias: connections to graph coloring problems, integer programming formulations, and numerical experiments (Q2273901) (← links)
- A branch-and-price approach for the partition coloring problem (Q2275580) (← links)
- On edge orienting methods for graph coloring (Q2385485) (← links)
- Simple decentralized graph coloring (Q2397096) (← links)
- An exact algorithm for parallel machine scheduling with conflicts (Q2400043) (← links)
- A comparison of integer programming models for the partial directed weighted improper coloring problem (Q2414468) (← links)
- An integer programming approach to b-coloring (Q2419584) (← links)
- A branch-and-price algorithm for the robust graph coloring problem (Q2448920) (← links)
- The general \(\alpha \)-decomposition problem of fuzzy relations (Q2456464) (← links)
- A graph coloring heuristic using partial solutions and a reactive tabu scheme (Q2456655) (← links)
- An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem (Q2460104) (← links)
- Cross-layer optimization in ultra wideband networks (Q2463846) (← links)
- Generalised graph colouring by a hybrid of local search and constraint programming (Q2467347) (← links)
- A cutting plane algorithm for graph coloring (Q2467348) (← links)
- A semidefinite programming-based heuristic for graph coloring (Q2467349) (← links)
- Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355) (← links)
- Efficient algorithms for finding critical subgraphs (Q2467361) (← links)
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement (Q2471278) (← links)
- Comparison of bundle and classical column generation (Q2476993) (← links)
- On the asymmetric representatives formulation for the vertex coloring problem (Q2482105) (← links)
- Embedding a novel objective function in a two-phased local search for robust vertex coloring (Q2482807) (← links)
- An exact method for graph coloring (Q2489282) (← links)
- A branch-and-cut algorithm for graph coloring (Q2489906) (← links)
- A near-optimal optimization algorithm for link assignment in wireless ad-hoc networks (Q2508381) (← links)
- A one-to-one correspondence between colorings and stable sets (Q2517790) (← links)
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems (Q2655613) (← links)
- Total coloring and total matching: polyhedra and facets (Q2673562) (← links)
- A polyhedral approach for graph coloring (Q2741502) (← links)
- Solving the minimum-weighted coloring problem (Q2748384) (← links)
- A NEW APPROACH TO THE VERTEX COLORING PROBLEM (Q2790363) (← links)
- Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams (Q2806865) (← links)
- Dual inequalities for stabilized column generation revisited (Q2806874) (← links)
- Exact solution of graph coloring problems via constraint programming and column generation (Q2815431) (← links)
- An extraction and expansion approach for graph coloring (Q2868189) (← links)
- A column-generation approach to the multiple knapsack problem with color constraints (Q2892278) (← links)
- A Wide Branching Strategy for the Graph Coloring Problem (Q2940061) (← links)
- The maximum-impact coloring polytope (Q2968505) (← links)
- A survey on vertex coloring problems (Q3002686) (← links)
- Safe Lower Bounds for Graph Coloring (Q3009768) (← links)
- A branch-and-cut algorithm for partition coloring (Q3057147) (← links)
