Pages that link to "Item:Q4367049"
From MaRDI portal
The following pages link to A Column Generation Approach for Graph Coloring (Q4367049):
Displayed 45 items.
- 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)
- 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)
- 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)
- Graph Coloring Using GPUs (Q3297570) (← links)
- CsegGraph: a graph colouring instance generator (Q3643182) (← links)
- Column-Generation in Integer Linear Programming (Q4450558) (← links)
- (Q4487087) (← links)
- Iterative coloring extension of a maximum clique (Q4544221) (← links)
- Branch-and-Cut-and-Price algorithms for the preemptive RCPSP (Q4553884) (← links)
- Graph Coloring Lower Bounds from Decision Diagrams (Q5041761) (← links)
- Constraint and Satisfiability Reasoning for Graph Coloring (Q5129999) (← links)
- The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches (Q5136080) (← links)
- A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching (Q5137961) (← links)
- A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations (Q5140720) (← links)
- On the recursive largest first algorithm for graph colouring (Q5451459) (← links)
- Constraint programming-based column generation (Q5902286) (← links)
- Constraint programming-based column generation (Q5919991) (← links)
- Models and solution techniques for frequency assignment problems (Q5920489) (← links)
- Comparison of column generation models for channel assignment in cellular networks (Q5946824) (← links)
- On optimization formulations for radio resource allocation subject to common transmission rate (Q6065617) (← links)
- Adaptive solution prediction for combinatorial optimization (Q6112875) (← links)