The following pages link to NEOS (Q25652):
Displaying 46 items.
- Test-sequence optimisation by survival analysis (Q2418154) (← links)
- On the Weber facility location problem with limited distances and side constraints (Q2448124) (← links)
- Discrete-time dynamic traffic assignment models with periodic planning horizon: system optimum (Q2460110) (← links)
- A sequential cutting plane algorithm for solving convex NLP problems (Q2496070) (← links)
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm (Q2506191) (← links)
- A management system for decompositions in stochastic programming (Q2507408) (← links)
- Convex relaxation for solving posynomial programs (Q2655346) (← links)
- Capacitated clustering problems applied to the layout of IT-teams in software factories (Q2675719) (← links)
- Modifications of the two-stage transportation problem and their applications (Q2686648) (← links)
- Complexity guarantees for an implicit smoothing-enabled method for stochastic MPECs (Q2693641) (← links)
- The State-of-the-Art in Conic Optimization Software (Q2802542) (← links)
- Convexity and solutions of stochastic multidimensional 0-1 knapsack problems with probabilistic constraints (Q2806828) (← links)
- Constrained optimization approaches to estimation of structural models (Q2859530) (← links)
- Kestrel: an interface from optimization modeling systems to the NEOS server (Q2901033) (← links)
- StAMPL: A filtration-oriented modeling tool for multistage stochastic recourse problems (Q2901063) (← links)
- The Relative Cost of Function and Derivative Evaluations in the CUTEr Test Set (Q2913138) (← links)
- (Q3059449) (← links)
- (Q3372341) (← links)
- A server for automated performance analysis of benchmarking data (Q3377976) (← links)
- Price Guarantees in Dynamic Pricing and Revenue Management (Q3392060) (← links)
- A Decentralized Approach to Discrete Optimization via Simulation: Application to Network Flow (Q3392108) (← links)
- Arrival Rate Approximation by Nonnegative Cubic Splines (Q3392161) (← links)
- Numerical methods for large-scale nonlinear optimization (Q3430648) (← links)
- Linear and Integer Programming Made Easy (Q3452581) (← links)
- Planning for HIV Screening, Testing, and Care at the Veterans Health Administration (Q3453329) (← links)
- (Q3515788) (← links)
- Parallel GEAs with Linkage Analysis over Grid (Q3539202) (← links)
- (Q4421360) (← links)
- (Q4430862) (← links)
- (Q4435426) (← links)
- (Q4654838) (← links)
- Developments in linear and integer programming (Q4656723) (← links)
- On the global minimization of the value-at-risk (Q4657710) (← links)
- On the efficiency of multiplier methods for nonlinear network problems with nonlinear constraints (Q4659863) (← links)
- Single Region vs. Multiple Regions: A Comparison of Different Compiler-Directed Dynamic Voltage Scheduling Approaches (Q4707657) (← links)
- Results on the domination number and the total domination number of Lucas cubes (Q4993941) (← links)
- Outlier Detection in Time Series via Mixed-Integer Conic Quadratic Optimization (Q5010043) (← links)
- A new interior-point approach for large separable convex quadratic two-stage stochastic problems (Q5043842) (← links)
- A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX (Q5060504) (← links)
- On the domination number and the total domination number of Fibonacci cubes (Q5225037) (← links)
- Client-side Computational Optimization (Q5237432) (← links)
- The Non-Emergency Patient Transport Modelled as a Team Orienteering Problem (Q5281616) (← links)
- The minimum size required of a solitaire army (Q5445376) (← links)
- Modelling history-dependent parameters in the SMPS format for stochastic programming (Q5452008) (← links)
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization (Q5461067) (← links)
- iNEOS: An interactive environment for nonlinear optimization (Q5957864) (← links)
