Pages that link to "Item:Q613320"

The following pages link to On interval-subgradient and no-good cuts (Q613320):

Displaying 13 items.

• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• Regularized optimization methods for convex MINLP problems (Q518454) (← links)
• Application-oriented mixed integer non-linear programming (Q607876) (← links)
• Quadratic programs with hollows (Q1659682) (← links)
• Rounding-based heuristics for nonconvex MINLPS (Q1762458) (← links)
• A storm of feasibility pumps for nonconvex MINLP (Q1925794) (← links)
• An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities (Q2089867) (← links)
• Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound (Q2129196) (← links)
• Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support (Q2374364) (← links)
• Polynomial size IP formulations of knapsack may require exponentially large coefficients (Q2661530) (← links)
• Bilevel Knapsack with Interdiction Constraints (Q3186662) (← links)
• Fairness over time in dynamic resource allocation with an application in healthcare (Q6120930) (← links)
• Derivative-free mixed binary necklace optimization for cyclic-symmetry optimal design problems (Q6159484) (← links)