Journal of Combinatorial Optimization, Volume 2
Volume 2, Number 1, 1998
- Le Thi Hoai An, Pham Dinh Tao, Le Dung Muu: A Combined D.C. Optimization - Ellipsoidal Branch-and-Bound Algorithm for Solving Nonconvex Quadratic Programming Problems. 9-28
- Etienne de Klerk, Cornelis Roos, Tamás Terlaky: Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming. 51-69
- Qing Zhao, Stefan E. Karisch, Franz Rendl, Henry Wolkowicz: Semidefinite Programming Relaxations for the Quadratic Assignment Problem. 71-109
Volume 2, Number 2, 1998
- Wenan Zang: Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 is 3-Colorable. 117-188
Volume 2, Number 3, 1998
- Randeep Bhatia, Sudipto Guha, Samir Khuller, Yoram J. Sussmann: Facility Location with Dynamic Distance Functions. 199-217
- José D. P. Rolim, Luca Trevisan: A Case Study of De-randomization Methods for Combinatorial Approximation Algorithms. 219-236
- Tsan-sheng Hsu, Ming-Yang Kao: A Unifying Augmentation Algorithm for Two-Edge Connectivity and Biconnectivity. 237-256
- Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi: Approximation Algorithms for Certain Network Improvement Problems. 257-288
Volume 2, Number 4, 1998
- Brian Borchers, Judith Furman: A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems. 299-306
- Edith Cohen: Structure Prediction and Computation of Sparse Matrix Products. 307-332
- Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger: The Travelling Salesman Problem on Permuted Monge Matrices. 333-350
- Ming-Yang Kao, Neill Occhiogrosso, Shang-Hua Teng: Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs. 351-359
- Oswin Aichholzer, Franz Aurenhammer, Günter Rote, Yin-Feng Xu: Constant-Level Greedy Triangulations Approximate the MWT Well. 361-369
- Anthony J. Macula: Group Testing with Relatively Small Pools and DNA Library Screening. 385-397
- Panos M. Pardalos, Tianbing Qian, Mauricio G. C. Resende: A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem. 399-412
- Gerard J. Chang, Fu-Loong Chen, Lingling Huang, Frank K. Hwang, Su-Tzu Nuan, Uriel G. Rothblum, I.-Fan Sun, Jan-Wen Wang, Hong-Gwa Yeh: Sortabilities of Partition Properties. 413-427
- Gerard J. Chang, Frank K. Hwang, Y. C. Yao: Localizing Combinatorial Properties for Partitions on Block Graphs. 429-441
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team