DICOPT

swMATH4938MaRDI QIDQ17089FDOQ17089

Author name not available (Why is that?)

Cited In (38)

• Optimal design of multi-echelon supply chain networks under normally distributed demand
• Mixed integer nonlinear programming tools: a practical overview
• QPLIB: a library of quadratic programming instances
• Nonlinear and Mixed Integer Linear Programming
• An integrated multi-product, multi-buyer supply chain under penalty, green, and quality control polices and a vendor managed inventory with consignment stock agreement: the outer approximation with equality relaxation and augmented penalty algorithm
• New models for commercial territory design
• A note on solving DiDi's driver-order matching problem
• Integrated network capacity expansion and traffic signal optimization problem: Robust bi-level dynamic formulation
• Title not available (Why is that?)
• An algorithmic framework for convex mixed integer nonlinear programs
• A planar single facility location and border crossing problem
• A feasibility pump for mixed integer nonlinear programs
• Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT
• An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs
• Complete search in continuous global optimization and constraint satisfaction
• Supply capacity acquisition and allocation with uncertain customer demands
• An algorithm for nonlinear optimization problems with binary variables
• Service system design for managing interruption risks: a backup-service risk-mitigation strategy
• Pyomo.GDP: an ecosystem for logic based modeling and optimization development
• An inverse reliability-based approach for designing under uncertainty with application to robust piston design
• A mixed-integer programming approach to the clustering problem with an application in customer segmentation
• Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation
• Using regularization and second order information in outer approximation for convex MINLP
• The supporting hyperplane optimization toolkit for convex MINLP
• A disjunctive cut strengthening technique for convex MINLP
• Perspective reformulations of mixed integer nonlinear programs with indicator variables
• An efficient computational approach for railway booking problems
• SO-MI: a surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems
• An improved Bernstein global optimization algorithm for MINLP problems with application in process industry
• A local relaxation approach for the siting of electrical substations
• A fast algorithm for near cost optimal line plans
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• The extended supporting hyperplane algorithm for convex mixed-integer nonlinear programming
• Simultaneous solution strategies for inclusion of input saturation in the optimal design of dynamically operable plants
• A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs
• Deterministic global optimization with artificial neural networks embedded
• Improving the performance of DICOPT in convex MINLP problems using a feasibility pump
• Mixed integer nonlinear programming tools: an updated practical overview

This page was built for software: DICOPT