Pages that link to "Item:Q857798"

The following pages link to A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints (Q857798):

Displaying 16 items.

• Sufficiency of cut-generating functions (Q494318) (← links)
• How to convexify the intersection of a second order cone and a nonconvex quadratic (Q517311) (← links)
• Two-term disjunctions on the second-order cone (Q896297) (← links)
• Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
• Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints (Q1728353) (← links)
• Algorithms for linear programming with linear complementarity constraints (Q1935876) (← links)
• Optimal cycle for a signalized intersection using global optimization and complementarity (Q1939107) (← links)
• SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs (Q2164703) (← links)
• Cutting planes from two-term disjunctions (Q2450685) (← links)
• The eigenvalue complementarity problem (Q2643627) (← links)
• On Minimal Valid Inequalities for Mixed Integer Conic Programs (Q2806815) (← links)
• A pivoting algorithm for linear programming with linear complementarity constraints (Q2885465) (← links)
• Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← 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)
• On solving difference of convex functions programs with linear complementarity constraints (Q6166653) (← links)