The following pages link to (Q4398361):
Displaying 15 items.
- Lexicography and degeneracy: Can a pure cutting plane algorithm work? (Q647393) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- A branch-and-cut algorithm for the continuous error localization problem in data cleaning (Q875426) (← links)
- Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading (Q1046716) (← links)
- Rank inequalities and separation algorithms for packing designs and sparse triple systems. (Q1401311) (← links)
- Frequency assignment in mobile radio systems using branch-and-cut techniques (Q1569929) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- Binary Steiner trees: structural results and an exact solution approach (Q1751166) (← links)
- An optimality cut for mixed integer linear programs (Q1809846) (← links)
- Optimisation of the interconnecting network of a UMTS radio mobile telephone system (Q1869690) (← links)
- A new separation algorithm for the Boolean quadric and cut polytopes (Q2339832) (← links)
- Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
- Finding multiple solutions to general integer linear programs (Q2384650) (← links)
- Optimal selection of a portfolio of options under value-at-risk constraints: a scenario approach (Q2430628) (← links)
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut (Q3430946) (← links)
