Pages that link to "Item:Q1946922"

The following pages link to Maximum-weight stable sets and safe lower bounds for graph coloring (Q1946922):

Displaying 42 items.

• A polyhedral study of the maximum stable set problem with weights on vertex-subsets (Q299097) (← links)
• Lower bounding techniques for DSATUR-based branch and bound (Q325423) (← links)
• Fractional programming formulation for the vertex coloring problem (Q402376) (← links)
• Characteristics of the maximal independent set ZDD (Q405673) (← links)
• Solving vertex coloring problems as maximum weight stable set problems (Q516805) (← 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)
• General cut-generating procedures for the stable set polytope (Q1752480) (← links)
• A new upper bound for the maximum weight clique problem (Q1754725) (← 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)
• A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints (Q2010923) (← links)
• A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
• An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs (Q2029946) (← links)
• Solving bin packing problems using VRPSolver models (Q2033390) (← links)
• Graph coloring with decision diagrams (Q2118148) (← links)
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
• Variable ordering for decision diagrams: a portfolio approach (Q2152280) (← links)
• Scheduling a single parallel-batching machine with non-identical job sizes and incompatible job families (Q2158015) (← links)
• A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
• A note on selective line-graphs and partition colorings (Q2294381) (← links)
• An exact algorithm for parallel machine scheduling with conflicts (Q2400043) (← links)
• Total coloring and total matching: polyhedra and facets (Q2673562) (← links)
• Exact solution of network flow models with strong relaxations (Q2689828) (← 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)
• Iterative Refinement for Linear Programming (Q2830949) (← links)
• A Wide Branching Strategy for the Graph Coloring Problem (Q2940061) (← links)
• A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph (Q4599315) (← links)
• Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem (Q4599322) (← links)
• A Fast Algorithm for Knapsack Problem with Conflict Graph (Q5024916) (← links)
• Graph Coloring Lower Bounds from Decision Diagrams (Q5041761) (← links)
• Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems (Q5058013) (← links)
• A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques (Q5085477) (← links)
• Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming (Q5086003) (← links)
• A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching (Q5137961) (← links)
• Primal Heuristics for Branch and Price: The Assets of Diving Methods (Q5138257) (← links)
• Projective Cutting-Planes (Q5221062) (← links)
• Single machine parallel-batch scheduling under time-of-use electricity prices: new formulations and optimisation approaches (Q6090154) (← links)
• Maximum weight perfect matching problem with additional disjunctive conflict constraints (Q6179693) (← links)
• Knapsack: connectedness, path, and shortest-path (Q6547953) (← links)