Pages that link to "Item:Q3396388"
From MaRDI portal
The following pages link to Branching and bounds tighteningtechniques for non-convex MINLP (Q3396388):
Displaying 50 items.
- Facets of a mixed-integer bilinear covering set with bounds on variables (Q2423814) (← links)
- Valid constraints for the Point Packing in a Square problem (Q2446880) (← links)
- On the Weber facility location problem with limited distances and side constraints (Q2448124) (← links)
- A locally optimal hierarchical divisive heuristic for bipartite modularity maximization (Q2448169) (← links)
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP (Q2452383) (← links)
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets (Q2638385) (← links)
- A mixed integer linear programming support vector machine for cost-effective group feature selection: branch-cut-and-price approach (Q2670542) (← links)
- \texttt{EXPEDIS}: an exact penalty method over discrete sets (Q2673244) (← links)
- Computational advances in polynomial optimization: RAPOSa, a freely available global solver (Q2689854) (← links)
- Preemptive uniprocessor scheduling of mixed-criticality sporadic task systems (Q2796402) (← links)
- Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming (Q2810112) (← links)
- Static analysis by abstract interpretation: a mathematical programming approach (Q2814107) (← links)
- Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations (Q2826815) (← links)
- An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space (Q2827758) (← links)
- Computing all solutions of Nash equilibrium problems with discrete strategy sets (Q2828338) (← links)
- Solving chance-constrained optimization problems with stochastic quadratic inequalities (Q2830767) (← links)
- Formulation symmetries in circle packing (Q2861569) (← links)
- Mathematical programming based debugging (Q2861570) (← links)
- Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← links)
- Symmetry in Mathematical Programming (Q2897300) (← links)
- An Algorithmic Framework for MINLP with Separable Non-Convexity (Q2897302) (← links)
- Exact and approximation algorithms for a soft rectangle packing problem (Q2926482) (← links)
- A Decomposition-Based Heuristic for Collaborative Scheduling in a Network of Open-Pit Mines (Q2940058) (← links)
- Validation of nominations in gas network optimization: models, methods, and solutions (Q2943808) (← links)
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (Q2943816) (← links)
- Molecular distance geometry methods: from continuous to discrete (Q3087839) (← links)
- Multi-Tree Decomposition Methods for Large-Scale Mixed Integer Nonlinear Optimization (Q3296380) (← links)
- Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints (Q3454970) (← links)
- Computing in Operations Research Using Julia (Q3466770) (← links)
- Improving the Betweenness Centrality of a Node by Adding Links (Q4555544) (← links)
- More Virtuous Smoothing (Q4634104) (← links)
- Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (Q4637830) (← links)
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework (Q4637831) (← links)
- Global solution of non-convex quadratically constrained quadratic programs (Q4646675) (← links)
- The travelling salesman problem with neighbourhoods: MINLP solution (Q4924121) (← links)
- Conflict Analysis for MINLP (Q4995080) (← links)
- MPEC Methods for Bilevel Optimization Problems (Q5014634) (← links)
- EAGO.jl: easy advanced global optimization in Julia (Q5038425) (← links)
- Experiments with hybrid Bernstein global optimization algorithm for the OPF problem in power systems (Q5059211) (← links)
- The equilateral small octagon of maximal width (Q5082045) (← links)
- Tractable Relaxations of Composite Functions (Q5085133) (← links)
- Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded (Q5085481) (← links)
- Variable Bound Tightening and Valid Constraints for Multiperiod Blending (Q5106407) (← links)
- Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms (Q5110560) (← links)
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques (Q5139846) (← links)
- On the Composition of Convex Envelopes for Quadrilinear Terms (Q5244679) (← links)
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs (Q5746688) (← links)
- COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS (Q5880744) (← links)
- Global optimization (Q5896995) (← links)
- Mathematical programming formulations for the alternating current optimal power flow problem (Q5918268) (← links)
