Issue 1/2014
Special Issue in Honor of the 60th Birthday of Panos M. Pardalos
Content (16 Articles)
Bound and exact methods for assessing link vulnerability in complex networks
T. N. Dinh, M. T. Thai, H. T. Nguyen
Multi-depot vessel routing problem in a direction dependent wavefield
Michael J. Hirsch, Daniel E. Schroeder, Alvaro Maggiar, Irina S. Dolinskaya
The unconstrained binary quadratic programming problem: a survey
Gary Kochenberger, Jin-Kao Hao, Fred Glover, Mark Lewis, Zhipeng Lü, Haibo Wang, Yang Wang
Mathematical programming: Turing completeness and applications to software analysis
Leo Liberti, Fabrizio Marinelli
An exact algorithm for the maximum probabilistic clique problem
Zhuqi Miao, Balabhaskar Balasundaram, Eduardo L. Pasiliao
Characteristics of the maximal independent set ZDD
David R. Morrison, Edward C. Sewell, Sheldon H. Jacobson
A hybrid biased random key genetic algorithm approach for the unit commitment problem
L. A. C. Roque, D. B. M. M. Fontes, F. A. C. C. Fontes
On risk-averse maximum weighted subgraph problems
Maciej Rysz, Mohammad Mirghorbani, Pavlo Krokhmal, Eduardo L. Pasiliao
Staying safe and visible via message sharing in online social networks
Yilin Shen, Thang N. Dinh, My T. Thai, Hien T. Nguyen
Value-at-risk support vector machine: stability to outliers
Peter Tsyurmasto, Michael Zabarankin, Stan Uryasev
An integer programming framework for critical elements detection in graphs
Alexander Veremyev, Oleg A. Prokopyev, Eduardo L. Pasiliao
Minimum number of disjoint linear forests covering a planar graph
Huijuan Wang, Lidong Wu, Weili Wu, Jianliang Wu
Integrated Ant Colony and Tabu Search approach for time dependent vehicle routing problems with simultaneous pickup and delivery
Tao Zhang, W. Art Chaovalitwongse, Yuejie Zhang
A greedy algorithm for the fault-tolerant connected dominating set in a general graph
Jiao Zhou, Zhao Zhang, Weili Wu, Kai Xing