Pages that link to "Item:Q1968795"
From MaRDI portal
The following pages link to A branch-and-cut method for 0-1 mixed convex programming (Q1968795):
Displaying 50 items.
- Tightening methods based on nontrivial bounds on bilinear terms (Q2168621) (← links)
- An overview of MINLP algorithms and their implementation in Muriqui optimizer (Q2178345) (← links)
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function (Q2181606) (← links)
- SUSPECT: MINLP special structure detector for Pyomo (Q2182769) (← links)
- Mathematical programming formulations for piecewise polynomial functions (Q2182855) (← links)
- On the facet defining inequalities of the mixed-integer bilinear covering set (Q2216198) (← links)
- On valid inequalities for mixed integer \(p\)-order cone programming (Q2251546) (← links)
- Solving nonlinear constrained optimization problems: an immune evolutionary based two-phase approach (Q2282675) (← links)
- On pathological disjunctions and redundant disjunctive conic cuts (Q2294223) (← links)
- Small and strong formulations for unions of convex sets from the Cayley embedding (Q2316612) (← links)
- Symmetry-exploiting cuts for a class of mixed-\(0/1\) second-order cone programs (Q2339823) (← links)
- A geometric approach to cut-generating functions (Q2349120) (← links)
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality (Q2364498) (← links)
- Finding multiple solutions to general integer linear programs (Q2384650) (← links)
- A partial outer convexification approach to control transmission lines (Q2419514) (← links)
- Finding multiple optimal solutions of signomial discrete programming problems with free variables (Q2443364) (← links)
- Perspective cuts for a class of convex 0-1 mixed integer programs (Q2490334) (← links)
- Exact solutions to a class of stochastic generalized assignment problems (Q2496071) (← links)
- Cuts for mixed 0-1 conic programming (Q2571004) (← links)
- Perspective reformulations of mixed integer nonlinear programs with indicator variables (Q2638370) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations (Q2638381) (← links)
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets (Q2638385) (← links)
- An outer approximation based branch and cut algorithm for convex 0-1 MINLP problems (Q2774597) (← links)
- On minimal valid inequalities for mixed integer conic programs (Q2806815) (← links)
- Mixed integer nonlinear programs featuring ``on/off'' constraints: convex analysis and applications (Q2861546) (← links)
- Cutting-planes for weakly-coupled \(0/1\) second order cone programs (Q2883643) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- Subgradient Based Outer Approximation for Mixed Integer Second Order Cone Programming (Q2897293) (← links)
- Perspective Reformulation and Applications (Q2897294) (← links)
- Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← links)
- Lift-and-Project Cuts for Mixed Integer Convex Programs (Q3009750) (← links)
- Cutting Plane Algorithm for Convex Generalized Disjunctive Programs (Q3186647) (← links)
- Convex Relaxations for Quadratic On/Off Constraints and Applications to Optimal Transmission Switching (Q3386791) (← links)
- Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints (Q3454970) (← links)
- A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization (Q3462302) (← links)
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables (Q3503836) (← links)
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut (Q4025902) (← links)
- (Q4414642) (← links)
- A general system for heuristic minimization of convex functions over non-convex sets (Q4638917) (← links)
- Genomic feature selection by coverage design optimization (Q5036376) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
- Mixed-Integer Convex Representability (Q5076722) (← links)
- Submodularity in Conic Quadratic Mixed 0–1 Optimization (Q5131480) (← links)
- Smoothing and Regularization for Mixed-Integer Second-Order Cone Programming with Applications in Portfolio Optimization (Q5172959) (← links)
- A simple effective heuristic for embedded mixed-integer quadratic programming (Q5207801) (← links)
- Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations (Q5857295) (← links)
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (Q5962729) (← links)
- Disjunctive cuts in mixed-integer conic optimization (Q6038657) (← links)
- A new perspective on low-rank optimization (Q6052053) (← links)
- Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective (Q6057717) (← links)
