Pages that link to "Item:Q1291782"

The following pages link to Different transformations for solving non-convex trim-loss problems by MINLP (Q1291782):

Displaying 33 items.

• Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems (Q280099) (← links)
• Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges (Q296762) (← links)
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
• A recipe for finding good solutions to MINLPs (Q384810) (← links)
• Trim loss optimization by an improved differential evolution (Q474531) (← links)
• An improved Bernstein global optimization algorithm for MINLP problems with application in process industry (Q475423) (← links)
• Mixed integer nonlinear programming tools: a practical overview (Q766256) (← links)
• A review of recent advances in global optimization (Q842710) (← links)
• Global solution of optimization problems with signomial parts (Q924639) (← links)
• An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
• The stochastic trim-loss problem (Q1011257) (← links)
• An algorithm for the determination of optimal cutting patterns (Q1348556) (← links)
• A new model for complete solutions to one-dimensional cutting stock problems. (Q1417501) (← links)
• On solving generalized convex MINLP problems using supporting hyperplane techniques (Q1668811) (← links)
• Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
• Domain reduction techniques for global NLP and MINLP optimization (Q1699520) (← links)
• An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming (Q1704917) (← links)
• Polyhedral approximation in mixed-integer convex optimization (Q1800994) (← links)
• Inexact solution of NLP subproblems in MINLP (Q1942026) (← links)
• Nonlinear chance-constrained problems with applications to hydro scheduling (Q2118083) (← links)
• A disjunctive cut strengthening technique for convex MINLP (Q2129197) (← links)
• LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization (Q2164699) (← links)
• Optimality-based domain reduction for inequality-constrained NLP and MINLP problems (Q2182853) (← links)
• On the facet defining inequalities of the mixed-integer bilinear covering set (Q2216198) (← links)
• Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems (Q2250082) (← links)
• Mixed integer nonlinear programming tools: an updated practical overview (Q2393446) (← links)
• Facets of a mixed-integer bilinear covering set with bounds on variables (Q2423814) (← links)
• Solving convex MINLP optimization problems using a sequential cutting plane algorithm (Q2506191) (← links)
• Strong valid inequalities for orthogonal disjunctions and bilinear covering sets (Q2638385) (← links)
• Alternative configurations for cutting machines in a tube cutting mill (Q2643969) (← links)
• Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
• Global Optimization of Mixed-Integer Signomial Programming Problems (Q2897303) (← links)
• Extended Formulations in Mixed-Integer Convex Programming (Q3186495) (← links)