Pages that link to "Item:Q3923953"
From MaRDI portal
The following pages link to A Suggested Extension of Special Ordered Sets to Non-Separable Non-Convex Programming Problems (Q3923953):
Displaying 12 items.
- Branch and bound, integer, and non-integer programming (Q537592) (← links)
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (Q543399) (← links)
- Mixed integer linear models for the optimization of dynamical transport networks (Q634782) (← links)
- Global optimization of signomial mixed-integer nonlinear programming problems with free variables (Q1024826) (← links)
- An analytical approach to global optimization (Q1181733) (← links)
- A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design (Q2114828) (← links)
- Models and strategies for efficiently determining an optimal vertical alignment of roads (Q2257359) (← links)
- Piecewise linear approximation of functions of two variables in MILP models (Q2270322) (← links)
- Fast feasibility check of the multi-material vertical alignment problem in road design (Q2301147) (← links)
- Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production (Q2357214) (← links)
- Mixed integer models for the stationary case of gas network optimization (Q2583142) (← links)
- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints (Q3503848) (← links)