Pages that link to "Item:Q3787788"
From MaRDI portal
The following pages link to A class of combinatorial problems with polynomially solvable large scale set covering/partitioning relaxations (Q3787788):
Displaying 14 items.
- Polynomial-time algorithms for regular set-covering and threshold synthesis (Q1089348) (← links)
- Performance modeling and optimization of networks of bridged LANs (Q1176441) (← links)
- On combined minmax-minsum optimization (Q1333027) (← links)
- A column generation approach to job grouping for flexible manufacturing systems (Q1341988) (← links)
- An exact algorithm for IP column generation (Q1360108) (← links)
- Graph theoretic relaxations of set covering and set partitioning problems (Q1390264) (← links)
- A column generation approach to capacitated \(p\)-median problems (Q1433151) (← links)
- The matching relaxation for a class of generalized set partitioning problems (Q1634772) (← links)
- An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment (Q1823142) (← links)
- Solving combinatorial problems with combined min-max-min-sum objective and applications (Q1824562) (← links)
- Graph partitioning applied to the logic testing of combinational circuits (Q1900143) (← links)
- On some large-scale LP relaxations for the graph partitioning problem and their optimal solutions (Q1904713) (← links)
- Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations (Q4018535) (← links)
- Column-Generation in Integer Linear Programming (Q4450558) (← links)
