50 years of mixed-integer nonlinear and disjunctive programming
From MaRDI portal
Cites work
- 50 Years of Integer Programming 1958-2008
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
- A branch-and-cut method for 0-1 mixed convex programming
- A combinatorial approach for small and strong formulations of disjunctive constraints
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization
- A computational study of perspective cuts
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function
- A disjunctive cut strengthening technique for convex MINLP
- A duality theorem and an algorithm for (mixed-) integer nonlinear programming
- A feasibility pump for mixed integer nonlinear programs
- A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables
- A framework for generalized Benders' decomposition and its application to multilevel optimization
- A framework for solving mixed-integer semidefinite programs
- A generalization of the classical BB convex underestimation via diagonal and nondiagonal quadratic terms
- A hybrid LP/NLP paradigm for global optimization relaxations
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A mixed-integer nonlinear program for the optimal design and dispatch of distributed generation systems
- A polyhedral branch-and-cut approach to global optimization
- A proximal-point outer approximation algorithm
- A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions
- A tree-search algorithm for mixed integer programming problems
- A unified approach to mixed-integer optimization problems with logical constraints
- Advances for the pooling problem: modeling, global optimization, and computational studies (Survey)
- Algorithmic approach for improved mixed-integer reformulations of convex generalized disjunctive programs
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- Alternative regularizations for outer-approximation algorithms for convex MINLP
- An algorithm for disjunctive programs
- An Algorithm for the Traveling Salesman Problem
- An Automatic Method of Solving Discrete Programming Problems
- An exact solution approach for portfolio optimization problems under stochastic and integer constraints
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Assignment Problems and the Location of Economic Activities
- Between steps: intermediate relaxations between big-M and convex hull formulations
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Branching and bounds tighteningtechniques for non-convex MINLP
- Branching rules revisited
- Chvátal closures for mixed integer programming problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Convex envelopes generated from finitely many compact convex sets
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm
- Convex mixed-integer nonlinear programs derived from generalized disjunctive programming using cones
- Convex programming for disjunctive convex optimization
- Cutting plane algorithm for convex generalized disjunctive programs
- Deep neural networks and mixed integer linear optimization
- Different transformations for solving non-convex trim-loss problems by MINLP
- Disjunctive Cuts for Nonconvex MINLP
- Disjunctive cuts in mixed-integer conic optimization
- Disjunctive Programming
- Disjunctive programming
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- Disjunctive programming: Properties of the convex hull of feasible points
- Experimental operation of a solar-driven climate system with thermal energy storages using mixed-integer nonlinear model predictive control
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON
- Extensions to generalized disjunctive programming: hierarchical structures and first-order logic
- Fifty years of operational research: 1972--2022
- Generalized Benders decomposition
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation
- Generalized disjunctive programming: a framework for formulation and alternative algorithms for MINLP optimization
- Global minimum potential energy conformations of small molecules
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
- Global optimization of mixed-integer models with quadratic and signomial functions: a review
- Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques
- Global optimization with polynomials and the problem of moments
- scientific article; zbMATH DE number 3943568 (Why is no real title available?)
- scientific article; zbMATH DE number 3545380 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 976325 (Why is no real title available?)
- scientific article; zbMATH DE number 1101647 (Why is no real title available?)
- scientific article; zbMATH DE number 1795203 (Why is no real title available?)
- scientific article; zbMATH DE number 1795205 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Ideal formulations for constrained convex optimization problems with indicator variables
- Improving the performance of DICOPT in convex MINLP problems using a feasibility pump
- Increasing electric vehicle adoption through the optimal deployment of fast-charging stations for local and long-distance travel
- Integer Programming
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
- Integrating SQP and branch-and-bound for mixed integer nonlinear programming
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets
- Juniper: an open-source nonlinear branch-and-bound solver in Julia
- Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Lift-and-project cuts for convex mixed integer nonlinear programs
- Lift-and-project cuts for mixed integer convex programs
- Logic, optimization, and constraint programming
- Logic-based Benders decomposition
- Margin optimal classification trees
- McCormick-Based Relaxations of Algorithms
- Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems
- Minotaur: a mixed-integer nonlinear optimization toolkit
- Mixed integer models for the stationary case of gas network optimization
- Mixed integer programming: analyzing 12 years of progress
- Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes
- Model building in mathematical programming.
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization
- New mixed-integer nonlinear programming formulations for the unit commitment problems with ramping constraints
- Nonlinear Programming
- On branching rules for convex mixed-integer nonlinear optimization
- On copositive programming and standard quadratic optimization problems
- On handling indicator constraints in mixed integer programming
- On mathematical programming with indicator constraints
- On solving generalized convex MINLP problems using supporting hyperplane techniques
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the generalization of ECP and OA methods to nonsmooth convex MINLP problems
- Optimal classification trees
- Optimization with disjunctive constraints
- Outer approximation for integer nonlinear programs via decision diagrams
- Outer approximation with conic certificates for mixed-integer convex problems
- Outer-approximation algorithms for nonsmooth convex MINLP problems
- Outline of an algorithm for integer solutions to linear programs
- Partially distributed outer approximation
- Partitioning procedures for solving mixed-variables programming problems
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Perspective reformulation and applications
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Planning and scheduling in the process industry
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
- Presolve Reductions in Mixed Integer Programming
- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
- Radiation treatment planning: mixed integer programming formulations and approaches
- Reformulations for utilizing separability when solving convex MINLP problems
- Regularized optimization methods for convex MINLP problems
- Relaxations of factorable functions with convex-transformable intermediates
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Routing a mix of conventional, plug-in hybrid, and electric vehicles
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Solving AC Optimal Power Flow with Discrete Decisions to Global Optimality
- Solving mixed integer nonlinear programs by outer approximation
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- SOS-SDP: An Exact Solver for Minimum Sum-of-Squares Clustering
- Sparse convex optimization toolkit: a mixed-integer framework
- Start-up/shut-down MINLP formulations for the unit commitment with ramp constraints
- Strong formulations for conic quadratic optimization with indicator variables
- Strong mixed-integer programming formulations for trained neural networks
- Strong optimal classification trees
- Strong-branching inequalities for convex mixed integer nonlinear programs
- SUSPECT: MINLP special structure detector for Pyomo
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming
- The electric fleet size and mix vehicle routing problem with time windows and recharging stations
- The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
- The flexible job shop scheduling problem: a review
- The supporting hyperplane optimization toolkit for convex MINLP
- The traveling salesman problem. A computational study.
- The vehicle routing problem: An overview of exact and approximate algorithms
- Towards parallel implementation of hybrid MPC -- a survey and directions for future research
- Two linear approximation algorithms for convex mixed integer nonlinear programming
- Using regularization and second order information in outer approximation for convex MINLP
This page was built for publication: 50 years of mixed-integer nonlinear and disjunctive programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233760)
