Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing (Q439361): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C90 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C11 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6066776 / rank
 
Normal rank
Property / zbMATH Keywords
 
integer programming
Property / zbMATH Keywords: integer programming / rank
 
Normal rank
Property / zbMATH Keywords
 
piecewise linearization
Property / zbMATH Keywords: piecewise linearization / rank
 
Normal rank
Property / zbMATH Keywords
 
lifted cover cuts
Property / zbMATH Keywords: lifted cover cuts / rank
 
Normal rank
Property / zbMATH Keywords
 
lift-gas allocation
Property / zbMATH Keywords: lift-gas allocation / rank
 
Normal rank
Property / zbMATH Keywords
 
routing constraints
Property / zbMATH Keywords: routing constraints / 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.1016/j.ejor.2011.08.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2065477338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the Knapsack Polytope From Minimal Covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a gas-lift optimization problem by dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing / 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: Surrogate Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models for representing piecewise linear cost functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Piecewise-linear approximations of multidimensional functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating separable nonlinear functions via mixed zero-one programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulation and Decomposition of Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:12, 5 July 2024

scientific article
Language Label Description Also known as
English
Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing
scientific article

    Statements

    Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing (English)
    0 references
    0 references
    0 references
    16 August 2012
    0 references
    integer programming
    0 references
    piecewise linearization
    0 references
    lifted cover cuts
    0 references
    lift-gas allocation
    0 references
    routing constraints
    0 references

    Identifiers