Results 81 to 90 of about 435 (145)

Polynomially searchable exponential neighbourhoods for sequencing problems in combinatorial optimisation

open access: yes, 2000
In this thesis, we study neighbourhoods of exponential size that can be searched in polynomial time. Such neighbourhoods are used in local search algorithms for classes of combinatorial optimisation problems.
Congram, Richard K., Congram, R.K.
core  

Fair allocation strategies for opioid settlements. [PDF]

open access: yesHealth Care Manag Sci
Chen Q, Newton R, Griffin P.
europepmc   +1 more source

Multi-Agent Reinforcement Learning in Games: Research and Applications. [PDF]

open access: yesBiomimetics (Basel)
Li H   +5 more
europepmc   +1 more source

A Systematic Intelligent Optimization Framework for a Sustained-Release Formulation Design. [PDF]

open access: yesPharmaceutics
Qiao Y   +9 more
europepmc   +1 more source

How Robust is Robust Control in the Time Domain? [PDF]

open access: yes
By applying robust control the decision maker wants to make good decisions when his model is only a good approximation of the true one. Such decisions are said to be robust to model misspecification.
Marco P. Tucci
core  

Home - About - Disclaimer - Privacy