Computing tight bounds via piecewise linear functions through the example of circle cutting problems
DOI10.1007/S00186-016-0546-0zbMATH Open1396.90051OpenAlexW2439104872MaRDI QIDQ328518FDOQ328518
Authors: Steffen Rebennack 
Publication date: 20 October 2016
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-016-0546-0
Recommendations
- Approximate algorithms for constrained circular cutting problems
- An efficient cutting plane algorithm for the smallest enclosing circle problem
- Bounds for Two-Dimensional Cutting
- scientific article; zbMATH DE number 4034533
- Branch and bound for the cutwidth minimization problem
- Cutting circles into pseudo-segments and improved bounds for incidences
- Tight bounds on a problem of lines and intersections
- Algorithm for piecewise-linear approximation of the reachable set boundary
- Cut-off in linear partially combinatorial problems of Euclidean combinatorial optimization
- Cutting circles and polygons from area-minimizing rectangles
global optimizationnonlinear programmingnon-convex optimizationouter approximationmixed integer linear programmingpiecewise linear functionsinner approximationcircle cuttingincremental formulationlogarithmic formulationquadratically constrained programming
Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Mixed integer programming (90C11)
Cites Work
- Constrained global optimization: algorithms and applications
- Multi-stage stochastic optimization applied to energy planning
- Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
- Introduction to global optimization.
- Cutting circles and polygons from area-minimizing rectangles
- Cutting ellipses from area-minimizing rectangles
- Column enumeration based decomposition techniques for a class of non-convex MINLP problems
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Decomposition strategy for the stochastic pooling problem
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
- Models for representing piecewise linear cost functions
- Mixed integer linear models for the optimization of dynamical transport networks
- Approximating separable nonlinear functions via mixed zero-one programs
- Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach
- Computing Area-Tight Piecewise Linear Overestimators, Underestimators and Tubes for Univariate Functions
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- Global optimization using special ordered sets
- Stochastic dual dynamic programming applied to nonconvex hydrothermal models
- On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- Continuous piecewise linear delta-approximations for bivariate and multivariate functions
- Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems
Cited In (11)
- Non-convex nested Benders decomposition
- Two-stage stochastic mixed-integer nonlinear programming model for post-wildfire debris flow hazard management: mitigation and emergency evacuation
- Piecewise Linear Function Fitting via Mixed-Integer Linear Programming
- Title not available (Why is that?)
- Sequence of polyhedral relaxations for nonlinear univariate functions
- An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
- On tackling reverse convex constraints for non-overlapping of unequal circles
- A Comparison of Two Mixed-Integer Linear Programs for Piecewise Linear Function Fitting
- Data-driven mixed-integer linear programming-based optimisation for efficient failure detection in large-scale distributed systems
- A linear programming approach to difference-of-convex piecewise linear approximation
- Data-driven stochastic optimization for distributional ambiguity with integrated confidence region
Uses Software
This page was built for publication: Computing tight bounds via piecewise linear functions through the example of circle cutting problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q328518)
