A primal heuristic for nonsmooth mixed integer nonlinear optimization
From MaRDI portal
Recommendations
- Mixed-integer nonlinear optimization
- A computational study of primal heuristics inside an MI(NL)P solver
- Computing feasible points for binary MINLPs with MPECs
- Overview on mixed integer nonlinear programming problems
- Algorithms, softwares and recent developments of mixed integer nonlinear programming
Cited in
(14)- Computing feasible points for binary MINLPs with MPECs
- MIP-based instantaneous control of mixed-integer PDE-constrained gas transport problems
- Complementarity-based nonlinear programming techniques for optimal mixing in gas networks
- Bookings in the European gas market: characterisation of feasibility and computational complexity results
- Maximizing the storage capacity of gas networks: a global MINLP approach
- High detail stationary optimization models for gas networks
- On a primal-proximal heuristic in discrete optimization
- Solving binary-constrained mixed complementarity problems using continuous reformulations
- Validation of nominations in gas network optimization: models, methods, and solutions
- Solving highly detailed gas transport MINLPs: block separability and penalty alternating direction methods
- Computational optimization of gas compressor stations: MINLP models versus continuous reformulations
- A computational study of primal heuristics inside an MI(NL)P solver
- A system to evaluate gas network capacities: concepts and implementation
- An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness
This page was built for publication: A primal heuristic for nonsmooth mixed integer nonlinear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265175)