NEOS

swMATH13740MaRDI QIDQ25652FDOQ25652

Author name not available (Why is that?)

Described by source

• Optimization Case Studies in the NEOS Guide

Cited In (96)

• Linear and Integer Programming Made Easy
• Benchmarking optimization software -- a (Hi)story
• A penalty approach to linear programs with many two-sided constraints
• Title not available (Why is that?)
• The Relative Cost of Function and Derivative Evaluations in the CUTEr Test Set
• Logistic regression: from art to science
• Dynamic programming with Hermite approximation
• Title not available (Why is that?)
• Scheduling the adjuvant endocrine therapy for early stage breast cancer
• Modelling history-dependent parameters in the SMPS format for stochastic programming
• The Non-Emergency Patient Transport Modelled as a Team Orienteering Problem
• Convexity and solutions of stochastic multidimensional 0-1 knapsack problems with probabilistic constraints
• Price Guarantees in Dynamic Pricing and Revenue Management
• Dynamic programming with shape-preserving rational spline Hermite interpolation
• Parallel GEAs with Linkage Analysis over Grid
• An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets
• Design and dispatch optimization of a solid-oxide fuel cell assembly for unconventional oil and gas production
• A new interior-point approach for large separable convex quadratic two-stage stochastic problems
• Capacitated clustering problems applied to the layout of IT-teams in software factories
• On the domination number and the total domination number of Fibonacci cubes
• A management system for decompositions in stochastic programming
• Single Region vs. Multiple Regions: A Comparison of Different Compiler-Directed Dynamic Voltage Scheduling Approaches
• Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs
• Test-sequence optimisation by survival analysis
• Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization
• Properties, extensions and application of piecewise linearization for Euclidean norm optimization in \(\mathbb{R}^2\)
• The State-of-the-Art in Conic Optimization Software
• Constrained optimization approaches to estimation of structural models
• Modifications of the two-stage transportation problem and their applications
• Minimizing the sum of many rational functions
• The optimization test environment
• On the global minimization of the value-at-risk
• Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach
• Numerical methods for large-scale nonlinear optimization
• Light-based circadian rhythm control: entrainment and optimization
• Solving convex MINLP optimization problems using a sequential cutting plane algorithm
• Mathematical software: Past, present, and future
• StAMPL: A filtration-oriented modeling tool for multistage stochastic recourse problems
• Kestrel: an interface from optimization modeling systems to the NEOS server
• Title not available (Why is that?)
• Title not available (Why is that?)
• Planning for HIV Screening, Testing, and Care at the Veterans Health Administration
• Solving bilevel linear programs using multiple objective linear programming
• Conic approximation to nonconvex quadratic programming with convex quadratic constraints
• An improved semidefinite programming relaxation for the satisfiability problem
• An exact penalty function based on the projection matrix
• A structured modeling technology
• Discrete-time dynamic traffic assignment models with periodic planning horizon: system optimum
• A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX
• Certified error bounds for uncertain elliptic equations
• Scenario reduction for stochastic programs with conditional value-at-risk
• Further notes on Birkhoff-von Neumann decomposition of doubly stochastic matrices
• Communication protocols for options and results in a distributed optimization environment
• A global continuation algorithm for solving binary quadratic programming problems
• Linear transformation based solution methods for non-convex mixed integer quadratic programs
• Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model
• On the efficiency of multiplier methods for nonlinear network problems with nonlinear constraints
• A scenario-based model for fleet allocation of freeway service patrols
• An improved test set approach to nonlinear integer problems with applications to engineering design
• A hybrid branch-and-bound approach for exact rational mixed-integer programming
• An interior point cutting plane heuristic for mixed integer programming
• Arrival Rate Approximation by Nonnegative Cubic Splines
• Title not available (Why is that?)
• Structured low rank approximation
• Title not available (Why is that?)
• Title not available (Why is that?)
• An algorithm for global solution to bi-parametric linear complementarity constrained linear programs
• Exact cost minimization of a series-parallel reliable system with multiple component choices using an algebraic method
• Variable neighborhood search for the bi-objective post-sales network design problem: a fitness landscape analysis approach
• GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
• Client-side Computational Optimization
• An improved Bernstein global optimization algorithm for MINLP problems with application in process industry
• Results on the domination number and the total domination number of Lucas cubes
• DrAmpl: A meta solver for optimization problem analysis
• Developments in linear and integer programming
• An efficient method for nonlinearly constrained networks
• On the Weber facility location problem with limited distances and side constraints
• Convex relaxation for solving posynomial programs
• iNEOS: An interactive environment for nonlinear optimization
• TACO: a toolkit for AMPL control optimization
• Safe bounds in linear and mixed-integer linear programming
• Robust goal programming using different robustness echelons via norm-based and ellipsoidal uncertainty sets
• A nonlinear optimization methodology for VLSI fixed-outline floorplanning
• A Chebyshev technique for the solution of optimal control problems with nonlinear programming methods
• OSiL: An instance language for optimization
• A server for automated performance analysis of benchmarking data
• Multi-depot two-echelon fuel minimizing routing problem with heterogeneous fleets: model and heuristic
• Integration of strategic and tactical decisions for vendor selection under capacity constraints
• Integrating restoration and scheduling decisions for disrupted interdependent infrastructure systems
• Structure methods for solving the nearest correlation matrix problem
• Estimating arrival rate of nonhomogeneous Poisson processes with semidefinite programming
• Title not available (Why is that?)
• The bandpass problem: Combinatorial optimization and library of problems
• A Decentralized Approach to Discrete Optimization via Simulation: Application to Network Flow
• A sequential cutting plane algorithm for solving convex NLP problems
• A magnetic resonance device designed via global optimization techniques

This page was built for software: NEOS