Pages that link to "Item:Q5704071"
From MaRDI portal
The following pages link to Facets of the Complementarity Knapsack Polytope (Q5704071):
Displaying 19 items.
- Alternative formulations for the set packing problem and their application to the winner determination problem (Q367639) (← links)
- Branch-and-cut for complementarity-constrained optimization (Q482112) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- Box-constrained quadratic programs with fixed charge variables (Q933786) (← links)
- On the facets of the mixed-integer knapsack polyhedron (Q1424283) (← links)
- Models for representing piecewise linear cost functions (Q1433660) (← links)
- A concise characterization of strong knapsack facets (Q1634771) (← links)
- Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
- A polyhedral study of nonconvex quadratic programs with box constraints (Q1774169) (← links)
- Convexification techniques for linear complementarity constraints (Q2045009) (← links)
- A polyhedral study of the semi-continuous knapsack problem (Q2434996) (← links)
- Convexification Techniques for Linear Complementarity Constraints (Q3009774) (← links)
- Easily Computable Facets of the Knapsack Polytope (Q3032082) (← links)
- Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints (Q3454970) (← links)
- Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1 (Q5479831) (← links)
- New classes of facets for complementarity knapsack problems (Q6585265) (← links)
- Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)
- Relaxations and cutting planes for linear programs with complementarity constraints (Q6607018) (← links)
