Petroleum supply planning: reformulations and a novel decomposition algorithm
From MaRDI portal
Publication:2358145
DOI10.1007/s11081-017-9349-2zbMath1364.90416OpenAlexW2587787968MaRDI QIDQ2358145
Ignacio E. Grossmann, Roger Rocha, Marcus V. Poggi de Aragão
Publication date: 21 June 2017
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-017-9349-2
mixed integer programmingdisjunctive programmingreformulationsdecomposition algorithmpetroleum supply planning
Related Items
A solution framework for the integrated periodic supply vessel planning and port scheduling in oil and gas supply logistics, A solution framework for the integrated periodic supply vessel planning and port scheduling in oil and gas supply logistics
Cites Work
- Unnamed Item
- Decomposition in general mathematical programming
- Disjunctive programming: Properties of the convex hull of feasible points
- Logic-based Benders decomposition
- Local branching
- Cascading knapsack inequalities: reformulation of a crude oil distribution problem
- Repairing MIP infeasibility through local branching
- Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- On the virtual convexity of the domain and range of a nonlinear maximal monotone operator
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Planning and Scheduling by Logic-Based Benders Decomposition
- A resource decomposition algorithm for general mathematical programs
- An elementary survey of general duality theory in mathematical programming
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Canonical Cuts on the Unit Hypercube
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems