Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing
type: Item
instance of: scholarly article
title: Mixed-integer linear optimization for optimal lift-gas allocation with well-separator routing
zbMATH Open document ID: 1244.90263
author: Andrés Codas
author: Eduardo Camponogara
published in: European Journal of Operational Research
publication date: 2012-08-16T00:00:00Z
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6066776
zbMATH Keywords: integer programming
zbMATH Keywords: piecewise linearization
zbMATH Keywords: lifted cover cuts
zbMATH Keywords: lift-gas allocation
zbMATH Keywords: routing constraints
MaRDI profile type: Publication
full work available at URL: j.ejor.2011.08.027
OpenAlex ID: W2065477338
cites work: Facets of the knapsack polytope
cites work: Facets of the Knapsack Polytope From Minimal Covers
cites work: Solving a gas-lift optimization problem by dynamic programming
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: Surrogate Constraints
cites work: Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem
cites work: Models for representing piecewise linear cost functions
cites work: Piecewise-linear approximations of multidimensional functions
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
cites work: Approximating separable nonlinear functions via mixed zero-one programs
cites work: On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions
cites work: Reformulation and Decomposition of Integer Programs
cites work: Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
DOI: 10.1016/J.EJOR.2011.08.027
description: scientific article; zbMATH DE number 6066776