The following pages link to GAMS (Q17125):
Displaying 50 items.
- Solving unit commitment problem using modified subgradient method combined with simulated annealing algorithm (Q1958814) (← links)
- Computation of equilibria in OLG models with many heterogeneous households (Q1959112) (← links)
- ConsNet -- a tabu search approach to the spatially coherent conservation area network design problem (Q1959176) (← links)
- Global solution of nonlinear mixed-integer bilevel programs (Q1959230) (← links)
- The influence of geometric effects on the behavior of strain softening frames (Q1959737) (← links)
- Applied general equilibrium modeling with MPSGE as a GAMS subsystem: An overview of the modeling framework and syntax (Q1962735) (← links)
- Programming languages in economics (Q1962742) (← links)
- On the solution of a minimum weight elastoplastic problem involving displacement and complementarity constraints (Q1965225) (← links)
- Feasible descent algorithms for mixed complementarity problems (Q1968793) (← links)
- Selecting scenarios for environmental disaster planning (Q1969856) (← links)
- Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints (Q1970426) (← links)
- Multiobjective mathematical models and solution approaches for heterogeneous fixed fleet vehicle routing problems (Q1983754) (← links)
- An adaptive model with joint chance constraints for a hybrid wind-conventional generator system (Q1989737) (← links)
- An MPEC formulation and its cutting constraint algorithm for continuous network design problem with multi-user classes (Q1994496) (← links)
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs (Q2010085) (← links)
- Valid inequalities for the topology optimization problem in gas network design (Q2011829) (← links)
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems (Q2016277) (← links)
- Encoding binary arithmetic operations in integer programming formulations (Q2016465) (← links)
- Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
- Approximate and exact optimal designs for \(2^k\) factorial experiments for generalized linear models via second order cone programming (Q2029231) (← links)
- Combining multiple criteria analysis, mathematical programming and Monte Carlo simulation to tackle uncertainty in research and development project portfolio selection: a case study from Greece (Q2030737) (← links)
- Nonconvex constrained optimization by a filtering branch and bound (Q2038915) (← links)
- Lagrangian relaxation based heuristics for a chance-constrained optimization model of a hybrid solar-battery storage system (Q2046320) (← links)
- Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem (Q2070127) (← links)
- Multicriteria decision support for the evaluation of electricity supply resilience: exploration of interacting criteria (Q2076838) (← links)
- Optimal designs for dose-escalation trials and individual allocations in cohorts (Q2084331) (← links)
- Discretization and global optimization for mixed integer bilinear programming (Q2089882) (← links)
- Economic growth and inequality tradeoffs under progressive taxation (Q2098010) (← links)
- Exploring the tradeoffs among forest planning, roads and wildlife corridors: a new approach (Q2119732) (← links)
- Optimal multi-state partnerships for woody biomass co-firing incorporating a demand-response function for biomass procurement (Q2119738) (← links)
- Short-term steady-state production optimization of offshore oil platforms: wells with dual completion (gas-lift and ESP) and flow assurance (Q2121619) (← links)
- Polyhedral approximation strategies for nonconvex mixed-integer nonlinear programming in SHOT (Q2124807) (← links)
- Pyomo.GDP: an ecosystem for logic based modeling and optimization development (Q2138322) (← links)
- Flexible here-and-now decisions for two-stage multi-objective optimization: method and application to energy system design selection (Q2139143) (← links)
- Using inverse optimization to learn cost functions in generalized Nash games (Q2146979) (← links)
- Spatio-temporal efficiency measurement under undesirable outputs using multi-objective programming: a GAMS representation (Q2150775) (← links)
- The supporting hyperplane optimization toolkit for convex MINLP (Q2162510) (← links)
- Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables (Q2168050) (← links)
- Modeling and optimizing an agro-supply chain considering different quality grades and storage systems for fresh products: a Benders decomposition solution approach (Q2168710) (← links)
- New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm (Q2176276) (← links)
- Enhancing Benders decomposition algorithm to solve a combat logistics problem (Q2178915) (← links)
- Optimal crop allocation including market trends and water availability (Q2183884) (← links)
- Optimizing the selection and scheduling of multi-class projects using a Stackelberg framework (Q2184142) (← links)
- Developing an integrated decision making model in supply chain under demand uncertainty using genetic algorithm and network data envelopment analysis (Q2205020) (← links)
- A game-theoretic optimisation approach to fair customer allocation in oligopolies (Q2218902) (← links)
- Particle swarm optimization for computing Nash and Stackelberg equilibria in energy markets (Q2226473) (← links)
- Solving data envelopment analysis models with sum-of-fractional objectives: a global optimal approach based on the multiparametric disaggregation technique (Q2241566) (← links)
- The weighted intruder path covering problem (Q2242227) (← links)
- Goal programming model applied to waste paper logistics processes (Q2247344) (← links)
- Solution approaches for solving the log transportation problem (Q2247392) (← links)
