Printed from https://ideas.repec.org/s/spr/jcomop12.html
Content
January 2008, Volume 15, Issue 1
- 123-126 Improved construction for pooling design
by Ping Deng & F. K. Hwang & Weili Wu & David MacCallum & Feng Wang & Taieb Znati
November 2007, Volume 14, Issue 4
- 385-410 Maximally even sets and configurations: common threads in mathematics, physics, and music
by Jack Douthett & Richard Krantz - 411-425 Monotonicity of strong searching on digraphs
by Boting Yang & Yi Cao - 427-435 Online bin packing of fragile objects with application in cellular networks
by Wun-Tat Chan & Francis Y.-L. Chin & Deshi Ye & Guochuan Zhang & Yong Zhang - 437-453 Approximation algorithms and hardness results for labeled connectivity problems
by Refael Hassin & Jérôme Monnot & Danny Segev - 455-463 Maximum k-regular induced subgraphs
by Domingos M. Cardoso & Marcin Kamiński & Vadim Lozin - 465-474 The densest k-subgraph problem on clique graphs
by Maria Liazi & Ioannis Milis & Fanny Pascual & Vassilis Zissimopoulos - 475-480 A note on special optimal batching structures to minimize total weighted completion time
by Wenhua Li & Jinjiang Yuan & Yixun Lin - 481-498 The wireless network jamming problem
by Clayton W. Commander & Panos M. Pardalos & Valeriy Ryabchenko & Stan Uryasev & Grigoriy Zrazhevsky - 499-499 Journal of combinatorial optimization, special issue on communication networks and internet applications
by Maggie X. Cheng - 500-500 A robust genetic algorithm for rectangle packing problem
by De-Sheng Chen & Chang-Tzu Lin & Yi-Wen Wang
October 2007, Volume 14, Issue 2
- 111-112 Editorial note
by Gerard J. Chang & Hung-Lin Fu & Xuding Zhu - 113-119 Group testing in graphs
by Justie Su-tzu Juan & Gerard J. Chang - 121-129 An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution
by H. B. Chen & D. Z. Du & F. K. Hwang - 131-142 Optimal all-to-all personalized exchange in d-nary banyan multistage interconnection networks
by Victor W. Liu & Chiuyuan Chen & Richard B. Chen - 143-152 Wide diameters of de Bruijn graphs
by Jyhmin Kuo & Hung-Lin Fu - 153-164 The use of edge-directions and linear programming to enumerate vertices
by Shmuel Onn & Uriel G. Rothblum - 165-175 An algorithm for optimal difference systems of sets
by Vladimir D. Tonchev & Hao Wang - 177-190 Profile minimization on compositions of graphs
by Yu-Ping Tsao & Gerard J. Chang - 191-195 Near automorphisms of trees with small total relative displacements
by Chia-Fen Chang & Hung-Lin Fu - 197-204 Hamiltonicity of hypercubes with a constraint of required and faulty edges
by Lih-Hsing Hsu & Shu-Chung Liu & Yeong-Nan Yeh - 205-218 Decomposition of K m,n into 4-cycles and 2t-cycles
by Chao-Chih Chou & Chin-Mei Fu - 219-227 L(j,k)- and circular L(j,k)-labellings for the products of complete graphs
by Peter Che Bor Lam & Wensong Lin & Jianzhuan Wu - 229-248 Transport schemes for topology-transparent scheduling
by Violet R. Syrotiuk & Zhiqiang Zhang & Charles J. Colbourn - 249-257 Recent progress in mathematics and engineering on optimal graph labellings with distance conditions
by Jerrold R. Griggs & Xiaohua Teresa Jin - 259-265 Decompositions of λ K v
by C. A. Rodger & S. K. Westbrook - 267-274 Distance graphs on R n with 1-norm
by Jer-Jeong Chen & Gerard J. Chang - 275-294 On cubic 2-independent Hamiltonian connected graphs
by Tung-Yang Ho & Chun-Nan Hung & Lih-Hsing Hsu - 295-308 A study on cyclic bandwidth sum
by Ying-Da Chen & Jing-Ho Yan - 309-321 Integer-magic spectra of sun graphs
by Wai Chee Shiu & Richard M. Low - 323-329 Packing 5-cycles into balanced complete m-partite graphs for odd m
by Ming-Hway Huang & Chin-Mei Fu & Hung-Lin Fu - 331-347 Characterizing the reconstruction and enumerating the patterns of DNA sequences with repeats
by Hsun-Wen Chang & Pei-Fang Tsai - 349-364 On the equitable k *-laceability of hypercubes
by Chung-Haw Chang & Chao-Ming Sun & Hua-Min Huang & Lih-Hsing Hsu - 365-382 Maximum cyclic 4-cycle packings of the complete multipartite graph
by Shung-Liang Wu & Hung-Lin Fu - 383-383 Decomposition of K m,n into 4-cycles and 2t-cycles
by Chao-Chih Chou & Chin-Mei Fu
July 2007, Volume 14, Issue 1
- 1-7 Paired-domination in generalized claw-free graphs
by Paul Dorbec & Sylvain Gravier & Michael A. Henning - 9-33 An immune algorithm with stochastic aging and kullback entropy for the chromatic number problem
by Vincenzo Cutello & Giuseppe Nicosia & Mario Pavone - 35-44 Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors
by Yaodong Cui & Qiang Wang - 45-61 Semi-online scheduling with “end of sequence” information
by Leah Epstein & Deshi Ye - 63-86 Packing [1, Δ]-factors in graphs of small degree
by Adrian Kosowski & Michał Małafiejski & Paweł Żyliński - 87-109 On the adjacent vertex-distinguishing total chromatic numbers of the graphs with Δ (G) = 3
by Haiying Wang
May 2007, Volume 13, Issue 4
- 289-320 An efficient approach for large scale graph partitioning
by Renzo Zamprogno & André R. S. Amaral - 321-336 Improved approximation algorithms for metric MaxTSP
by Zhi-Zhong Chen & Takayuki Nagoya - 337-351 A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem
by Abdelkader Sbihi - 353-363 Restricted domination parameters in graphs
by Wayne Goddard & Michael A. Henning - 365-378 Total energy optimal multicasting in wireless ad hoc networks
by Manki Min & Panos M. Pardalos - 379-403 Relative blocking in posets
by Andrey O. Matveev
April 2007, Volume 13, Issue 3
- 205-206 Editorial, special issue on bioinformatics
by Binhai Zhu - 207-216 Discovering classes in microarray data using island counts
by Brendan Mumey & Louise Showe & Michael Showe - 217-221 A 2-approximation for the preceding-and-crossing structured 2-interval pattern problem
by Minghui Jiang - 223-242 Fast algorithms for computing the tripartition-based distance between phylogenetic networks
by Nguyen Bao Nguyen & C. Thach Nguyen & Wing-Kin Sung - 243-262 An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
by Hiroki Arimura & Takeaki Uno - 263-275 Improved algorithms for largest cardinality 2-interval pattern problem
by Erdong Chen & Linji Yang & Hao Yuan - 277-288 Efficient algorithms for finding a longest common increasing subsequence
by Wun-Tat Chan & Yong Zhang & Stanley P. Y. Fung & Deshi Ye & Hong Zhu
February 2007, Volume 13, Issue 2
- 103-122 On Ring Grooming in optical networks
by Gruia Călinescu & Peng-Jun Wan - 123-135 Some inverse min-max network problems under weighted l 1 and l ∞ norms with bound constraints on changes
by Xiaoguang Yang & Jianzhong Zhang - 137-152 Clustering and combinatorial optimization in recursive supervised learning
by Kiruthika Ramanathan & Sheng Uei Guan - 153-162 Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
by Sun-Yuan Hsieh & Pei-Yu Yu - 163-178 On edge orienting methods for graph coloring
by Bernard Gendron & Alain Hertz & Patrick St-Louis - 179-188 RNA multiple structural alignment with longest common subsequences
by Sergey Bereg & Marcin Kubica & Tomasz Waleń & Binhai Zhu - 189-204 On-line production order scheduling with preemption penalties
by Feifeng Zheng & Yinfeng Xu & E. Zhang
January 2007, Volume 13, Issue 1
- 1-18 On the number of local minima for the multidimensional assignment problem
by Don A. Grundel & Pavlo A. Krokhmal & Carlos A. S. Oliveira & Panos M. Pardalos - 19-32 Performance ratios of the Karmarkar-Karp differencing method
by Wil Michiels & Jan Korst & Emile Aarts & Jan van Leeuwen - 33-45 A simple linear time approximation algorithm for multi-processor job scheduling on four processors
by Jingui Huang & Jianer Chen & Songqiao Chen & Jianxin Wang - 47-59 Strong-mixed searching and pathwidth
by Boting Yang - 61-78 Graphs with large paired-domination number
by Michael A. Henning - 79-102 A multi-objective particle swarm for a flow shop scheduling problem
by A. R. Rahimi-Vahed & S. M. Mirghorbani
December 2006, Volume 12, Issue 4
- 325-326 Editorial: In memoriam: Yong He (1969–2005)
by Guohui Lin & Zhiyi Tan - 327-336 The web proxy location problem in general tree of rings networks
by Guangting Chen & Gu Zhang & Rainer E. Burkard - 337-350 Scheduling with machine cost and rejection
by György Dósa & Yong He - 351-361 The shortest path improvement problems under Hamming distance
by Binwu Zhang & Jianzhong Zhang & Liqun Qi - 363-386 Separating online scheduling algorithms with the relative worst order ratio
by Leah Epstein & Lene M. Favrholdt & Jens S. Kohrt - 387-394 A note on the complexity of the problem of two-agent scheduling on a single machine
by C. T. Ng & T. C. E. Cheng & J. J. Yuan - 395-408 Inverse maximum flow problems under the weighted Hamming distance
by Longcheng Liu & Jianzhong Zhang - 409-419 Dynamic-objective particle swarm optimization for constrained optimization problems
by Haiyan Lu & Weiqi Chen - 421-432 Optimal algorithms for uncovering synteny problem
by Chen Ting & H. E. Yong
November 2006, Volume 12, Issue 3
- 167-185 The fastest itinerary in time-dependent decentralized travel information systems
by Jinchang Wang & Thomas Kämpke - 187-215 Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
by Eranda Çela & Bettina Klinz & Christophe Meyer - 217-230 Tree edge decomposition with an application to minimum ultrametric tree approximation
by Chia-Mao Huang & Bang Ye Wu & Chang-Biau Yang - 231-256 Exact and heuristic algorithms for solving the generalized minimum filter placement problem
by E. Chisonge Mofya & J. Cole Smith - 257-277 Penalty guided genetic search for redundancy optimization in multi-state series-parallel power system
by Rashika Gupta & Manju Agarwal - 279-295 Optimal testing and repairing a failed series system
by Mikhail Y. Kovalyov & Marie-Claude Portmann & Ammar Oulamara - 297-301 Construction of d(H)-disjunct matrix for group testing in hypergraphs
by Hong Gao & F. K. Hwang & My T. Thai & Weili Wu & Taieb Znati - 303-323 Phased local search for the maximum clique problem
by Wayne Pullan
September 2006, Volume 12, Issue 1
- 5-16 Minimum failure explanations for path vector routing changes
by Mohit Lad & Dan Massey & Adam Meyerson & Akash Nanavati & Lixia Zhang - 17-34 Efficient algorithms for shared backup allocation in networks with partial information
by Yigal Bejerano & Joseph (Seffi) Naor & Alexander Sprintson - 35-56 Resource allocation for restoration of compromised systems
by Qunwei Zheng & Sibabrata Ray & Xiaoyan Hong - 57-70 Combinatorics of TCP reordering
by Anders Hansson & Gabriel Istrate & Shiva Prasad Kasiviswanathan - 71-82 Optimization of loss-balanced multicast in all-optical WDM networks
by Yuan Cao & Oliver Yu - 83-96 Finding disjoint paths with related path costs
by Randeep Bhatia & Murali Kodialam & T. V. Lakshman - 97-125 Traffic engineering of tunnel-based networks with class specific diversity requirements
by Shekhar Srivastava & Deep Medhi - 127-149 A New delay control method for real-time flows
by Weijia Jia & Hanxing Wang & Wanqing Tu & Wei Zhao - 151-162 An adaptive algorithm for active queue management
by Chonggang Wang & Yu Lin & Kazem Sohraby & Bo Li
June 2006, Volume 11, Issue 4
- 351-371 Some further results on minimum distribution cost flow problems
by Haiyan Lu & Enyu Yao & Liqun Qi - 373-385 A “maximum node clustering” problem
by Giuliana Carello & Federico Della Croce & Andrea Grosso & Marco Locatelli - 387-405 Inapproximability results for the lateral gene transfer problem
by Bhaskar Dasgupta & Sergio Ferrarini & Uthra Gopalakrishnan & Nisha Raj Paryani - 407-410 Strongly 2-shape-sortability of vector partitions
by Huilan Chang & Junyi Guo - 411-420 A combinatorial theorem on labeling squares with points and its application
by Binhai Zhu & Minghui Jiang - 421-434 Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem
by Vicky Mak & Tommy Thomadsen - 435-443 Construction of the nearest neighbor embracing graph of a point set
by M. Y. Chan & Danny Z. Chen & Francis Y. L. Chin & Cao An Wang - 445-454 Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees
by Zemin Jin & Mikio Kano & Xueliang Li & Bing Wei
May 2006, Volume 11, Issue 3
- 263-278 When are two multivariate random processes indistinguishable
by Demetrios Kazakos & Sam Makki - 279-290 Approximation hardness of edge dominating set problems
by Miroslav Chlebík & Janka Chlebíková - 291-304 Efficient point coverage in wireless sensor networks
by Jie Wang & Ning Zhong - 305-319 Min-energy voltage allocation for tree-structured tasks
by Minming Li & Becky Jie Liu & Frances F. Yao - 321-339 One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions
by F. H. Chang & H. B. Chen & J. Y. Guo & F. K. Hwang & Uriel G. Rothblum - 341-346 Strengthened 0-1 linear formulation for the daily satellite mission planning
by Virginie Gabrel
March 2006, Volume 11, Issue 2
- 131-131 Introduction to the special issue
by Lusheng Wang - 133-144 Genome rearrangements with partially ordered chromosomes
by Chunfang Zheng & David Sankoff - 145-154 Opportunistic data structures for range queries
by Chung Keung Poon & Wai Keung Yiu - 155-175 Finding longest increasing and common subsequences in streaming data
by David Liben-Nowell & Erik Vee & An Zhu - 177-187 A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time
by Wun-Tat Chan & Francis Y. L. Chin & Yong Zhang & Hong Zhu & Hong Shen & Prudence W. H. Wong - 189-202 On zero error algorithms having oracle access to one query
by Jin-Yi Cai & Venkatesan T. Chakaravarthy - 203-217 A PTAS for a disc covering problem using width-bounded separators
by Zhixiang Chen & Bin Fu & Yong Tang & Binhai Zhu - 219-229 Inapproximability and approximability of maximal tree routing and coloring
by Xujin Chen & Xiaodong Hu & Tianping Shuai - 231-247 On the computational hardness based on linear FPT-reductions
by Jianer Chen & Xiuzhen Huang & Iyad A. Kanj & Ge Xia - 249-260 On optimal placement of relay nodes for reliable connectivity in wireless sensor networks
by Hai Liu & Pengjun Wan & Xiaohua Jia
February 2006, Volume 11, Issue 1
- 5-6 Editorial
by Maggie X. Cheng - 7-20 Energy conservation through resource-aware movement in heterogeneous mobile ad hoc networks
by Wei Liu & Yanchao Zhang & Yuguang Fang & Kejie Lu - 21-41 Coverage by directional sensors in randomly deployed wireless sensor networks
by Jing Ai & Alhussein A. Abouzeid - 43-57 Multiple objective optimization of bluetooth scatternets
by L. E. Hodge & R. M. Whitaker & S. Hurley - 59-69 Optimal solutions to minimum total energy broadcasting problem in wireless ad hoc networks
by Manki Min & Oleg Prokopyev & Panos M. Pardalos - 71-85 Reliable Ad Hoc Routing Based on Mobility Prediction
by Jian Tang & Guoliang Xue & Weiyi Zhang - 87-97 An online distributed gossiping protocol for mobile networks
by Zhengnan Shi & Pradip K. Srimani - 99-112 Minimum power assignment in wireless ad hoc networks with spanner property
by Yu Wang & Xiang-Yang Li - 113-123 Data relaying with constraints in hierarchical sensor networks
by Robert Benkoczi & Hossam Hassanein & Selim Akl & Sylvia Tai - 125-125 Erratum
by T. Ekim & D. Werra
December 2005, Volume 10, Issue 4
- 303-310 A Note on Balancedness of Dominating Set Games
by Qizhi Fang & Hye Kyung Kim - 311-326 A Hybrid Genetic—GRASP Algorithm Using Lagrangean Relaxation for the Traveling Salesman Problem
by Yannis Marinakis & Athanasios Migdalas & Panos M. Pardalos - 327-343 Ant Colony System for a Dynamic Vehicle Routing Problem
by R. Montemanni & L. M. Gambardella & A. E. Rizzoli & A. V. Donati - 345-363 Preemptive Machine Covering on Parallel Machines
by Yiwei Jiang & Zhiyi Tan & Yong He - 365-389 The Wheels of the Orthogonal Latin Squares Polytope: Classification and Valid Inequalities
by G. Appa & D. Magos & I. Mourtos - 391-394 An Approximation for Minimum Multicast Route in Optical Networks with Nonsplitting Nodes
by Longjiang Guo & Weili Wu & Feng Wang & My Thai
November 2005, Volume 10, Issue 3
- 211-225 On Split-Coloring Problems
by T. Ekim & D. Werra - 227-238 Efficient Solutions for Special Zero-One Programming Problems
by Ariela Bilitzky & Arik Sadeh - 239-260 Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem
by Mhand Hifi & Hedi Mhalla & Slim Sadfi - 261-282 Testing Systems of Identical Components
by Tonguç Ünlüyurt - 283-294 Vertices Contained in all or in no Minimum Paired-Dominating Set of a Tree
by Michael A. Henning & Michael D. Plummer
September 2005, Volume 10, Issue 2
- 99-111 Maximizing Profits of Routing in WDM Networks
by Jianping Li & Kang Li & Lusheng Wang & Hao Zhao - 113-132 Efficient Algorithms for Determining 3-D Bi-Plane Imaging Geometry
by Jinhui Xu & Guang Xu & Zhenming Chen & Vikas Singh & Kenneth R. Hoffmann - 133-167 Improved Approximation Algorithms for Maximum Graph Partitioning Problems
by Gerold Jäger & Anand Srivastav - 169-178 Penta-Extensions of Hereditary Classes of Graphs
by Igor E. Zverovich & Inessa I. Zverovich - 179-197 Efficient Job Scheduling Algorithms with Multi-Type Contentions
by Zhenming Chen & Vikas Singh & Jinhui Xu - 199-202 A Note on Optical Network with Nonsplitting Nodes
by Hongwei Du & Xiaohua Jia & Feng Wang & My Thai & Yingshu Li
August 2005, Volume 10, Issue 1
- 5-5 Editorial
by Panos M. Pardalos - 7-21 Feature Selection for Consistent Biclustering via Fractional 0–1 Programming
by Stanislav Busygin & Oleg A. Prokopyev & Panos M. Pardalos - 23-39 Novel Approaches for Analyzing Biological Networks
by Balabhaskar Balasundaram & Sergiy Butenko & Svyatoslav Trukhanov - 41-60 Computational Comparison Studies of Quadratic Assignment Like Formulations for the In Silico Sequence Selection Problem in De Novo Protein Design
by H. K. Fung & S. Rao & C. A. Floudas & O. Prokopyev & P. M. Pardalos & F. Rendl - 61-75 An Algorithm for the Maximum Likelihood Problem on Evolutionary Trees
by Carlos A. S. Oliveira - 77-92 Clustering of Microarray data via Clique Partitioning
by Gary Kochenberger & Fred Glover & Bahram Alidaee & Haibo Wang
June 2005, Volume 9, Issue 4
- 331-347 A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs
by Xueliang Li & Wenan Zang - 349-356 An Improved Approximation Algorithm for Multicast k-Tree Routing
by Guohui Lin - 357-379 The 2-Edge-Connected Subgraph Polyhedron
by Dieter Vandenbussche & George L. Nemhauser - 381-399 Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices
by Vladimir G. Deineko & George Steiner & Zhihui Xue - 401-432 An Improved Randomized Approximation Algorithm for Max TSP
by Zhi-Zhong Chen & Lusheng Wang
May 2005, Volume 9, Issue 3
- 243-262 On Approximation Ratios of Minimum-Energy Multicast Routing in Wireless Networks
by Hongxu Cai & Yingchao Zhao - 263-266 On 3-Stage Clos Networks with Different Nonblocking Requirements on Two Types of Calls
by Hung-Lin Fu & Frank K. Hwang - 267-280 Perfect Circular Arc Coloring
by Xujin Chen & Zhiquan Hu & Wenan Zang - 281-294 The Polymatroid Steiner Problems
by G. Calinescu & A. Zelikovsky - 295-311 On the Hardness of Approximating the Min-Hack Problem
by Ramkumar Chinchani & Duc Ha & Anusha Iyer & Hung Q. Ngo & Shambhu Upadhyaya - 313-323 A Framework for the Complexity of High-Multiplicity Scheduling Problems
by N. Brauner & Y. Crama & A. Grigoriev & J. Klundert
March 2005, Volume 9, Issue 2
- 147-156 Finding a Length-Constrained Maximum-Density Path in a Tree
by Rung-Ren Lin & Wen-Hsiung Kuo & Kun-Mao Chao - 157-165 A Tighter Extra-Resource Analysis of Online Deadline Scheduling
by Tak-Wah Lam & Tusen-Wan Johnny Ngan & Kar-Keung To - 167-186 On-Line Scheduling Algorithms for a Batch Machine with Finite Capacity
by Chung Keung Poon & Wenci Yu - 187-198 The Center Location Improvement Problem Under the Hamming Distance
by Binwu Zhang & Jianzhong Zhang & Yong He - 199-211 Clustering Binary Oligonucleotide Fingerprint Vectors for DNA Clone Classification Analysis
by Zhipeng Cai & Maysam Heydari & Guohui Lin - 213-222 Power Assignment for k-Connectivity in Wireless Ad Hoc Networks
by Xiaohua Jia & Dongsoo Kim & Sam Makki & Peng-Jun Wan & Chih-Wei Yi - 223-235 Broadcast Routing with Minimum Wavelength Conversion in WDM Optical Networks
by Lu Ruan & Weili Wu
February 2005, Volume 9, Issue 1
- 5-17 A PTAS for Semiconductor Burn-in Scheduling
by Xiaotie Deng & Haodi Feng & Guojun Li & Benyun Shi - 19-34 Average-Case Performance Analysis of a 2D Strip Packing Algorithm—NFDH
by Xiaodong Gu & Guoliang Chen & Yinlong Xu - 35-47 Requiring Connectivity in the Set Covering Problem
by J. Orestes Cerdeira & Leonor S. Pinto - 49-57 Scheduling in Switching Networks with Set-Up Delays
by Foto Afrati & Timos Aslanidis & Evripidis Bampis & Ioannis Milis - 59-67 Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation
by Jon Lee & Janny Leung & Sven Vries - 69-90 Efficient Algorithms and Implementations for Optimizing the Sum of Linear Fractional Functions, with Applications
by Danny Z. Chen & Ovidiu Daescu & Yang Dai & Naoki Katoh & Xiaodong Wu & Jinhui Xu - 91-100 Weighted Inverse Minimum Spanning Tree Problems Under Hamming Distance
by Yong He & Binwu Zhang & Enyu Yao - 101-120 Two Variations of the Minimum Steiner Problem
by Tsan-Sheng Hsu & Kuo-Hui Tsai & Da-Wei Wang & D. T. Lee - 121-138 Order Consolidation for Batch Processing
by Hark-Chin Hwang & Soo Y. Chang
December 2004, Volume 8, Issue 4
- 403-418 Protein Threading by Linear Programming: Theoretical Analysis and Computational Results
by Jinbo Xu & Ming Li & Ying Xu - 419-437 A Novel Evolutionary Formulation of the Maximum Independent Set Problem
by Valmir C. Barbosa & Luciana C. D. Campos - 439-452 On Combinatorial Approximation of Covering 0-1 Integer Programs and Partial Set Cover
by Toshihiro Fujito - 453-468 The Minimal Spanning Tree Preservation Approaches for DNA Multiple Sequence Alignment and Evolutionary Tree Construction
by Shyong Jian Shyu & Yin Te Tsai & R.C.T. Lee - 469-493 From Linear to Semidefinite Programming: An Algorithm to Obtain Semidefinite Relaxations for Bivalent Quadratic Problems
by Frédéric Roupin - 495-502 Minimum ε-equivalent Circuit Size Problem
by Oleg A. Prokopyev & Panos M. Pardalos
September 2004, Volume 8, Issue 3
- 227-240 Equal Processing Time Bicriteria Scheduling on Parallel Machines
by Subhash C. Sarin & Divya Prakash - 241-265 Minimal Tetrahedralizations of a Class of Polyhedra
by Boting Yang & Cao An Wang - 267-294 On Approximate Graph Colouring and MAX-k-CUT Algorithms Based on the θ-Function
by E. de Klerk & D.V. Pasechnik & J.P. Warners - 295-306 Vertex and Tree Arboricities of Graphs
by Gerard J. Chang & Chiuyuan Chen & Yaping Chen - 307-328 Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee
by A.A. Ageev & M.I. Sviridenko - 329-361 Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results
by Clemens Heuberger - 363-379 Models and Bounds for Two-Dimensional Level Packing Problems
by Andrea Lodi & Silvano Martello & Daniele Vigo - 381-396 Even Cycles and Perfect Matching Problems with Side Constraints
by Elena Fernández & Oscar Meza
June 2004, Volume 8, Issue 2
- 115-128 Logical Constraints as Cardinality Rules: Tight Representation
by Egon Balas - 129-135 On Approximability of Boolean Formula Minimization
by Oleg A. Prokopyev & Panos M. Pardalos - 137-146 Batch-Processing Scheduling with Setup Times
by Chuangyin Dang & Liying Kang - 147-149 Comments on the Paper: Attacking the Market Split Problem with Lattice Point Enumeration
by Karen Aardal - 151-170 b-Tree Facets for the Simple Graph Partitioning Polytope
by Michael M. Sørensen - 171-181 Wide Diameters of Cartesian Product Graphs and Digraphs
by Jun-Ming Xu - 183-194 A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition
by Guohui Lin & Tao Jiang