An efficient linearization technique for mixed 0-1 polynomial problem (Q611852): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1016/j.cam.2010.08.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2054597867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Linear Integer Programming Formulations of Nonlinear Integer Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Mixed Integer Programming Problems Using Automatic Reformulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization for Mixed 0-1 Programs with Convex or Separable Continuous Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linearization method for mixed 0--1 polynomial programs / rank
 
Normal rank

Latest revision as of 14:27, 3 July 2024

scientific article
Language Label Description Also known as
English
An efficient linearization technique for mixed 0-1 polynomial problem
scientific article

    Statements

    An efficient linearization technique for mixed 0-1 polynomial problem (English)
    0 references
    0 references
    14 December 2010
    0 references
    0 references
    linearization
    0 references
    nonlinear mixed 0-1
    0 references
    polynomial problem
    0 references
    0 references