The following pages link to Integrated methods for optimization (Q662264):
Displaying 19 items.
- Projection, consistency, and George Boole (Q265702) (← links)
- Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound (Q323168) (← links)
- Invariants for time-series constraints (Q823762) (← links)
- Lagrangian bounds from decision diagrams (Q890004) (← links)
- A modular capacitated multi-objective model for locating maritime search and rescue vessels (Q1615931) (← links)
- Constraint programming and operations research (Q1616390) (← links)
- Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions (Q1748494) (← links)
- Hybrid optimization methods for time-dependent sequencing problems (Q1751901) (← links)
- SUSPECT: MINLP special structure detector for Pyomo (Q2182769) (← links)
- Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem (Q2195980) (← links)
- MiniCP: a lightweight solver for constraint programming (Q2246188) (← links)
- Graph coloring inequalities from all-different systems (Q2342600) (← links)
- Boosting an exact logic-based Benders decomposition approach by variable neighborhood search (Q2631247) (← links)
- Achieving consistency with cutting planes (Q2687054) (← links)
- Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
- Logic-Based Benders Decomposition for Large-Scale Optimization (Q3296379) (← links)
- Stochastic Planning and Scheduling with Logic-Based Benders Decomposition (Q5057988) (← links)
- Optimization Bounds from the Branching Dual (Q5139843) (← links)
- Toward unification of exact and heuristic optimization methods (Q5246819) (← links)
