The following pages link to (Q4547547):
Displaying 30 items.
- A polyhedral study of the maximum stable set problem with weights on vertex-subsets (Q299097) (← links)
- Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
- Permutation codes with specified packing radius (Q356723) (← links)
- A preemptive bound for the resource constrained project scheduling problem (Q398922) (← links)
- On risk-averse maximum weighted subgraph problems (Q405680) (← links)
- An exact approach for the vertex coloring problem (Q429677) (← links)
- Optimal wafer cutting in shuttle layout problems (Q719028) (← links)
- A new table of permutation codes (Q766240) (← links)
- A maximum edge-weight clique extraction algorithm based on branch-and-bound (Q783045) (← links)
- Minimum cost edge blocker clique problem (Q827246) (← links)
- A clique algorithm for standard quadratic programming (Q955308) (← links)
- Optimal \((n,4,2)\)-OOC of small orders. (Q1428520) (← links)
- Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092) (← links)
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights (Q1640044) (← links)
- A branch-and-check approach for a wind turbine maintenance scheduling problem (Q1651530) (← links)
- Integral simplex using decomposition with primal cutting planes (Q1683694) (← links)
- A hybrid iterated local search heuristic for the maximum weight independent set problem (Q1749784) (← links)
- General cut-generating procedures for the stable set polytope (Q1752480) (← links)
- PUSH: A generalized operator for the maximum vertex weight clique problem (Q1752768) (← links)
- Multi-neighborhood tabu search for the maximum weight clique problem (Q1761843) (← links)
- Incomplete inference for graph problems (Q1947627) (← links)
- Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound (Q2030442) (← links)
- A clique search problem and its application to machine scheduling (Q2068853) (← links)
- Parallelization of a branch-and-bound algorithm for the maximum weight clique problem (Q2234743) (← links)
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem (Q2302299) (← links)
- An exact algorithm for parallel machine scheduling with conflicts (Q2400043) (← links)
- Foldabilizing furniture (Q2802320) (← links)
- Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation (Q5131729) (← links)
- Primal Heuristics for Branch and Price: The Assets of Diving Methods (Q5138257) (← links)
