• Philosophy
  • Published 1993

Problèmes d'optimisation combinatoires probabilistes

@inproceedings{Bellalouna1993ProblmesDC,
  title={Probl{\`e}mes d'optimisation combinatoires probabilistes},
  author={Monia Bellalouna},
  year={1993}
}
L'etude du domaine recent que constituent les problemes d'optimisation combinatoires probabilistes (POCPs) forme le sujet de cette these. Les POCPs sont des generalisations des problemes d'optimisation combinatoires classiques dont les formulations contiennent explicitement des elements probabilistes. Plusieurs motivations ont provoque cette etude. Deux d'entre elles sont particulierement importantes. La premiere correspond au desir de formuler et d'analyser des modeles qui sont plus appropries… CONTINUE READING

Figures from this paper.

Citations

Publications citing this paper.
SHOWING 1-9 OF 9 CITATIONS

A probabilistic traveling salesman problem: a survey

VIEW 8 EXCERPTS
CITES RESULTS, METHODS & BACKGROUND

A survey on combinatorial optimization in dynamic environments

  • RAIRO - Operations Research
  • 2011
VIEW 7 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

Optimization in dynamic environments

VIEW 7 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED

A branch and bound algorithm for the porbabilistic traveling salesman problem

  • 2015 IEEE/ACIS 16th International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)
  • 2015
VIEW 1 EXCERPT
CITES BACKGROUND

A priori parallel machines scheduling

  • Computers & Industrial Engineering
  • 2010
VIEW 1 EXCERPT
CITES METHODS