An interval global optimization algorithm combining symbolic rewriting and componentwise Newton method applied to control a class of queueing systems
access control to a computer serverGroebner basesinterval branch-and-bound algorithminterval global optimization algorithminterval Newton method
Interval and finite arithmetic (65G30) Numerical mathematical programming methods (65K05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Applications of mathematical programming (90C90)
- Developing interval global optimzation algorithms on the basis of branch-and-bound and constraint propagation methods
- Interval tools for global optimization
- What can interval analysis do for global optimization?
- New interval methods for constrained global optimization
- scientific article; zbMATH DE number 4066243
- Automatic generation of numerical redundancies for nonlinear constraint solving
- Converting bases with the Gröbner walk
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Gröbner bases and systems theory
- scientific article; zbMATH DE number 5775425 (Why is no real title available?)
- scientific article; zbMATH DE number 869737 (Why is no real title available?)
- Pricing and Capacity Decisions for a Service Facility: Stability and Multiple Local Optima
- Queueing models with multiple waiting lines
- Rigorous global search: continuous problems
- User Delay Costs and Internal Pricing for a Service Facility
This page was built for publication: An interval global optimization algorithm combining symbolic rewriting and componentwise Newton method applied to control a class of queueing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2568646)
