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 polyhedral study of the maximum stable set problem with weights on vertex-subsets (Q299097) (← links)
- An effective branch-and-price algorithm for the preemptive resource constrained project scheduling problem based on minimal interval order enumeration (Q319357) (← links)
- A column generation approach for solving the examination-timetabling problem (Q323146) (← links)
- Lower bounding techniques for DSATUR-based branch and bound (Q325423) (← links)
- An exact algorithm with learning for the graph coloring problem (Q337154) (← links)
- Fractional programming formulation for the vertex coloring problem (Q402376) (← links)
- Exploring the role of graph spectra in graph coloring algorithm performance (Q403572) (← links)
- A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem (Q408371) (← links)
- Heuristics for a project management problem with incompatibility and assignment costs (Q429511) (← links)
- An exact approach for the vertex coloring problem (Q429677) (← links)
- Exact weighted vertex coloring via branch-and-price (Q448972) (← links)
- Constrained clustering by constraint programming (Q511767) (← links)
- A column generation based algorithm for the robust graph coloring problem (Q516837) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- The maximum \(k\)-colorable subgraph problem and orbitopes (Q666000) (← links)
- On the application of graph colouring techniques in round-robin sports scheduling (Q709125) (← links)
- Three new upper bounds on the chromatic number (Q765327) (← links)
- A simple branching scheme for vertex coloring problems (Q765355) (← links)
- An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
- 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)