Simultaneous convexification for the planar obnoxious facility location problem
From MaRDI portal
Cites work
- \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables
- A branch-and-cut method for the obnoxious \(p\)-median problem
- A branch-and-reduce approach to global optimization
- A convex envelope formula for multilinear functions
- A d.c. optimization method for single facility location problems
- A hybrid LP/NLP paradigm for global optimization relaxations
- A Maxmin Location Problem
- A new framework to relax composite functions in nonlinear programs
- A Successive Underestimation Method for Concave Minimization Problems
- Comparison Of Four Models For dispersing Facilities
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computable representations for convex hulls of low-dimensional quadratic forms
- Computational geometry. Algorithms and applications.
- Convex envelope of bivariate cubic functions over rectangular regions
- Convex envelopes for edge-concave functions
- Convex envelopes of bivariate functions through the solution of KKT systems
- Convex envelopes of monomials of odd degree
- Convex envelopes of products of convex and component-wise concave functions
- Convex extensions and envelopes of lower semi-continuous functions
- Convex relaxations for mixed-integer nonlinear programs
- Convexification of bilinear forms through non-symmetric lifting
- Convexification of Permutation-Invariant Sets and an Application to Sparse Principal Component Analysis
- DC programming: overview.
- Estimation of individualized decision rules based on an optimized covariate-dependent equivalent of random outcomes
- Explicit convex and concave envelopes through polyhedral subdivisions
- Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Global optimization with polynomials and the problem of moments
- scientific article; zbMATH DE number 1667417 (Why is no real title available?)
- scientific article; zbMATH DE number 1340521 (Why is no real title available?)
- scientific article; zbMATH DE number 679868 (Why is no real title available?)
- scientific article; zbMATH DE number 1091317 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- Intersection cuts for polynomial optimization
- LAPACK Users' Guide
- Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
- Lifting convex inequalities for bipartite bilinear programs
- Locating an undesirable facility with a minimax criterion
- On cutting planes for cardinality-constrained linear programs
- On tackling reverse convex constraints for non-overlapping of unequal circles
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems
- Packing equal circles in a square: A deterministic global optimization approach
- Relaxations and cutting planes for linear programs with complementarity constraints
- Reverse convex programming
- Review of obnoxious facilities location problems
- Rigorous convex underestimators for general twice-differentiable problems
- SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs
- Semidefinite relaxations of fractional programs via novel convexification techniques
- Simultaneous convexification of bilinear functions over polytopes with application to network interdiction
- Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks
- Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming
- Spectral relaxations and branching strategies for global optimization of mixed-integer quadratic programs
- The circle packing problem: a theoretical comparison of various convexification techniques
- The Location of Undesirable Facilities
- The multifacility maximin planar location problem with facility interaction
- Three enhancements for optimization-based bound tightening
- Tractable relaxations of composite functions
- Valid inequalities for separable concave constraints with indicator variables
This page was built for publication: Simultaneous convexification for the planar obnoxious facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6983497)
