Pages that link to "Item:Q5902903"
From MaRDI portal
The following pages link to Maximin Problem and a Duality Theorem for Mixed‐Integer Quadratic Programming (Q5902903):
Displaying 12 items.
- Fitting piecewise linear continuous functions (Q439615) (← links)
- Minimizing a monotone concave function with laminar covering constraints (Q943837) (← links)
- The continuous modular design problem with linear separable side constraints (Q1178998) (← links)
- Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints (Q1947201) (← links)
- Piecewise linear bounding functions in univariate global optimization (Q2156897) (← links)
- An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint (Q2491532) (← links)
- A nonconvex, piecewise linear optimization problem (Q2640447) (← links)
- Relationships among linear formulations of separable convex piecewise linear programs (Q3703597) (← links)
- A method for solving piecewise linear concave programming problems using imbeddability properties of polyhedral sets (Q3979622) (← links)
- Reduction of a Minimization Problem of a Separable Convex Function Under Linear Constraints to a Fixed Point Problem (Q4553644) (← links)
- (Q5460039) (← links)
- Integer Programming and Combinatorial Optimization (Q5712456) (← links)
