AMPL

swMATH4001WikidataQ295250 ScholiaQ295250MaRDI QIDQ16191FDOQ16191

Author name not available (Why is that?)

Official website: http://www.ampl.com/solvers.html

Cited In (only showing first 100 items - show all)

• Efficient formulations for pricing under attraction demand models
• Self-adaptive support vector machines: modelling and experiments
• Multi-item capacitated lot-sizing with demand uncertainty
• Minimum-distance controlled perturbation methods for large-scale tabular data protection
• A pathsearch damped Newton method for computing general equilibria
• Modifications of the two-stage transportation problem and their applications
• A variable neighborhood decomposition search method for supply chain management planning problems
• A stochastic programming model for asset liability management of a Finnish pension company
• A pivoting algorithm for linear programming with linear complementarity constraints
• Dynamic facility location: The progressive p-median problem
• Title not available (Why is that?)
• Likelihood estimation of consumer preferences in choice-based conjoint analysis
• Communication protocols for options and results in a distributed optimization environment
• An algorithm for moment-matching scenario generation with application to financial portfolio optimisation
• Mailing Decisions in the Catalog Sales Industry
• Optimal control for selected cancer chemotherapy ODE models: a view on the potential of optimal schedules and choice of objective function
• Title not available (Why is that?)
• Real options valuation of forest plantation investments in Brazil
• Optimal deployment of alternative fueling stations on transportation networks considering deviation paths
• A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\)
• Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems
• Free material optimization for stress constraints
• A sliding time window heuristic for open pit mine block sequencing
• A nonmonotone filter method for nonlinear optimization
• The travelling salesman problem with neighbourhoods: MINLP solution
• Packing ellipsoids by nonlinear optimization
• A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings
• Multi-stage optimization for periodic inspection planning of geo-distributed infrastructure systems
• Scheduling pumpoff operations in onshore oilfields under electric-power constraints
• A generalized model for locating facilities on a network with flow-based demand
• On the optimal design of water distribution networks: a practical MINLP approach
• The design of the zinc modelling language
• Title not available (Why is that?)
• A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets
• Aggregation without loss of optimality in competitive location models
• Dynamics and optimal control of chemotherapy for low grade gliomas: insights from a mathematical model
• Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
• Lower bounding procedure for the asymmetric quadratic traveling salesman problem
• A recipe for finding good solutions to MINLPs
• A framework for globally optimizing mixed-integer signomial programs
• Strategic production-distribution models: A critical review with emphasis on global supply chain models
• A stochastic programming model for the thermal optimal day-ahead bid problem with physical futures contracts
• Tailored Lagrangian relaxation for the open pit block sequencing problem
• Local controllability and optimal control for a model of combined anticancer therapy with control delays
• On application of optimal control to SEIR normalized models: pros and cons
• Optimal control of a tuberculosis model with state and control delays
• A decision support tool for generating shipping data for the Hunter Valley coal chain
• Model-based automatic neighborhood design by unsupervised learning
• Single machine scheduling with interfering job sets
• Robust delay-constrained routing in telecommunications
• A comparison of complete global optimization solvers
• Inexact restoration and adaptive mesh refinement for optimal control
• Assessing the potential of interior point barrier filter line search methods: nonmonotone versus monotone approach
• Reformulations in mathematical programming: automatic symmetry detection and exploitation
• An integer programming model for optimal pork marketing
• Containment results for ideals of various configurations of points in \(\mathbb P^N\)
• The performance of stochastic dynamic and fixed mix portfolio models
• Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder
• Efficiently packing unequal disks in a circle
• Efficiency bounds in data envelopment analysis
• Scheduling parallel-machine batch operations to maximize on-time delivery performance
• Model development and optimization for space engineering: concepts, tools, applications, and perspectives
• A hybrid heuristic algorithm for the open-pit-mining operational planning problem
• Portfolio choice models based on second-order stochastic dominance measures: an overview and a computational study
• HMM based scenario generation for an investment optimisation problem
• The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations
• Benchmarking global optimization and constraint satisfaction codes
• The reformulation-optimization software engine
• Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
• Elementary optimality conditions for nonlinear SDPs
• Column generation extensions of set covering greedy heuristics
• Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching
• A nonlinear optimization methodology for VLSI fixed-outline floorplanning
• Solution approaches for the soft drink integrated production lot sizing and scheduling problem
• Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants
• SLP-IOR: An interactive model management system for stochastic linear programs
• The design of reverse distribution networks: Models and solution procedures
• Writing global optimization software
• OSiL: An instance language for optimization
• Estimation methods for choice-based conjoint analysis of consumer preferences
• Bounds for probabilistic integer programming problems
• A linear programming bound for orthogonal arrays with mixed levels
• Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization
• Aircraft deconfliction with speed regulation: new models from mixed-integer optimization
• Global optimization of mixed-integer models with quadratic and signomial functions: a review
• An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note
• Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems
• On convex relaxations of quadrilinear terms
• A mixed-integer nonlinear program for the optimal design and dispatch of distributed generation systems
• Optimization and sustainable development
• A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time
• On the conditional \(p\)-median problem
• The ESA NLP solver WORHP
• A Lagrangian decomposition approach for the pump scheduling problem in water networks
• Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness
• Computing in operations research using Julia
• Mixed integer nonlinear programming tools: an updated practical overview
• Parallel decomposition of large-scale stochastic nonlinear programs
• A note on solving MINLP's using formulation space search

This page was built for software: AMPL