Preface: global optimization algorithms and applications
From MaRDI portal
Cites work
- A new and faster representation for counting integer points in parametric polyhedra
- A two-stage stochastic programming approach for generation and transmission maintenance scheduling with risk management
- Bounding-focused discretization methods for the global optimization of nonconvex semi-infinite programs
- Error control and Neyman-Pearson classification with buffered probability and support vectors
- Learning to accelerate tightening of convex relaxations of the AC optimal power flow problem
- Model-and-search: a derivative-free local optimization algorithm
- New biconvex optimization for planning of battery energy storage systems
- Regularized standard polynomial programming formulations for the maximum clique problem
- Solving continuous and discrete nonlinear programs with BARON
- Two-commodity opposite direction network flow formulations for the travelling salesman problem
- Ultra-small world detection in networks: subgraphs with prescribed distance distributions
This page was built for publication: Preface: global optimization algorithms and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6878849)
