Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Optimization, Volume 10
Volume 10, Number 1, August 2005
- Panos M. Pardalos:
Editorial. 5-5
- Stanislav Busygin, Oleg A. Prokopyev
, Panos M. Pardalos:
Feature Selection for Consistent Biclustering via Fractional 0-1 Programming. 7-21 - Balabhaskar Balasundaram, Sergiy Butenko, Svyatoslav Trukhanov:
Novel Approaches for Analyzing Biological Networks. 23-39 - Ho Ki Fung, S. Rao, Christodoulos A. Floudas, Oleg A. Prokopyev, Panos M. Pardalos, Franz Rendl:
Computational Comparison Studies of Quadratic Assignment Like Formulations for the In Silico Sequence Selection Problem in De Novo Protein Design. 41-60 - Carlos A. S. Oliveira:
An Algorithm for the Maximum Likelihood Problem on Evolutionary Trees. 61-75 - Gary A. Kochenberger, Fred W. Glover, Bahram Alidaee, Haibo Wang:
Clustering of Microarray data via Clique Partitioning. 77-92
Volume 10, Number 2, September 2005
- Jianping Li, Kang Li, Lusheng Wang, Hao Zhao:
Maximizing Profits of Routing in WDM Networks. 99-111 - Jinhui Xu, Guang Xu, Zhenming Chen, Vikas Singh, Kenneth R. Hoffmann:
Efficient Algorithms for Determining 3-D Bi-Plane Imaging Geometry. 113-132 - Gerold Jäger, Anand Srivastav:
Improved Approximation Algorithms for Maximum Graph Partitioning Problems. 133-167 - Igor E. Zverovich, Inessa I. Zverovich:
Penta-Extensions of Hereditary Classes of Graphs. 169-178 - Zhenming Chen, Vikas Singh, Jinhui Xu:
Efficient Job Scheduling Algorithms with Multi-Type Contentions. 179-197 - Hongwei Du, Xiaohua Jia, Feng Wang, My T. Thai, Yingshu Li:
A Note on Optical Network with Nonsplitting Nodes. 199-202
Volume 10, Number 3, November 2005
- Tínaz Ekim, Dominique de Werra:
On Split-Coloring Problems. 211-225 - Ariela Bilitzky, Arik Sadeh:
Efficient Solutions for Special Zero-One Programming Problems. 227-238 - Mhand Hifi, Hedi M'Halla, Slim Sadfi:
Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem. 239-260 - Tonguç Ünlüyurt:
Testing Systems of Identical Components. 261-282 - Michael A. Henning, Michael D. Plummer:
Vertices Contained in all or in no Minimum Paired-Dominating Set of a Tree. 283-294
Volume 10, Number 4, December 2005
- Qizhi Fang, Hye Kyung Kim:
A Note on Balancedness of Dominating Set Games. 303-310 - Yannis Marinakis, Athanasios Migdalas, Panos M. Pardalos:
A Hybrid Genetic-GRASP Algorithm Using Lagrangean Relaxation for the Traveling Salesman Problem. 311-326 - Roberto Montemanni, Luca Maria Gambardella, Andrea Emilio Rizzoli, Alberto V. Donati:
Ant Colony System for a Dynamic Vehicle Routing Problem. 327-343 - Yiwei Jiang, Zhiyi Tan, Yong He:
Preemptive Machine Covering on Parallel Machines. 345-363 - Gautam Appa, Dimitris Magos, Ioannis Mourtos:
The Wheels of the Orthogonal Latin Squares Polytope: Classification and Valid Inequalities. 365-389 - Longjiang Guo, Weili Wu, Feng Wang, My T. Thai:
An Approximation for Minimum Multicast Route in Optical Networks with Nonsplitting Nodes. 391-394
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2023-06-07 21:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
