Pages that link to "Item:Q1201905"
From MaRDI portal
The following pages link to A new reformulation-linearization technique for bilinear programming problems (Q1201905):
Displaying 50 items.
- Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems (Q280099) (← links)
- Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO (Q322958) (← links)
- GLOMIQO: global mixed-integer quadratic optimizer (Q367170) (← links)
- An FPTAS for optimizing a class of low-rank functions over a polytope (Q378129) (← links)
- Global optimization of bilinear programs with a multiparametric disaggregation technique (Q386453) (← links)
- A framework for globally optimizing mixed-integer signomial programs (Q398656) (← links)
- Long term scheduling technique for wastewater minimisation in multipurpose batch processes (Q438031) (← links)
- Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques (Q506439) (← links)
- New multi-commodity flow formulations for the pooling problem (Q524906) (← links)
- On interval-subgradient and no-good cuts (Q613320) (← links)
- Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks (Q628648) (← links)
- Tractable stochastic analysis in high dimensions via robust optimization (Q715242) (← links)
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms (Q857806) (← links)
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures (Q933795) (← links)
- Exact \(L_{2}\)-norm plane separation (Q941041) (← links)
- Reformulation in mathematical programming: An application to quantum chemistry (Q1025997) (← links)
- A new Lagrangean approach to the pooling problem (Q1037357) (← links)
- Exact and heuristic solutions of the global supply chain problem with transfer pricing (Q1041020) (← links)
- Reduction of indefinite quadratic programs to bilinear programs (Q1187369) (← links)
- Process planning in a fuzzy environment (Q1278081) (← links)
- A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem (Q1327241) (← links)
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems (Q1329799) (← links)
- Branch-and-bound decomposition approach for solving quasiconvex-concave programs (Q1333350) (← links)
- Petroleum refinery optimization (Q1642991) (← links)
- Canonical duality for box constrained nonconvex and nonsmooth optimization problems (Q1665441) (← links)
- Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness (Q1668789) (← links)
- A branch-and-bound algorithm for instrumental variable quantile regression (Q1697970) (← links)
- A new two-level linear relaxed bound method for geometric programming problems (Q1774846) (← links)
- Convex envelopes for edge-concave functions (Q1780948) (← links)
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs (Q1780950) (← links)
- On the finite convergence of successive SDP relaxation methods (Q1848385) (← links)
- The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal (Q1881682) (← links)
- A global optimization algorithm for linear fractional and bilinear programs (Q1890945) (← links)
- Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions (Q1892595) (← links)
- A reformulation-convexification approach for solving nonconvex quadratic programming problems (Q1905961) (← links)
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems (Q1913605) (← links)
- A branch-and-reduce approach to global optimization (Q1924068) (← links)
- Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations (Q1925777) (← links)
- Decomposition strategy for the stochastic pooling problem (Q1928271) (← links)
- Solving mixed-integer nonlinear optimization problems using simultaneous convexification: a case study for gas networks (Q2045011) (← links)
- Convex hull representations for bounded products of variables (Q2046306) (← links)
- Discretization and global optimization for mixed integer bilinear programming (Q2089882) (← links)
- AC optimal power flow: a conic programming relaxation and an iterative MILP scheme for global optimization (Q2095185) (← links)
- Collaborative vehicle-drone distribution network optimization for perishable products in the epidemic situation (Q2108129) (← links)
- Comparison of mixed-integer relaxations with linear and logarithmic partitioning schemes for quadratically constrained problems (Q2147914) (← links)
- An augmented Lagrangian based semismooth Newton method for a class of bilinear programming problems (Q2181561) (← links)
- A reducibility method for the weak linear bilevel programming problems and a case study in principal-agent (Q2195296) (← links)
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems (Q2250082) (← links)
