Pages that link to "Item:Q4367049"
From MaRDI portal
The following pages link to A Column Generation Approach for Graph Coloring (Q4367049):
Displayed 50 items.
- On compact formulations for integer programs solved by column generation (Q817199) (← links)
- On the queen graphs coloring problem. (Q817869) (← links)
- ILP approaches to the blockmodel problem (Q856277) (← links)
- Packing and partitioning orbitopes (Q925263) (← links)
- A column generation and branch-and-cut algorithm for the channel assignment problem (Q941544) (← links)
- Variable space search for graph coloring (Q955321) (← links)
- Solving a multicoloring problem with overlaps using integer programming (Q968150) (← links)
- A column generation method for the multiple-choice multi-dimensional knapsack problem (Q969718) (← links)
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (Q976033) (← links)
- A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing (Q1013410) (← links)
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results (Q1015318) (← links)
- An inexact bundle variant suited to column generation (Q1016116) (← links)
- On column generation formulations for the RWA problem (Q1025995) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Cliques, holes and the vertex coloring polytope (Q1029072) (← links)
- Graph coloring by multiagent fusion search (Q1037448) (← links)
- Models and heuristic algorithms for a weighted vertex coloring problem (Q1038841) (← links)
- Enhancing CP-based column generation for integer programs (Q1041402) (← links)
- Cliques and clustering: A combinatorial approach (Q1267180) (← links)
- A network-flow-based lower bound for the minimum weighted integer coloring problem (Q1589479) (← links)
- Erratum to ``Comparison of column generation models for channel assignment in cellular networks'' (Q1602699) (← links)
- A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem (Q1610145) (← links)
- An exact algorithm for the partition coloring problem (Q1651600) (← links)
- ILP models and column generation for the minimum sum coloring problem (Q1742227) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Polyhedral studies of vertex coloring problems: the standard formulation (Q1751160) (← links)
- Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles (Q1752844) (← links)
- A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) (← links)
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring (Q1762162) (← links)
- Maximum-weight stable sets and safe lower bounds for graph coloring (Q1946922) (← links)
- 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)