Pages that link to "Item:Q2489906"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for graph coloring (Q2489906):
Displaying 50 items.
- A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations (Q281816) (← links)
- A polyhedral investigation of star colorings (Q284838) (← links)
- Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks (Q322774) (← links)
- An exact algorithm with learning for the graph coloring problem (Q337154) (← links)
- A DSATUR-based algorithm for the equitable coloring problem (Q337479) (← links)
- Discrete optimization methods to fit piecewise affine models to data points (Q342537) (← links)
- Fractional programming formulation for the vertex coloring problem (Q402376) (← links)
- A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem (Q408371) (← links)
- An exact approach for the vertex coloring problem (Q429677) (← links)
- Solving vertex coloring problems as maximum weight stable set problems (Q516805) (← 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)
- Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
- Orbital branching (Q623461) (← links)
- Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz (Q650840) (← links)
- Packing and partitioning orbitopes (Q925263) (← links)
- Variable space search for graph coloring (Q955321) (← links)
- Solving a multicoloring problem with overlaps using integer programming (Q968150) (← links)
- An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools (Q1686513) (← links)
- Polyhedral studies of vertex coloring problems: the standard formulation (Q1751160) (← links)
- A branch-and-cut procedure for the Udine course timetabling problem (Q1761891) (← links)
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring (Q1762162) (← links)
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
- Maximum-weight stable sets and safe lower bounds for graph coloring (Q1946922) (← links)
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs (Q2029946) (← links)
- A note on computational approaches for the antibandwidth problem (Q2051212) (← links)
- Graph coloring with decision diagrams (Q2118148) (← links)
- The minimum chromatic violation problem: a polyhedral approach (Q2184668) (← links)
- Ising formulations of some graph-theoretic problems in psychological research: models and methods (Q2244634) (← 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)
- Cutting-plane-based algorithms for two branch vertices related spanning tree problems (Q2357824) (← links)
- The minimum chromatic violation problem: a polyhedral study (Q2413191) (← links)
- An integer programming approach to b-coloring (Q2419584) (← links)
- Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355) (← 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 one-to-one correspondence between colorings and stable sets (Q2517790) (← links)
- Total coloring and total matching: polyhedra and facets (Q2673562) (← 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)
- A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems (Q2883604) (← links)
- Lower Bounds for the Minimal Sum Coloring Problem (Q2883634) (← links)
- A Wide Branching Strategy for the Graph Coloring Problem (Q2940061) (← links)
- The maximum-impact coloring polytope (Q2968505) (← links)
- Safe Lower Bounds for Graph Coloring (Q3009768) (← links)
- CsegGraph: a graph colouring instance generator (Q3643182) (← links)
- Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches (Q4622891) (← links)
- Three algorithms for graph locally harmonious colouring (Q4978237) (← links)
- A polyhedral study of the acyclic coloring problem (Q5891089) (← links)
