Analysis of MILP Techniques for the Pooling Problem (Q3453340): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Santanu S. Dey / rank
Normal rank
 
Property / author
 
Property / author: Santanu S. Dey / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: APOGEE / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: XPRESS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059271569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of Discrete and Continuous Models for the Pooling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cost minimization heuristic for the pooling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong formulations for the pooling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pooling Problem: Alternate Formulations and Solution Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Successive Linear Programming at Exxon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization by reducing the duality gap / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid Inequalities for the Pooling Problem with Binary Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxations and discretizations for the pooling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:29, 11 July 2024

scientific article
Language Label Description Also known as
English
Analysis of MILP Techniques for the Pooling Problem
scientific article

    Statements

    Identifiers