Different transformations for solving non-convex trim-loss problems by MINLP
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 976325 (Why is no real title available?)
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
- An Automatic Method of Solving Discrete Programming Problems
- An LP-based approach to cutting stock problems with multiple objectives
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
- Generalized Benders decomposition
- Solving Large-Scale Zero-One Linear Programming Problems
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- The trim-loss and assortment problems: A survey
Cited in
(36)- Inexact solution of NLP subproblems in MINLP
- Mixed integer nonlinear programming tools: a practical overview
- Polyhedral approximation in mixed-integer convex optimization
- On the facet defining inequalities of the mixed-integer bilinear covering set
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Nonlinear chance-constrained problems with applications to hydro scheduling
- An algorithmic framework for convex mixed integer nonlinear programs
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems
- Alternative configurations for cutting machines in a tube cutting mill
- A review of recent advances in global optimization
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
- A new model for complete solutions to one-dimensional cutting stock problems.
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- Preface
- Global solution of optimization problems with signomial parts
- A disjunctive cut strengthening technique for convex MINLP
- The stochastic trim-loss problem
- LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Simultaneous convexification of bilinear functions over polytopes with application to network interdiction
- A recipe for finding good solutions to MINLPs
- Mixed integer linear programming formulation techniques
- Extended formulations in mixed-integer convex programming
- On solving generalized convex MINLP problems using supporting hyperplane techniques
- Trim loss optimization by an improved differential evolution
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems
- Global optimization of mixed-integer signomial programming problems
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- An algorithm for the determination of optimal cutting patterns
- Facets of a mixed-integer bilinear covering set with bounds on variables
- Domain reduction techniques for global NLP and MINLP optimization
- An accelerated extended cutting plane approach with piecewise linear approximations for signomial geometric programming
- LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization
- Mixed integer nonlinear programming tools: an updated practical overview
This page was built for publication: Different transformations for solving non-convex trim-loss problems by MINLP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291782)
