Networks 2003: Vol 41 Index

7 Pages·2003·0.77 MB·English

NETWORKS
An International Journal
VOLUME 41, 2003
NUMBERS 1-4
NETWORKS
An International Journal
EDITORS-IN-CHIEF
Dr. Bruce L. Golden Dr. Douglas R. Shier
Robert H. Smith School of Business Clemson University
Van Munching Hall Dept, of Mathematical Sciences
University of Maryland Martin Hall
College Park, MD 20742 Box 340975
301-405-2232 Clemson, SC 29634-0975
[email protected] 864-656-1100
[email protected]
Submit manuscripts to: Dr. Bruce L. Golden, P.O. Box 149, Simpsonville, MD 21150.
ASSOCIATE EDITORS
R. K. Ahuja H. J. Broersma P. Jalliet A. B. Nagurney D. Simchi-Levi
C. Alexopoulos E. Cheng R. E. Jamison J. B. Orlin C.-P. Teo
A. Balakrishnan C. Colbourn M.-Y. Kao D. Peleg P. Toth
M. O. Ball F. Cornelias J. Kennington A. Proskurowski R. Vohra
J. E. Beasley U. Derigs A. Kershenbaum J. S. Provan G. Woeginger
J.-C. Bermond J. N. Hagstrom S. Khuller S. Raghavan R. K. Wood
D. Bertsimas D. S. Hochbaum R. Labahn J. Sethuraman
ADVISORY EDITORS
H. Frank R. L. Graham R. Karp C. Monma
B. Gavish M. Groetschel F. T. Leighton W. Pulleyblank
F. Glover S. L. Hakimi T. Magnanti
FOUNDING EDITORS
F. T. Boesch, Stevens Institute of Technology
I. T. Frisch, Polytechnic University
D. J. Kleitman, M.l.T.
PAST MANAGING EDITOR
C. L. Suffel, Stevens Institute of Technology
Networks (Print ISSN 0028-3045; Online ISSN 1097-0037 at Wiley Inter- address. For subscription inquiries, please call [phone]; E-mail:
Science, www.interscience.wiley.com) is published monthly except in Febru¬ [email protected].
ary, April, June, and November, two volumes per year, by Wiley Subscription Postmaster: Send address changes to Networks. Subscription Distribu¬
Services, Inc., a Wiley Company, 111 River Street, Hoboken, NJ 07030.
tion, c/o John Wiley & Sons, Inc., Ill River Street, Hoboken, NJ 07030, For
Copyright © 2003 Wiley Periodicals, Inc., a Wiley Company. All rights subscription inquiries, please call Customer Service at [phone] or write
reserved. No part of this publication may be reproduced in any form or by any to the above address.
means, except as permitted under Section 107 or 108 of the 1976 United
States Copyright Act, without either the prior written permission of the pub¬ Advertising Sales: Inquiries concerning advertising should be forwarded
lisher, or authorization through the Copyright Clearance Center, 222 Rose¬ to Advertising Sales Manager, c/o John Wiley & Sons, 111 River Street,
wood Drive, Danvers, MA 01923, [phone], fax [phone]. Peri¬ Hoboken, NJ 07030, [phone]. Advertising Sales, European Contacts:
odicals postage paid at Hoboken, NJ, and at additional mailing offices. Jackie Sibley, c/o John Wiley & Sons, Ltd., The Atrium, Southern Gate,
The copyright notice appearing at the bottom of the first page of an item Chichester, West Sussex P019 8SQ England. Tel: [phone]; Fax; 44
in the journal indicates the copyright holder's consent that copies may be 1243 770 432; e-mail: [email protected].
made for personal or internal use, or for the personal or internal use of specific
Reprints: Reprint sales and inquiries should be directed to the Customer
clients, on the condition that the copier pay for copying beyond that permitted
Service Department, c/o John Wiley & Sons, Inc., Ill River Street, Hoboken,
by Sections 107 and 108 of the United States Copyright Law. The per-copy
fee for each item is to be paid through the Copyright Clearance Center, Inc. NJ 07030. Tel: [phone].
This consent does not extend to other kinds of copying, such as copying Manuscripts should be submitted to Dr. Bruce L. Golden, P.O. Box 149,
for general distribution, for advertising or promotional purposes, for creating Simpsonville, MD 21150. A final version of your accepted manuscript should be
new collective works, or for resale. Such permission requests and other submitted on diskette as well as hard copy, using the guidelines for Disk Sub¬
permission inquiries should be addressed to the Permissions Department, c/o mission Instructions form usually included in most issues of the journal. Infor¬
John Wiley & Sons, Inc., Ill River Street, Hoboken, NJ 07030; (201) 748- mation for contributors appears in the first and last issue of each volume. All
6011, fax [phone], or visit http;//www.wiley.com/go/permissions. other correspondence should be addressed to: Networks, Publisher, c/o John
Subscription price (Volumes 41-42, 2003); Print only; $1430.00 in U.S., Wiley & Sons, Inc., Ill River Street, Hoboken, NJ, 07030.
$1510.00 in Canada and Mexico, $1578.00 outside North America. Electronic
only; $1430.00 worldwide. A combination price of $1502.00 in U.S., $1582.00 in The contents of this journal are indexed in the following; COMPUMATH
Canada and Mexico, $1650.00 outside North America, includes the subscription Citation Index®, CompuScience Computer Abstracts International Database
in both electronic and print formats. All subscriptions containing a print element, (CAID), a service of Emerald Reviews/Abstracts, Current Contents®/Engineering,
shipped outside U.S., will be sent by air. Payment must be made in U.S. dollars Computing and Technology, INSPEC, ISI Alerting Services (includes Research
drawn on a U.S. bank. Claims for undelivered copies will be accepted only after Alert®), MathSciNet/Mathematical Reviews/Current Mathematical Publications,
the following issue has been delivered. Please enclose a copy of the mailing label. Science Citation Index®, SciSearch® (also known as Science Citation Index-
Missing copies will be supplied when losses have been sustained in transit and Expanded), Zentralblatt MATH.
where reserve stock permits. Please allow four weeks for processing a change of Editorial Production: Jennifer English
©This paper meets the requirements of ANSI/NISO 239.48-1992 (Permanence of Paper).
NETWORKS
An International Journal
Author Index to Volume 41, 2003
Ahuja. R. K., Orlin. J. B.. Pallottino. S., and Scutella. M. G.: Designing Diameter-Constrained .Minimum-Spanning and
Dynamic Shortest Paths Minimizing Travel Times and Costs. Steiner Trees. 159
197
Averbakh. I., and Berman. O.: An lmpro\ed Algorithm for the
Hadjiconstantinou, E.: see Fontes. D. B. M. M.
Minmax Regret Median Problem on a Tree. 97
Hochbaum. D. S.: see Goldschmidt. O.
Berman. O.; see Averbakh. I.
Bermond. J.-C.. and Ceroi. S.: Minimizing SONET ADMs in jungnickel. D.: see Fremuth-Paeger, C.
Unidirectional WDM Rings with Grooming Ratio 3. 83
Bookbinder. J. H.: see Siiral. H. Kalcsics, J.. Nickel. S., and Puerto, J.: Multifacility Ordered Me¬
Brightwell. G.. Oriolo. G.. and Shepherd. F. B.: Reserving Resil¬ dian Problems on Networks: A Further Analysis. I
ient Capacity for a Single Commodity with Upper-Bound Con¬
straints. 87
Levin, A.: see Goldschmidt. O.
Lucena. A.: see Calheiros. F. C.
Calheiros. F. C.. Liicena. A., and de Souza. C. C.; Optimal Rect¬
angular Partitions. 51
Cardoso. D. M.. and de Sousa. J. F.; A Numerical Tool for Mul¬ .Magnanti. T. L.: see Gouveia. L.
tiattribute Ranking Problems. 229 Martins. E. Q. V.: see Paixao. J. M. P.
Ceroi. S.; see Bermond. J.-C.
Chepoi. V.. Noltemeier. H.. and Vaxes. Y.: Upgrading Trees
Nagurney. A.: Report: Some Recent Developments in Network
Under Diameter and Budget Constraints. 24
Economics, 68
Christotides. N.: see Fontes. D. B. M. M.
Nickel. S.: see Kalcsics. J.
Ch'maco. J. C. N.. Craveirinha. J. M. F.. and Pascoal. M. M. B.: A
Noltemeier, H.: see Chepoi, V.
Bicriterion Approach for Routing Problems in Multimedia Net¬
works. 206
Craveirinha. J. M. F.: see Ch'maco. J. C. N. Olinick. E. V.: see Goldschmidt. O.
Onn, S.. and Sperber. E.: Social Network Coordination and Graph
Routing. 44
de Almeida. A. M.. and Rodrigues. R.; Trees. Slices, and Wheels:
Oriolo, G.: see Brightwell. G.
On the Floorplan Area Minimization Problem. 23.3
Orlin, J. B.: see Ahuja. R. K.
de Sousa. J. F.: see Cardoso. D. M.
Ortega, F.. and Wolsey. L. A.: A Branch-and-Cut .Algorithm for
de Souza. C. C.: see Calheiros. F. C.
the Single-Commodity, Uncapacitated, Fixed-Charge Network
Dial. R. B.; Toward Faster Algorithms for Dynamic Traffic As¬
Flow Problem. 143
signment. I. Parametric Quickest-Path Trees. 36
Fontes. D. B. M. M.. Hadjiconstantinou. E.. and Christofides. N.: Paixao, J. M. P.. Martins. E. Q. V., Rosa. M. S., and Santos.
Upper Bounds for Single-Source Uncapacitated Concave Min¬ J. L. E.: The Determination of the Path with .Minimum-Cost
imum-Cost Network Flow Problems. 221 Norm Value, 184
Fiemuth-Paeger. C.. and Jungnickel. D.: Balanced Network Flows. Pallottino. S.: see Ahuja, R. K.
Vlll. A Revised Theory of Phase-Ordered Algorithms and the Pascoal. M. M. B.: see Ch'maco. J. C. N.
0{y/nm log(/r//»)log n) Bound for the Nonbipartite Cardinality Plesm'k, J.: Towards Minimum CGeodetically Connected Graphs.
Matching Problem, 137 73
Frommer. I., and Pundoor. G.: Small-Worlds: A Review of Recent Provan, J. S.: A Polynomial-Time Algorithm to Find Shortest
Books. 174 Paths w ith Recourse, 115
Puerto. J.: see Kalcsics. J.
Goldschmidt. O.. Flochbaum. D. S.. Levin. A., and Olinick. E. V.: Pundoor, G.: see Frommer. 1.
The SONET Edge-Partition Problem. 13
Gouveia. L.. and Magnanti, T. L.: Network Flow Models for Resende, M. G. C., and Ribeiro, C. C.: A GRASP with Path-
Relinking for Private Virtual Circuit Routing. 104
Ribeiro, C. C.: see Resende, M. G. C.
© 2(XB Wiley Periodicals. Inc. Rodrigues. R.: see de Almeida, A. .M.
NETWORKS—2003 247
Rosa, M. S.: Ernesto de Queiros Vieira Martins (1945-2000), 181 Siiral, H., and Bookbinder, J. H.: The Single-Vehicle Routing
Rosa. M. S.: see Paixao, J. M. P. Problem with Unrestricted Backhauls. 127
Santos, J. L. E.; see Paixao, J. M. P.
Vaxes, Y.: see Chepoi, V.
Scutella, M. G.: see Ahuja, R. K.
Shepherd, F, B.: see Brightwell, G.
Sperber, E.: see Onn, S. Wolsey, L, A,: see Ortega, F.
248 NETWORKS—2003
a
NETWORKS
An International Journal
Subject Index to Volume 41, 2003
Algorithms complexity. I Graph, 83
Antisymmetrical digraphs, 137 GRASP. 104
Approximation algorithms. 13, 44
Heuristics, 143, 221
Bandwidth packing. 104 Highway route guidance, 36
Bicriterion shortest path. 206 Hop-indexed models, 159
Branch and cut. 143
Branching. 143
K-ary trees. 235
Capacity reservation. 87
Lagrangian relaxation, 51
Cardinality matching problem, 137
Linear extensions, 229
Characteristic path length, 174
Local Search. 221
Clique partition, 137
Location theory. 1
Clustering coefficient. 174
Coloring. 44
Metaheuristics, 104
Combinatorial optimization, 13
Concave-cost optimization. 221 Minimum-cost flow, 143
Cuts. 24 Minimum-cost network flows. 221
Minimum-size graph, 73
Cutting planes. 51
Minmax regret optimization, 97
Mixed pickup and delivery, 127
Design theory. 83
Motion planning, 44
Diameter constraints. 159
Multiattribute ranking problems, 229
Diameter, 24
Multicommodity How mtxlels. 159
Dicut inequalities, 143
Multicommodity network flows. 104
Dijkstra, 115
Multicriteria problem. 235
Distance invulnerability, 73
Multimedia network. 206
Dominance relation, 184
Multiobjective shortest path, 184
Dynamic minimum paths, 36
Dynamic shortest path. 115, 197
Dynamic traffic assignment, 36 Network commerce and security. 68
Network design. 24, 143
Network economics, 68
Edge-partition. 83
Network effects, 68
Electronic commerce, 68
Network flows, 87, 137
Electronic trade networks. 68
Network industries. 68
Equipment placement in SONET rings. 13
Network upgrade, 24
Nondomination, 235
Facility location problems, 24, 97
Financial networks, 68
Offline rerouting. 104
Finite dominating sets, 1
Optimality properties, 51
Fixed charge. 143
Floorplan optimization, 235
Frame relay, 104 Parametric analysis. 36
Path ranking. 206
Geodetic connectivity, 73 Path-relinking. 104
Graph compression, 137 Planar graph, 44
Graph partitioning, 13 Polynomial algorithms, 97
Posets, 229
Power law. 174
Private carriage. 127
© 2(X)3 Wiley Periodicals, Inc. Private virtual circuit, 104
NETWORKS—2003 249
Ranking paths, 184 Super-networks, 68
Recourse, 115 Supply chain networks, 68
Rectangular partitions, 51 Survivable network, 1.^, 73
Resilience, 87
Routing problems, 206
Telecommunication networks, 68
Routing, 44, 104
Telecommunications networks, 13
Traffic grooming, 83
Scale-free networks, 174 Traffic network, 197
Science of networks, 174 Transportation networks, 68, 197
Shortest path, 115, 197 Trees, 24
Skew-symmetric graphs.
Small-worlds, 174
Vehicle routing with backhauls, 127
Spanning trees, 159
Steiner trees, 159
Stochastic network, 115 WDM rings, 83
250 NETWORKS—2003