Risk transportation via a clique number problem formulation.
From MaRDI portal
Publication:1412758
DOI10.1016/S0377-2217(03)00040-7zbMath1043.90008OpenAlexW2064438265MaRDI QIDQ1412758
J.-C. Panayiotopoulos, George Mavrommatis
Publication date: 25 November 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00040-7
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- An exact algorithm for the maximum clique problem
- Parallel concepts in graph theory
- Manufacturing cell formation using similarity coefficients and a parallel genetic TSP algorithm: Formulation and comparison
- On finding dissimilar paths
- White, Gray and Black Operational Holes : An Artificial Intelligence Approach
- An algorithm for information structuring and retrieval
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Risk transportation via a clique number problem formulation.
