A polyhedral study of nonconvex quadratic programs with box constraints (Q1774169): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q163009
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-004-0549-0 / rank
Normal rank
 
Property / author
 
Property / author: Nemhauser, George I. / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-004-0549-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2029423538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A barrier function method for the nonconvex quadratic programming problem with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the Complementarity Knapsack Polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral study of the cardinality constrained knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a quadratic formulation for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4697332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean quadratic polytope: Some characteristics, facets and relatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5670441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral approach for nonconvex quadratic programming problems with box constraints / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-004-0549-0 / rank
 
Normal rank

Latest revision as of 10:28, 11 December 2024

scientific article
Language Label Description Also known as
English
A polyhedral study of nonconvex quadratic programs with box constraints
scientific article

    Statements

    Identifiers