Pages that link to "Item:Q1333026"
From MaRDI portal
The following pages link to The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems (Q1333026):
Displaying 11 items.
- A weight-balanced branching rule for SAT (Q597527) (← links)
- A parallel implementation of the column subtraction algorithm (Q673834) (← links)
- A dual ascent procedure for the set partitioning problem (Q955334) (← links)
- Computational experience with general cutting planes for the set covering problem (Q1002077) (← links)
- A genetic algorithm for the set covering problem (Q1278326) (← links)
- Backtracking tactics in the backtrack method for SAT (Q1596804) (← links)
- A concurrent processing framework for the set partitioning problem (Q1603333) (← links)
- The column-circular, subsets-selection problem: Complexity and solutions (Q1974273) (← links)
- Exact and heuristic algorithms for the maximum weighted submatrix coverage problem (Q2076862) (← links)
- Optimal set-partitioning based on group quality likelihood using partition-growing algorithm (Q2874033) (← links)
- Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the <scp>VeRoLog</scp> Solver Challenge 2019 (Q6092663) (← links)
