The following pages link to AlphaECP (Q17091):
Displaying 50 items.
- A new achievement scalarizing function based on parameterization in multiobjective optimization (Q421085) (← links)
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming (Q439452) (← links)
- An improved Bernstein global optimization algorithm for MINLP problems with application in process industry (Q475423) (← links)
- A short-turning policy for the management of demand disruptions in rapid transit systems (Q512986) (← links)
- Regularized optimization methods for convex MINLP problems (Q518454) (← links)
- A dynamic convexized method for nonconvex mixed integer nonlinear programming (Q547132) (← links)
- Point-to-point shortest paths on dynamic time-dependent road networks (Q607878) (← links)
- Reformulations for utilizing separability when solving convex MINLP problems (Q721170) (← links)
- Convex mixed integer nonlinear programming problems and an outer approximation algorithm (Q746812) (← links)
- Mixed integer nonlinear programming tools: a practical overview (Q766256) (← links)
- Minotaur: a mixed-integer nonlinear optimization toolkit (Q823885) (← links)
- Extended ant colony optimization for non-convex mixed integer nonlinear programming (Q1013399) (← links)
- Some transformation techniques with applications in global optimization (Q1029684) (← links)
- A hybrid LP/NLP paradigm for global optimization relaxations (Q1621693) (← links)
- Trajectory planning for autonomous underwater vehicles in the presence of obstacles and a nonlinear flow field using mixed integer nonlinear programming (Q1628043) (← links)
- A global MINLP approach to symbolic regression (Q1650769) (← links)
- An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem (Q1652047) (← links)
- On solving generalized convex MINLP problems using supporting hyperplane techniques (Q1668811) (← links)
- Method for solving generalized convex nonsmooth mixed-integer nonlinear programming problems (Q1679493) (← links)
- A trajectory-based method for mixed integer nonlinear programming problems (Q1704918) (← links)
- Reformulation and convex relaxation techniques for global optimization (Q1762890) (← links)
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques (Q1863894) (← links)
- Inexact solution of NLP subproblems in MINLP (Q1942026) (← links)
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization (Q1946925) (← links)
- A finite \(\epsilon\)-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables (Q2010099) (← links)
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT (Q2124807) (← links)
- A disjunctive cut strengthening technique for convex MINLP (Q2129197) (← links)
- The supporting hyperplane optimization toolkit for convex MINLP (Q2162510) (← links)
- Relax-tighten-round algorithm for optimal placement and control of valves and chlorine boosters in water networks (Q2239916) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- Using regularization and second order information in outer approximation for convex MINLP (Q2297649) (← links)
- A decomposition method for MINLPs with Lipschitz continuous nonlinearities (Q2330657) (← links)
- Maximizing the storage capacity of gas networks: a global MINLP approach (Q2331362) (← links)
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support (Q2374364) (← links)
- Finding multiple solutions to general integer linear programs (Q2384650) (← links)
- Relaxation and decomposition methods for mixed integer nonlinear programming. (Q2386510) (← links)
- Mixed integer nonlinear programming tools: an updated practical overview (Q2393446) (← links)
- The unit commitment model with concave emissions costs: a hybrid Benders' decomposition with nonconvex master problems (Q2442095) (← links)
- A trust region SQP algorithm for mixed-integer nonlinear programming (Q2463830) (← links)
- Solving a dynamic separation problem using MINLP techniques (Q2480935) (← links)
- A sequential cutting plane algorithm for solving convex NLP problems (Q2496070) (← links)
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm (Q2506191) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- Generalized Disjunctive Programming: A Framework for Formulation and Alternative Algorithms for MINLP Optimization (Q2897295) (← links)
- Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint (Q2947228) (← links)
- Optimizing Call Center Staffing Using Simulation and Analytic Center Cutting-Plane Methods (Q3117691) (← links)
- Optimization of the Design and Partial-Load Operation of Power Plants Using Mixed-Integer Nonlinear Programming (Q3628649) (← links)
- Using projected cutting planes in the extended cutting plane method (Q5057972) (← links)
- Chapter 12: Computational results for validation of nominations (Q5740757) (← links)
- Outer-approximation algorithms for nonsmooth convex MINLP problems (Q5745165) (← links)
