The following pages link to (Q4840772):
Displaying 22 items.
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Colorings at minimum cost (Q960968) (← links)
- Introduction to ABACUS -- a branch-and-cut system (Q1271386) (← links)
- An exact algorithm for the identical parallel machine scheduling problem. (Q1416605) (← links)
- A polyhedral approach to sequence alignment problems (Q1585327) (← links)
- Separating capacity constraints in the CVRP using tabu search (Q1609917) (← links)
- On the \(m\)-clique free interval subgraphs polytope: polyhedral analysis and applications (Q1631662) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Combinatorial optimization and small polytopes (Q1814809) (← links)
- A cutting plane algorithm for the unrelated parallel machine scheduling problem (Q1847208) (← links)
- Computing in combinatorial optimization (Q2075761) (← links)
- Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
- A branch-and-cut algorithm for scheduling of projects with variable-intensity activities (Q2487846) (← links)
- A constraint generation algorithm for large scale linear programs using multiple-points separation (Q2492707) (← links)
- Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut (Q2835686) (← links)
- Acceleration of cutting-plane and column generation algorithms: Applications to network design (Q3418117) (← links)
- A polyhedral approach to the feedback vertex set problem (Q4645941) (← links)
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization (Q4789079) (← links)
- Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5891242) (← links)
- Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
- Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5925164) (← links)
- Branch and cut methods for network optimization (Q5936762) (← links)
