Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production
From MaRDI portal
Publication:2357214
DOI10.1007/s11081-014-9249-7zbMath1364.90227OpenAlexW2091604147MaRDI QIDQ2357214
Christine Hayn, Dennis Michaels, Armin Fügenschuh
Publication date: 19 June 2017
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-014-9249-7
global optimizationnonlinear programmingtopology optimizationnetwork designlinear relaxationmixed-integer linear programmingpiecewise linear approximation
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Deterministic network models in operations research (90B10)
Related Items
Towards an algorithmic synthesis of thermofluid systems, Stable honeycomb structures and temperature based trajectory optimization for wire-arc additive manufacturing, An approximation algorithm for optimal piecewise linear interpolations of bounded variable products, On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex envelopes of products of convex and component-wise concave functions
- SCIP: solving constraint integer programs
- Optimal approximation of convex curves by functions which are piecewise linear
- Data point selection for piecewise linear curve approximation
- Convex extensions and envelopes of lower semi-continuous functions
- On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals
- Models for representing piecewise linear cost functions
- Multicriteria optimization
- Approximating separable nonlinear functions via mixed zero-one programs
- Convex envelopes for edge-concave functions
- A polyhedral branch-and-cut approach to global optimization
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
- Convex envelopes generated from finitely many compact convex sets
- Explicit convex and concave envelopes through polyhedral subdivisions
- Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations
- Generalized Benders decomposition
- A Linear Programming Approach to the Chemical Equilibrium Problem
- Using Piecewise Linear Functions for Solving MINLPs
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- Modelling with integer variables
- On the Solution of Discrete Programming Problems
- Approximation of Curves by Line Segments
- Quasi-Concave Programming
- The Convex Envelope of (n–1)-Convex Functions
- Branching and bounds tighteningtechniques for non-convex MINLP
- Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
- Solving Real-World Linear Programs: A Decade and More of Progress
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- A Suggested Extension of Special Ordered Sets to Non-Separable Non-Convex Programming Problems
- Piecewise Linear Approximation of Multivariate Functions
- On the Calculation of the Piecewise Linear Approximation to a Discrete Function
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- Two Algorithms for Piecewise-Linear Continuous Approximation of Functions of One Variable
- Combinatorial and Continuous Models for the Optimization of Traffic Flows on Networks
- Convex Analysis
- Optimal Curve Fitting With Piecewise Linear Functions
- Polyhedral methods for piecewise-linear functions. I: The lambda method
- A practical guide to splines.
- Semidefinite relaxations of fractional programs via novel convexification techniques
