Content
Undated
- 1-32 Tighter price of anarchy for selfish task allocation on selfish machines
by Xiayan Cheng & Rongheng Li & Yunxia Zhou - 1-33 Searching and inferring colorful topological motifs in vertex-colored graphs
by Diego P. Rubert & Eloi Araujo & Marco A. Stefanes & Jens Stoye & Fábio V. Martinez - 1-33 Coordination mechanisms for scheduling selfish jobs with favorite machines
by Cong Chen & Yinfeng Xu - 1-34 Bipartite communities via spectral partitioning
by Kelly B. Yancey & Matthew P. Yancey - 1-34 The one-cop-moves game on planar graphs
by Ziyuan Gao & Boting Yang - 1-35 On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering
by Tanima Chatterjee & Bhaskar DasGupta & Laura Palmieri & Zainab Al-Qurashi & Anastasios Sidiropoulos - 1-37 A multi-objective simulated annealing to solve an identical parallel machine scheduling problem with deterioration effect and resources consumption constraints
by Norelhouda Sekkal & Fayçal Belkaid - 1-39 Shortest paths among transient obstacles
by Anil Maheshwari & Arash Nouri & Jörg-Rüdiger Sack - v::y::i::d:10.1007_s10878-006-8463-4 A robust genetic algorithm for rectangle packing problem
by De-Sheng Chen & Chang-Tzu Lin & Yi-Wen Wang - v::y::i::d:10.1007_s10878-006-8900-4 Journal of combinatorial optimization, special issue on communication networks and internet applications
by Maggie X. Cheng
Printed from https://ideas.repec.org/s/spr/jcomop15.html