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.
- Non-convex nested Benders decomposition (Q2097672) (← links)
- Empirical performance bounds for quantum approximate optimization (Q2099650) (← links)
- Hidden invariant convexity for global and conic-intersection optimality guarantees in discrete-time optimal control (Q2114579) (← links)
- Nonlinear chance-constrained problems with applications to hydro scheduling (Q2118083) (← links)
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT (Q2124807) (← links)
- Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections (Q2131141) (← links)
- Global exact optimization for covering a rectangle with 6 circles (Q2131145) (← links)
- Numerical certification of Pareto optimality for biobjective nonlinear problems (Q2154462) (← links)
- Discrete dynamical system approaches for Boolean polynomial optimization (Q2161551) (← links)
- The decomposition-based outer approximation algorithm for convex mixed-integer nonlinear programming (Q2173514) (← links)
- SUSPECT: MINLP special structure detector for Pyomo (Q2182769) (← links)
- Optimality-based domain reduction for inequality-constrained NLP and MINLP problems (Q2182853) (← links)
- Distance geometry and data science (Q2192022) (← links)
- On the impact of running intersection inequalities for globally solving polynomial optimization problems (Q2195679) (← links)
- On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm (Q2200088) (← links)
- Further optimizations of CSIDH: a systematic approach to efficient strategies, permutations, and bound vectors (Q2229293) (← links)
- Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations (Q2231320) (← links)
- Detecting and solving aircraft conflicts using bilevel programming (Q2231332) (← links)
- A new framework to relax composite functions in nonlinear programs (Q2235154) (← links)
- Relax-tighten-round algorithm for optimal placement and control of valves and chlorine boosters in water networks (Q2239916) (← links)
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (Q2250093) (← links)
- Models and solution techniques for production planning problems with increasing byproducts (Q2250099) (← links)
- Aircraft deconfliction with speed regulation: new models from mixed-integer optimization (Q2250106) (← links)
- A note on convex reformulation schemes for mixed integer quadratic programs (Q2251547) (← links)
- An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs (Q2274851) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- A branch-and-cut algorithm for mixed-integer bilinear programming (Q2282539) (← links)
- New SOCP relaxation and branching rule for bipartite bilinear programs (Q2331354) (← links)
- Global optimality bounds for the placement of control valves in water supply networks (Q2331359) (← links)
- Kuznetsov independence for interval-valued expectations and sets of probability distributions: properties and algorithms (Q2353979) (← links)
- Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints (Q2355020) (← links)
- Optimization and sustainable development (Q2355714) (← links)
- Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production (Q2357214) (← links)
- Deterministic global optimization of binary hybrid distillation/melt-crystallization processes based on relaxed MINLP formulations (Q2357903) (← links)
- Linear transformation based solution methods for non-convex mixed integer quadratic programs (Q2359405) (← links)
- Three ideas for a feasibility pump for nonconvex MINLP (Q2361121) (← links)
- On handling indicator constraints in mixed integer programming (Q2374361) (← links)
- A general framework for convexity analysis in deterministic global optimization (Q2392103) (← links)
- Large-scale standard pooling problems with constrained pools and fixed demands (Q2392105) (← links)
- Bound reduction using pairs of linear inequalities (Q2392123) (← links)
- Deterministic global optimization in ab-initio quantum chemistry (Q2392771) (← links)
- Mixed integer nonlinear programming tools: an updated practical overview (Q2393446) (← links)
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
- A Lagrangian propagator for artificial neural networks in constraint programming (Q2398510) (← links)
- Constrained global optimization for wine blending (Q2398517) (← links)
- A mathematical programming formulation for the Hartree-Fock problem on open-shell systems (Q2414124) (← links)
- Error bounds for monomial convexification in polynomial optimization (Q2414910) (← links)
- SDP-based branch-and-bound for non-convex quadratic integer optimization (Q2416574) (← links)
- A partial outer convexification approach to control transmission lines (Q2419514) (← links)
- Graph-based algorithms for the efficient solution of optimization problems involving monotone functions (Q2419542) (← links)
