The following pages link to Ignacio E. Grossmann (Q168291):
Displaying 50 items.
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems (Q291046) (← links)
- Supplier selection in the processed food industry under uncertainty (Q322981) (← links)
- Lagrangean relaxation of the hull-reformulation of linear generalized disjunctive programs and its use in disjunctive branch and bound (Q323168) (← links)
- Accelerating Benders stochastic decomposition for the optimization under uncertainty of the petroleum product supply chain (Q342011) (← links)
- Global optimization of bilinear programs with a multiparametric disaggregation technique (Q386453) (← links)
- (Q421707) (redirect page) (← links)
- A hierarchy of relaxations for linear generalized disjunctive programming (Q421708) (← links)
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming (Q439452) (← links)
- Global optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques (Q506439) (← links)
- A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles (Q614066) (← links)
- Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks (Q628648) (← links)
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
- A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures (Q933795) (← links)
- An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
- Assignment and sequencing models for the scheduling of process systems (Q1265906) (← links)
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms (Q1304752) (← links)
- Logic cuts for processing networks with fixed charges (Q1317071) (← links)
- Generalized convex disjunctive programming: Nonlinear convex hull relaxation (Q1410241) (← links)
- Multiscale production routing in multicommodity supply chains with complex production facilities (Q1652168) (← links)
- Deterministic electric power infrastructure planning: mixed-integer programming model and nested decomposition algorithm (Q1653389) (← links)
- Global optimization algorithm for capacitated multi-facility continuous location-allocation problems (Q1668802) (← links)
- Capacity planning with competitive decision-makers: trilevel MILP formulation, degeneracy, and solution approaches (Q1683064) (← links)
- Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem (Q1686525) (← links)
- Review of nonlinear mixed-integer and disjunctive programming techniques (Q1863893) (← links)
- A global optimization algorithm for linear fractional and bilinear programs (Q1890945) (← links)
- Discrete and continuous-time formulations for dealing with break periods: preemptive and non-preemptive scheduling (Q1999390) (← links)
- Alternative regularizations for outer-approximation algorithms for convex MINLP (Q2089881) (← links)
- A computationally useful algebraic representation of nonlinear disjunctive convex sets using the perspective function (Q2181606) (← links)
- Electric power infrastructure planning under uncertainty: stochastic dual dynamic integer programming (SDDiP) and parallelization scheme (Q2218888) (← links)
- Hierarchical decompositions for MPC of resource constrained control systems: applications to building energy management (Q2245685) (← links)
- Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems (Q2250082) (← links)
- Using regularization and second order information in outer approximation for convex MINLP (Q2297649) (← links)
- Multiperiod optimization model for oilfield production planning: bicriterion optimization and two-stage stochastic programming model (Q2302375) (← links)
- Data-driven construction of convex region surrogate models (Q2358021) (← links)
- Petroleum supply planning: reformulations and a novel decomposition algorithm (Q2358145) (← links)
- Symbolic integration of logic in MILP branch and bound methods for the synthesis of process networks (Q2368099) (← links)
- Computational strategies for non-convex multistage MINLP models with decision-dependent uncertainty and~gradual uncertainty resolution (Q2393472) (← links)
- Cascading knapsack inequalities: reformulation of a crude oil distribution problem (Q2393477) (← links)
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
- Multicut Benders decomposition algorithm for process supply chain planning under uncertainty (Q2442082) (← links)
- A class of stochastic programs with decision dependent uncertainty (Q2502206) (← links)
- Search for reaction pathways with P-graphs and reaction blocks: methanation of carbon dioxide with hydrogen (Q2636415) (← links)
- Algorithms for hybrid MILP/CP models for a class of optimization problems (Q2884510) (← links)
- Generalized Disjunctive Programming: A Framework for Formulation and Alternative Algorithms for MINLP Optimization (Q2897295) (← links)
- Generalized Disjunctive Programming: Solution Strategies (Q2917384) (← links)
- Algorithmic Approach for Improved Mixed-Integer Reformulations of Convex Generalized Disjunctive Programs (Q2942683) (← links)
- A strategy for predictive control of a mixed continuous batch process (Q3055619) (← links)
- Decomposition Techniques for Hybrid MILP/CP Models applied to Scheduling and Routing Problems (Q3064561) (← links)
- Cutting Plane Algorithm for Convex Generalized Disjunctive Programs (Q3186647) (← links)
- Tightening the Linear Relaxation of a Mixed Integer Nonlinear Program Using Constraint Programming (Q3630163) (← links)
