scientific article; zbMATH DE number 1969696

MaRDI QIDQ4422978zbMATH OpenFDO

Authors Bjarne E. Helvik, Otto J. Wittner

Publication date 24 August 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2164/21640255.htm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Computing methodologies and applications (68U99) Communication networks in operations research (90B18)

Recommendations

• Combinatorial optimization, cross-entropy, ants and rare events
• The cross-entropy method for combinatorial and continuous optimization
• A Cross Entropy Based Multi-Agent Approach to Traffic Assignment Problems
• The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks
• A stochastic minimum cross-entropy method for combinatorial optimization and rare-event estimation

Cited in

(10)

• An incremental off-policy search in a model-free Markov decision process using a single sample path
• A tutorial on the cross-entropy method
• The cross-entropy method for network reliability estimation
• Application of the cross-entropy method to the buffer allocation problem in a simulation-based environment
• Basis function adaptation in temporal difference reinforcement learning
• Combinatorial optimization, cross-entropy, ants and rare events
• The cross-entropy method for solving bi-criteria network flow problems in discrete-time dynamic networks
• Ensuring fast adaptation in an ant-based path management system
• A Cross Entropy Based Multi-Agent Approach to Traffic Assignment Problems
• Overhead reduction in a distributed path management system

Describes a project that uses

Uses Software

• TSPLIB

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4422978)