Computing tight bounds via piecewise linear functions through the example of circle cutting problems
From MaRDI portal
(Redirected from Publication:328518)
Recommendations
- Approximate algorithms for constrained circular cutting problems
- An efficient cutting plane algorithm for the smallest enclosing circle problem
- Bounds for Two-Dimensional Cutting
- Publication:3774452
- 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
Cites work
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Approximating separable nonlinear functions via mixed zero-one programs
- Column enumeration based decomposition techniques for a class of non-convex MINLP problems
- Combining sampling-based and scenario-based nested Benders decomposition methods: application to stochastic dual dynamic programming
- Computing Area-Tight Piecewise Linear Overestimators, Underestimators and Tubes for Univariate Functions
- Constrained global optimization: algorithms and applications
- Continuous piecewise linear delta-approximations for bivariate and multivariate functions
- Continuous piecewise linear delta-approximations for univariate functions: computing minimal breakpoint systems
- Cutting circles and polygons from area-minimizing rectangles
- Cutting ellipses from area-minimizing rectangles
- Decomposition strategy for the stochastic pooling problem
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- Global optimization using special ordered sets
- Introduction to global optimization.
- Mixed integer linear models for the optimization of dynamical transport networks
- Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Models for representing piecewise linear cost functions
- Multi-stage stochastic optimization applied to energy planning
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions
- Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach
- Semi-Infinite Programming: Theory, Methods, and Applications
- Stochastic dual dynamic programming applied to nonconvex hydrothermal models
Cited in
(11)- A Comparison of Two Mixed-Integer Linear Programs for Piecewise Linear Function Fitting
- Two-stage stochastic mixed-integer nonlinear programming model for post-wildfire debris flow hazard management: mitigation and emergency evacuation
- An effective logarithmic formulation for piecewise linearization requiring no inequality constraint
- On tackling reverse convex constraints for non-overlapping of unequal circles
- A linear programming approach to difference-of-convex piecewise linear approximation
- Data-driven stochastic optimization for distributional ambiguity with integrated confidence region
- scientific article; zbMATH DE number 3996512 (Why is no real title available?)
- Non-convex nested Benders decomposition
- Data-driven mixed-integer linear programming-based optimisation for efficient failure detection in large-scale distributed systems
- Sequence of polyhedral relaxations for nonlinear univariate functions
- Piecewise Linear Function Fitting via Mixed-Integer Linear Programming
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)
