Pages that link to "Item:Q1318452"

The following pages link to An improved branch and bound algorithm for mixed integer nonlinear programs (Q1318452):

Displaying 46 items.

• An algorithm for two-stage stochastic mixed-integer nonlinear convex problems (Q256673) (← links)
• A hierarchy of relaxations for nonlinear convex generalized disjunctive programming (Q439452) (← links)
• Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming (Q486413) (← links)
• Optimization methods for mixed integer weakly concave programming problems (Q489113) (← links)
• A dynamic convexized method for nonconvex mixed integer nonlinear programming (Q547132) (← links)
• Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
• A heuristic for the label printing problem (Q875404) (← links)
• The stochastic trim-loss problem (Q1011257) (← links)
• Global optimization of signomial mixed-integer nonlinear programming problems with free variables (Q1024826) (← links)
• SICOpt: Solution approach for nonlinear integer stochastic programming problems (Q1039361) (← links)
• A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs (Q1370656) (← links)
• Heuristics for cardinality constrained portfolio optimization (Q1582684) (← links)
• Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization (Q1639718) (← links)
• On linear programming relaxations for solving polynomial programming problems (Q1654348) (← links)
• Extended formulations in mixed integer conic quadratic programming (Q1688453) (← links)
• Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
• Mixed integer programming with a class of nonlinear convex constraints (Q1751218) (← links)
• Mixed integer programming for a special logic constrained optimal control problem (Q1780957) (← links)
• Executing join queries in an uncertain distributed environment (Q1900302) (← links)
• Allocating relations in a distributed database system (Q1903394) (← links)
• A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization (Q1946925) (← links)
• A review of deterministic optimization methods in engineering and management (Q1955154) (← links)
• Partially distributed outer approximation (Q2046262) (← links)
• Asynchronous optimization of part logistics routing problem (Q2124805) (← links)
• An overview of MINLP algorithms and their implementation in Muriqui optimizer (Q2178345) (← links)
• Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation (Q2250087) (← links)
• Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra (Q2281450) (← links)
• Solving nonlinear constrained optimization problems: an immune evolutionary based two-phase approach (Q2282675) (← links)
• A decomposition method for MINLPs with Lipschitz continuous nonlinearities (Q2330657) (← links)
• Exact optimal experimental designs with constraints (Q2361462) (← links)
• Finding multiple solutions to general integer linear programs (Q2384650) (← links)
• A penalty-interior-point algorithm for nonlinear constrained optimization (Q2392661) (← links)
• A new method for mean-variance portfolio optimization with cardinality constraints (Q2393351) (← links)
• A simplex grey wolf optimizer for solving integer programming and minimax problems (Q2402871) (← links)
• An iterative method for solving a bi-objective constrained portfolio optimization problem (Q2419517) (← links)
• Finding multiple optimal solutions of signomial discrete programming problems with free variables (Q2443364) (← links)
• Hierarchical maximal-coverage location-allocation: case of generalized search-and-rescue (Q2462536) (← links)
• A trust region SQP algorithm for mixed-integer nonlinear programming (Q2463830) (← links)
• Solving convex MINLP optimization problems using a sequential cutting plane algorithm (Q2506191) (← links)
• Perspective reformulations of mixed integer nonlinear programs with indicator variables (Q2638370) (← links)
• Two linear approximation algorithms for convex mixed integer nonlinear programming (Q2675735) (← links)
• Tight Upper Bounds on the Cardinality Constrained Mean-Variance Portfolio Optimization Problem Using Truncated Eigendecomposition (Q2806963) (← links)
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
• Perspective Reformulation and Applications (Q2897294) (← links)
• Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables (Q3503836) (← links)
• Direct Gravitational Search Algorithm for Global Optimisation Problems (Q5372051) (← links)