Pages that link to "Item:Q4637830"

The following pages link to Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (Q4637830):

Displaying 23 items.

• BARON (Q12838) (← links)
• Branch-and-price for a class of nonconvex mixed-integer nonlinear programs (Q2052398) (← links)
• SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs (Q2097634) (← links)
• Non-convex nested Benders decomposition (Q2097672) (← links)
• Linearization and parallelization schemes for convex mixed-integer nonlinear optimization (Q2114818) (← links)
• Sample average approximation for stochastic nonconvex mixed integer nonlinear programming via outer-approximation (Q2129194) (← links)
• Pyomo.GDP: an ecosystem for logic based modeling and optimization development (Q2138322) (← links)
• Stable honeycomb structures and temperature based trajectory optimization for wire-arc additive manufacturing (Q2139148) (← links)
• A solution method for heterogeneity involving present bias (Q2218886) (← links)
• Global optimality bounds for the placement of control valves in water supply networks (Q2331359) (← links)
• Conflict Analysis for MINLP (Q4995080) (← links)
• Optimal Switching Sequence for Switched Linear Systems (Q5111065) (← links)
• Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs (Q5148407) (← links)
• COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS (Q5880744) (← links)
• The profit-oriented hub line location problem with elastic demand (Q6047874) (← links)
• Proportional packing of circles in a circular container (Q6160555) (← links)
• Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints (Q6166654) (← links)
• Comparison of MINLP formulations for global superstructure optimization (Q6173771) (← links)
• Packing spheres with quasi-containment conditions (Q6631568) (← links)
• Fast heuristics for the time-constrained immobile server problem (Q6659813) (← links)
• Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints (Q6661703) (← links)
• Generalized Nash equilibrium problems with mixed-integer variables (Q6665384) (← links)
• A new branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation (Q6667698) (← links)