Documente Academic
Documente Profesional
Documente Cultură
Handbook of Optimization in
Telecommunications (HOT)
A bibliography
Edited by Mauricio G. C. Resende and Panos M. Pardalos
This bibliography was prepared with the assistance of Sally Du (UC Berkeley) and Geraldo
Veiga (HTF Software).
3gpp
3rd Generation Partnership Project (3GPP), Technical Specification
3GPP
3GPP Organisational Partners Publications Offices, Sophia Antipolis - France.
http://www.3gpp.org , Vol. Release 4 , 2001
Ostergard02
A fast algorithm for the maximum clique problem
sterg}rd, P.R.J.
Discrete Applied Mathematics , Vol. 120 , pp. 197-207 , 2002
AlvGonDeA03a
Scatter search for a network design problem
lvarez, A.; Gonzlez, J.L. & De-Alba, K.
2003
pCyclesWebsite
TRLabs Network Systems Group $p$-cycles website.
A.Sack & W.D. Grover, h.
2005
BL2004
A Lagrangian heuristic for the linear ordering problem
A.~Belloni & A.~Lucena
pp. 123-151 , 2003
29.03.2006
JabRef Output
BL2000
A relax and cut algorithm for the traveling salesman problem
A.~Belloni & A.~Lucena
2000
BelSag2004
Dynamic Bundle Methods
A.~Belloni & C.~Sagastizbal
2004
L04
Non Delayed Relax-and-Cut Algorithms
A.~Lucena
Annals of Operations Research , 2004
L93
Steiner problem in graphs: Lagrangean relaxation and cutting planes
A.~Lucena
Proceedings of NETFLOW93 , pp. 147-154 , 1993
L92
Steiner problem in graphs: Lagrangean relaxation and cutting planes
A.~Lucena
COAL Bulletin , Vol. 21 , pp. 2-8 , 1992
Aa98
Capacitated facility location: Separation algorithms and
computational experience
Aardal, K.
Mathematical Programming , Vol. 81 , pp. 149-175 , 1998
aardal1
Capacitated facility location: separation algorithms and computational
29.03.2006
JabRef Output
experience
Aardal, K.
Mathematical Programming , Vol. 81 , pp. 149-175 , 1998
aardal2
Market split and basis reduction: towards a solution of the CornujolsDawande instances
Aardal, K.; Bixby, R.E.; Hurkens, C.A.J.; Lenstra, A.K. & Smeltink, J.W.
INFORMS Journal on Computing , Vol. 12 , pp. 192-202 , 2000
AaHoKoMaSa03
Models and Solution Techniques for Frequency Assignment Problems
Aardal, K.; van Hoesel, S.; Koster, A.; Mannino, C. & Sassano, A.
4OR , Vol. 1 , pp. 261-317 , 2003
aardal3
Solving a system of linear diophantine equations with lower and upper
bounds on the variables
Aardal, K.; Hurkens, C.A.J. & Lenstra, A.K.
Mathematics of Operations Research , Vol. 25 , pp. 427-442 , 2000
aardal5
Algorithms for radio link frequency assignment: the CALMA project
Aardal, K.; Hurkens, C.; Lenstra, J.K. & Tiourine, S.
Operations Research , Vol. 50 , pp. 968-980 , 2002
AaPoWo95
Capacitated facility location: Valid inequalities and facets
Aardal, K.; Pochet, Y. & Wolsey., L.A.
Mathematics of Operations Research , Vol. 20 , pp. 562-582 , 1995
aardal4
Preface: algebraic and geometric methods in discrete optimization
Aardal, K. & Thomas, R.R.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
AboElFotoh01
A neural approach to topological optimization of communication
networks, with reliability constraints
AboElFotoh, H. & Al-Sumait, L.
IEEE Transactions on Reliability , Vol. 50 , pp. 397-408 , 2001
aboudi1
A facet generation and relaxation technique applied to an assignment
problem with side constraints
Aboudi, R.; Hallefjord, .. & Jrnsten, K.
European J. Oper. Res , Vol. 50 , pp. 335-344 , 1991
Abrache-etal-2004
Design issues for combinatorial auctions
Abrache, J.; Crainic, T. & Gendreau, M.
4OR , Vol. 2(1) , pp. 1-33 , 2004
acevedo1
An algorithm for multiparametric mixed-integer linear programming
problems
Acevedo, J. & Pistikopoulos, E.N.
Operations Research Letters , Vol. 24(3) , pp. 139-148 , 1999
AchuthanCaccettaCaccettaGeelen1992
Algorithms for the minimum weight spanning tree with bounded diameter
problem
Achuthan, N.R.; Caccetta, L.; Caccetta, P. & Geelen, J.F.
Vol. 1 , pp. 297-304 , 1992
adam1
Security-control methods for statistical databases: a comparative
study
url
29.03.2006
JabRef Output
adam
The small world Web
Adamic, L.
Vol. 1696 , pp. 443-452 , 1999
ah
Power-law distribution of the World Wide Web
Adamic, L. & Huberman, B.
Science , Vol. 287 , pp. 2115a , 2000
adams3
Unconstrained 0-1 optimization and Lagrangian relaxation
Adams, W.P.; Billionnet, A. & Sutter, A.
Discrete Applied Mathematics , Vol. 29 , pp. 131-142 , 1990
adams2
On the equivalence between roof duality and Lagrangian duality for
unconstrained 0-1 quadratic programming problems
Adams, W.P. & Dearing, P.M.
Discrete Applied Mathematics , Vol. 48 , pp. 1-20 , 1994
adams1
Persistency in 0-1 polynomial programming
Adams, W.P.; Lassiter, J.B. & Sherali, H.D.
Mathematics of Operations Research , Vol. 23 , pp. 359-389 , 1998
adams4
Linearization strategies for a class of zero-one mixed integer programming
problems
Adams, W.P. & Sherali, H.D.
Operations Research , Vol. 38 , pp. 217-226 , 1990
adcock1
A simple algorithm to incorporate transactions costs in quadratic
optimization
29.03.2006
JabRef Output
29.03.2006
JabRef Output
AKRV2
Data structures and programming techniques for the implementation of
Karmarkar's algorithm
Adler, I.; Karmarkar, N.K.; Resende, M.G.C. & Veiga, G.
ORSA Journal on Computing , Vol. 1(2) , pp. 84-106 , 1989
AdMon1
Limiting behavior of the affine scaling continuous trajectories for linear
programming problems
Adler, I. & Monteiro, R.D.C.
Mathematical Programming , Vol. 50(1) , pp. 29-51 , 1991
AKRV
An implementation of Karmarkar's algorithm for linear programming
Adler, I.; Resende, M.G.C.; Veiga, G. & Karmarkar, N.K.
Mathematical Programming , Vol. 44(3) , pp. 297-335 , 1989
sonet90
Synchronous Optical Networks (SONET) Fiber Optic Transmission
Systems Requirements and Objectives
Advisory, B.T.
1990
afkhamie1
Interior point column generation algorithms for adaptive filtering
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
Ahmed, S.
2004
ahmed1
A Multi-stage Stochastic Integer Programming Approach for
Capacity Expansion under Uncertainty
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Inverse optimization
Ahuja, R.K. & Orlin, J.B.
Operations Research , Vol. 49 , pp. 771-783 , 2001
ahuja4
A fast scaling algorithm for minimizing separable convex functions subject
to chain constraints
Ahuja, R.K. & Orlin, J.B.
Operations Research , Vol. 49 , pp. 784-789 , 2001
ahuja2
Equivalence of the primal and dual simplex algorithms for the maximum
flow problem
Ahuja, R.K. & Orlin, J.B.
Operations Research Letters , Vol. 20 , pp. 101-108 , 1997
ahuja5
A composite very large-scale neighborhood structure for the capacitated
minimum spanning tree problem
Ahuja, R.K.; Orlin, J.B. & Sharma, D.
Operations Research Letters , Vol. 31 , pp. 185-194 , 2003
ahuja6
Multi-exchange neighborhood structures for the capacitated minimum
spanning tree problem
Ahuja, R.K.; Orlin, J.B. & Sharma, D.
Mathematical Programming , Vol. 91 , pp. 71-97 , 2001
AhuOrlSha98a
New neighborhood search structures for the capacitated minimum
spanning tree problem
Ahuja, R.K.; Orlin, J.B. & Sharma, D.
1998
AMO93
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
acl2
A random graph model for power law graphs
Aiello, W.; Chung, F. & Lu, L.
Experimental Math. , Vol. 10 , pp. 53-66 , 2001
aiex2
Parallel GRASP with path-relinking for job shop scheduling
url
url
url
shop scheduling
Aiex, R.; Binato, S. & Resende, M.
Parallel Computing , Vol. 29 , pp. 393-430 , 2003
AieResParTor00a
GRASP with path-relinking for three-index assignment
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
van der Akker, J.M.; van Hoesel, C.P.M. & Savelsbergh, M.P.W.
Mathematical Programming , Vol. 85(3) , pp. 541-572 , 1999
akker3
Parallel machine scheduling by column generation
van der Akker, J.M.; Hoogeveen, J.A. & van der Velde, S.L.
Operations Research , Vol. 47(6) , pp. 862-872 , 1999
akker2
Time-indexed formulations for machine scheduling problems: column
generation
van der Akker, J.M.; Hurkens, C.A.J. & Savelsbergh, M.P.W.
INFORMS Journal on Computing , Vol. 12(2) , pp. 111-124 , 2000
Akkerman03
The impact of ERP on supply chain management: Exploratory findings
from a European Delphi study
Akkerman, H.; Bogerd, P.; Yucesan, E. & van Wassenhove, L.
European Journal of Operational Research , Vol. 146 , pp. 284-301 , 2003
Akl01
Multicell CDMA Network Design
Akl, R.; Hegde, M.; Naraghi-Pour, M. & Min, P.
IEEE Transactions on Vehicular Technology , Vol. 50 , pp. 711-722 , 2001
akrotirianakis2
An outer approximation based branch and cut algorithm for convex
0-1 MINLP problems
url
url
29.03.2006
JabRef Output
1997
AktKil99a
Generating short-term observations for space mission projects
Akturk, M. & Kili, K.
J. of Intelligent Manufacturing , Vol. 10 , pp. 387-404 , 1999
AktOzd01a
A new dominance rule to minimize total weighted tardiness
url
29.03.2006
JabRef Output
albeverio1
On-line portfolio selection strategy with prediction in the presence
of transaction costs
url
29.03.2006
JabRef Output
weighted graphs
Alexander, M.J.; Cohoon, J.P.; Ganley, J.L. & Robins, G.
Proceedings of the European Design Automation Conference , pp. 259-264 , 1994
AlexanderRobins
A new approach to FPGA routing based on multi-weighted graphs
Alexander, M.J. & Robins, G.
Proceedings of the International Workshop on Field-Programmable Gate Arrays , 1994
alfakih1
An interior point method for the Euclidean distance matrix
completion problem
url
29.03.2006
JabRef Output
url
url
url
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
AllIsmKenOli03
An Incremental Procedure for Improving Path Assignment in a
Telecommunications Network
Allen, D.; Ismail, I.; Kennington, J. & Olinick, E.
Journal of Heuristics , Vol. 9 , pp. 375-399 , 2003
AlSmHu99
Lower Bounding Techniques for Frequency Assignment
Allen, S.M.; Smith, D.H. & Hurley, S.
Discrete Mathematics , Vol. 197/198 , pp. 41-52 , 1999
rfc2581
TCP Congestion Control
Allman, M.; Paxson, V. & Stevens, W.
1999
Al95
Um Modelo para Definico de uma Rede Backbone Pblica ATM
Almeida, J.A.
DCC/UFMG , 1995
AloAloRoc04
Scheduling workover rigs for onshore oil production
Aloise, D.; Aloise, D.; Rocha, C.; Ribeiro, C.; Filho, J.R. & Moura, L.
Discrete Applied Mathematics , 2005
alon86
A fast and simple randomized parallel algorithm for the maximal
independent set problem
Alon, N.; Babai, L. & Itai, A.
Journal of Algorithms , Vol. 7 , pp. 567-583 , 1986
alon1
Testing of clustering
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
AlvParTam02a
A tabu search algorithm for large-scale guillotine
url
29.03.2006
JabRef Output
GRASP
Alvim, A. & Ribeiro, C.
1998
alzoubi03
Weakly-Connected Dominating Sets and Sparse Spanners in Wireless Ad
Hoc Networks
Alzoubi, K.M.; Wan, P. & Frieder, O.
Proceedings of the 23rd International Conference on Distributed Computing Systems ,
pp. 96 , 2003
alzoubi03a
A simple parallel algorithm for the maximal independent set problem
Alzoubi, K.M.; Wan, P. & Frieder, O.
International Journal of Foundations of Computer Science , Vol. 14 , pp. 287-303 ,
2003
alzoubi02messg
Message-optimal connected dominating sets in mobile ad hoc networks
Alzoubi, K.M.; Wan, P. & Frieder, O.
Proceedings of the Third ACM International Symposium on Mobile Ad Hoc
Networking and Computing , pp. 157-164 , 2002
AWF02
Distributed heuristics for connected dominating sets in wireless ad hoc
networks
Alzoubi, K.M.; Wan, P. & Frieder, O.
Journal of Communications and Networks , Vol. 4 , pp. 22-29 , 2002
Alzoubi02
Distributed Heuristics for Connected Dominating Set in Wireless Ad Hoc
Networks
Alzoubi, K.; Wan, P. & Frieder, O.
Journal on Communication Networks , Vol. 4 , pp. 22-29 , 2002
29.03.2006
JabRef Output
ABCM04
Optimizing base station location and configuration in UMTS networks
Amaldi, E.; Belotti, P.; Capone, A. & Malucelli, F.
Annals of Operations Research , 2005
ACMS03
Optimizing base station location and configuration in UMTS networks
Amaldi, E.; Belotti, P.; Capone, A. & Malucelli, F.
Proceedings of the 1st International Network Optimization Conference (INOC) , 2003
ABMY05
On a new class of set covering problems arising in WLAN design
Amaldi, E.; Bosio, S.; Malucelli, F. & Yuan, D.
Proceedings of the 2nd International Network Optimization Conference (INOC) , Vol.
A , pp. 470-477 , 2005
ACCM04
Optimizing WLAN Radio Coverage
Amaldi, E.; Capone, A.; Cesana, M. & Malucelli, F.
Proceedings of the International Conference on Communication (ICC) , Vol. 1 , pp. 180184 , 2004
ACM05
Radio planning and coverage optimization of 3G cellular networks
Amaldi, E.; Capone, A. & Malucelli, F.
Wireless Networks , 2005
AmaCapMal03
Planning UMTS Base Station Location: Optimization Models With Power
Control and Algorithms
Amaldi, E.; Capone, A. & Malucelli, F.
IEEE Transactions on Wireless Communications , Vol. 2 , pp. 939-952 , 2003
AmaCapMal03a
Planning UMTS base station location: Optimization models with power
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
amis00
Max-min d-cluster formation in wireless ad hoc networks
Amis, A.; Prakash, R.; Vuong, T. & Huynh, D.
Proceedings of IEEE INFOCOM , 2000
AP00
Load-balancing clusters in wireless ad hoc networks
Amis, A.D. & Prakash, R.
Proceedings of Conference on Application-Specific Systems and Software Engineering
Technology (ASSET 2000) , pp. 25-32 , 2000
Ammar87
On the optimality of cyclic transmission in teletext systems
Ammar, M. & Wong, J.
IEEE Transactions on Communications , Vol. COM-35 , pp. 68-73 , 1987
An01
A mobility-based clustering approach to support mobility management
and multicast routing in mobile ad-hoc wireless networks
An, B. & Papavassiliou, S.
Intl. J. Network Management , Vol. 11 , pp. 387-395 , 2001
An:Tao
D.C. programming approach for multicommodity network optimization
problems with step increasing cost functions
An, L. & Tao, P.
Journal of Global Optimization , Vol. 22 , pp. 205-232 , 2002
an1
Globally minimizing a quadratic function under convex quadratic
constraints
An, L.T.H.
Mathematical Programming , Vol. 87 , pp. 401-426 , 2000
Ana02
29.03.2006
JabRef Output
url
Andersen, E.D.
INFORMS Journal on Computing , Vol. 11 , pp. 95-103 , 1999
andersen15
Linear Optimization: Theory, methods, and extensions
url
Andersen, E.D.
1998
andersen17
The MOSEK interior point optimizer for linear programming: an
implementation of the homogeneous algorithm
Andersen, E.D. & Andersen, K.D.
pp. 197-232 , 2000
andersen11
A parallel interior-point algorithm for linear programming on a
shared memory machine
url
url
29.03.2006
JabRef Output
homogeneous algorithm
Andersen, E.D. & Andersen, K.D.
1997
andersen1
Presolving in linear programming
Andersen, E.D. & Andersen, K.D.
Mathematical Programming , Vol. 71 , pp. 221-245 , 1996
andersen5
Implementation of interior point methods for large scale linear
programming
url
url
url
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
DeAngelisBomzeToraldo04
Ellipsoidal approach to box-constrained quadratic problems
de Angelis, P.L.; Bomze, I.M. & Toraldo, G.
J. Global Optimization , Vol. 28 , pp. 1-15 , 2004
anily1
A $53$-approximation algorithm for the clustered traveling salesman tour
and path problems
Anily, S.; Bramel, J. & Hertz, A.
Operations Research Letters , Vol. 24(1--2) , pp. 29-35 , 1999
anjos5
On semidefinite programming relaxations for the satisfiability
problem
url
Anjos, M.F.
2003
anjos4
A semidefinite programming approach for the nearest correlation
matrix problem
url
url
url
29.03.2006
JabRef Output
url
url
Anstreicher, K.M.
SIAM Journal on Optimization , Vol. 11 , pp. 254-265 , 2001
anstreicher30
Improved complexity for maximum volume inscribed ellipsoids
url
Anstreicher, K.M.
2001
anstreicher18
The volumetric barrier for semidefinite programming
url
Anstreicher, K.M.
Mathematics of Operations Research , Vol. 25 , pp. 365-380 , 2000
anstreicher29
Improved Linear Programming Bounds for Antipodal Spherical
Codes
url
Anstreicher, K.M.
29.03.2006
JabRef Output
2000
anstreicher15
Towards a Practical Volumetric Cutting Plane Method for Convex
Programming
url
Anstreicher, K.M.
SIAM Journal on Optimization , Vol. 9 , pp. 190-206 , 1999
anstreicher16
Ellipsoidal Approximations of Convex Sets Based on the Volumetric
Barrier
url
Anstreicher, K.M.
Mathematics of Operations Research , Vol. 24(1) , pp. 193-203 , 1999
anstreicher17
Linear Programming in $O([n^3/ n]L)$ Operations
url
Anstreicher, K.M.
SIAM Journal on Optimization , Vol. 9(4) , pp. 803-812 , 1999
anstreicher19
On the Equivalence of Convex Programming Bounds for Boolean
Quadratic Programming
url
Anstreicher, K.M.
1998
anstreicher22
The Volumetric Barrier for Convex Quadratic Constraints
url
Anstreicher, K.M.
1998
anstreicher10
On Vaidya's volumetric cutting plane method for convex
programming
url
Anstreicher, K.M.
Mathematics of Operations Research , Vol. 22 , pp. 63-89 , 1997
29.03.2006
JabRef Output
anstreicher9
Volumetric path following algorithms for linear programming
Anstreicher, K.M.
Mathematical Programming , Vol. 76 , pp. 245-263 , 1997
anstreicher14
Potential Reduction Algorithms
url
Anstreicher, K.M.
1995
anstreicher11
Large step volumetric potential reduction algorithms for linear
programming
url
Anstreicher, K.M.
1994
Ans7
On the performance of Karmarkar's algorithm over a sequence of
iterations
Anstreicher, K.M.
SIAM Journal on Optimization , Vol. 1(1) , pp. 22-29 , 1991
Ans8
On monotonicity in the scaled potential algorithm for linear programming
Anstreicher, K.M.
Linear Algebra and its Applications , Vol. 152 , pp. 223-232 , 1991
Ans6
A standard form variant, with safeguarded linesearch, for the modified
Karmarkar's algorithm
Anstreicher, K.M.
Mathematical Programming , Vol. 47(3) , pp. 337-351 , 1990
Ans3
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
url
url
url
29.03.2006
JabRef Output
2003
anstreicher12
A Monotonic Build-Up Simplex Algorithm For Linear Programming
Anstreicher, K.M. & Terlaky, T.
Operations Research , Vol. 42 , pp. 556-561 , 1994
anstreicher20
On Lagrangian Relaxation of Quadratic Matrix Constraints
url
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
Arikan84
Some complexity results about packet radio networks
Arikan, E.
IEEE Transactions on Information Theory , Vol. IT-30 , pp. 910-918 , 1984
ariyawansa2
On a new collection of stochastic linear programming test
problems
url
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
1996
arora1
Hardness of Approximations
Arora, S. & Lund, C.
1995
arora2
Proof verification and the hardness of approximation problems
Arora, S.; Lund, C.; Motwani, R.; Sudan, M. & Szegedy, M.
1997
ALMSS92
Proof verification and intractability of approximation problems
Arora, S.; Lund, C.; Motwani, R.; Sudan, M. & Szegedy, M.
Proc. 33rd IEEE Annual Symposium on Foundations of Computer Science , pp. 13-22 ,
1992
alm
Proof verification and hardness of approximation problems
Arora, S.; Lund, C.; Motwani, R. & Szegedy, M.
Journal of the ACM , Vol. 45 , pp. 501-555 , 1998
as
Approximating clique is NP-complete
Arora, S. & Safra, S.
Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science , pp. 213 , 1992
ArMaNg83
Le Probme de Steiner sur un Graphe Orient: Formulations et
Relaxations
Arpin, D.; Maculan, N. & Nguyen, S.
1983
29.03.2006
JabRef Output
ArrMarMezOrt01a
GRASP and tabu search algorithms for computing the
forwarding index in a graph
Arriz, E.; Martnez, A.; Meza, O. & Ortega, M.
Proceedings of MIC'2001 , pp. 367-370 , 2001
arsham1
Initialization of the simplex algorithm: an artificial-free approach
url
Arsham, H.
SIAM Review , Vol. 39 , pp. 736-744 , 1997
arthanari1
On the equivalence of the multistage-insertion and cycle-shrink
formulations of the traveling salesman problem
Arthanari, T.S. & Usha, M.
Operations Research Letters , Vol. 29 , pp. 129-139 , 2001
ascheuer1
Combinatorial online optimization in practice
Ascheuer, N.; Grtschel, M. & Rambau, J.
Optima , Vol. 57 , pp. 1-6 , 1998
ascheuer3
Solving the asymmetric travelling salesman problem with time windows by
branch-and-cut
Ascheuer, N.; Jnger, M. & Reinelt, G.
Mathematical Programming , Vol. 90 , pp. 475-506 , 2001
ascheuer2
A Branch & Cut Algorithm for the Asymmetric Traveling Salesman
Problem with Precedence Constraints
Ascheuer, N.; Jnger, M. & Reinelt, G.
Computational Optimization and Applications , Vol. 17 , pp. 61-84 , 2000
29.03.2006
JabRef Output
ASH5
Performance Evaluation of QoS-Routing Methods for IP-Based
Multiservice Networks
Ash, G.R.
Computer Communications , Vol. 26 , pp. 817-833 , 2003
ASH4
Dynamic Routing in Telecommunications Networks
Ash, G.R.
McGraw-Hill , 1998
Ash-book
Dynamic Routing in Telecommunication Networks
Ash, G.R.
McGraw-Hill , 1997
ACM81
Design and Optimization of Networks with Dynamic Routing
Ash, G.R.; Cardwell, R.H. & Murray, R.P.
Bell System Technical Journal , Vol. 60 , pp. 1787-1820 , 1981
ASH1
Design and Optimization of Networks with Dynamic Routing
Ash, G.R.; Cardwell, R.H. & Murray, R.P.
Bell System Technical Journal , Vol. 60 , pp. 1787-1820 , 1981
Ash-Chemouil
20 Years of Dynamic Routing in Telephone Networks:
Looking Backward to the Future
Ash, G.R. & Chemouil, P.
IEEE Global Communications Newsletter , pp. 1-4 , 2004
ASH6
20 Years of Dynamic Routing in Circuit-Switched Networks: Looking
29.03.2006
JabRef Output
29.03.2006
JabRef Output
ass01
Optical Networking and Real-Time Provisioning: An Integrated Vision for
the Next-Generation Internet
Assi, C.; Shami, A. & Ali, M.
IEEE Network , pp. 36-45 , 2001
01ass
On the merit of IP/MPLS protection/restoration in IP over WDM networks
Assi, C.; Ye, Y.; Shami, A.; Dixit, S.; Habib, I. & Ali, M.
Proceedings IEEE Global Telecommunications Conference (GLOBECOM 2001) , Vol.
1 , pp. 65 - 69 , 2001
atamturk5
Sequence independent lifting for mixed-integer programming
Atamtrk, A.
Operations Research , Vol. 52 , pp. 487-490 , 2004
atamturk6
On capacitated network design cut-set polyhedra
Atamtrk, A.
Mathematical Programming , Vol. 92 , pp. 425-452 , 2004
atamturk3
Flow pack facets of the single node fixed-charge flow polytope
Atamtrk, A.
Operations Research Letters , Vol. 29 , pp. 107-114 , 2001
atamturk2
A relational modeling system for linear and integer programming
Atamtrk, A.; Johnson, E.L.; Nemhauser, G.L. & Savelsbergh, M.W.P.
Operations Research , Vol. 48 , pp. 846-857 , 2000
atamturk7
Valid inequalities for problems with additive variable upper bounds
29.03.2006
JabRef Output
url
Atamturk, A.
2003
Atiqullah93
Reliability optimization of communication networks using simulated
annealing
Atiqullah, M. & Ro, S.
Microelectronics and Reliability , Vol. 33 , pp. 1303-19 , 1993
atkinson2
Scaling and interior point methods in optimization
D. S. Atkinson
University of Illinois at Urbana-Champaign , 1992
Atkinson1
A cutting plane algorithm for convex programming that uses analytic
centers
Atkinson, D.S. & Vaidya, P.M.
Mathematical Programming , Vol. 69 , pp. 1-43 , 1995
atkinson3
A scaling technique for finding the weighted analytic center of a polytope
Atkinson, D.S. & Vaidya, P.M.
Mathematical Programming , Vol. 57 , pp. 163-192 , 1992
29.03.2006
JabRef Output
Atk98a
A greedy randomised search heuristic for time-constrained vehicle
scheduling and the incorporation of a learning strategy
Atkinson, J.
Journal of the Operational Research Society , Vol. 49 , pp. 700-708 , 1998
atksss86
Min-Max Heaps and Generalized Priority Queues
Atkinson, M.; Sack, J.; Santoro, N. & Strothotte, T.
Communications of the ACM , Vol. 29 , pp. 996-1000 , 1986
AW98
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Attiya, H. & Welch, J.
McGraw-Hill Publishing Company , 1998
AudestadGaivoronskiWerner2002
Modeling market uncertainty and competition in telecommunication
environment: Network providers and virtual operators
Audestad, J.; A.~Gaivoronski & A.~Werner
Telektronikk , Vol. 97 , pp. 46-64 , 2002
audet1
A branch and cut algorithm for non-convex quadratically constrained
quadratic programming
Audet, C.; Hansen, P.; Jaumard, B. & Savard, G.
Mathematical Programming , Vol. 87 , pp. 131-152 , 2000
audet3
Analysis of generalized pattern searches
Audet, C. & J. E. Dennis, J.
SIAM Journal on Optimization , Vol. 13 , pp. 889-903 , 2003
audet2
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Awduche, D.
IEEE Communications Magazine , Vol. 37 , pp. 42-47 , 1999
AWDUCHE2
Overview and Principles of Internet Traffic Engineering
Awduche, D.; Chiu, A.; Elwalid, A.; Widjaja, I. & Xiao, X.
RFC 3272 , 2002
AWDUCHE3
Requirements for Traffic Engineering over MPLS
Awduche, D.; Malcolm, J.; Agogbua, J.; O'Dell, M. & McManus, J.
RFC 2702 , 1999
awduche:99
MPLS and Traffic Engineering in IP Networks
Awduche, D.O.
IEEE Communication Magazine , pp. 42-47 , 1999
te:02
Overview and Principles of Internet Traffic Engineering
Awduche, D.O.; Chiu, A.; Elwalid, A.; Widjaja, I. & Xiao, X.
2002
rfc2702
Requirements for Traffic Engineering Over MPLS
Awduche, D.O.; Malcolm, J.; Agogbua, J.; O'Dell, M. & McManus, J.
1999
awduche
Requirements for traffic engineering over MPLS
Awduche, D.; Malcolm, J.; Agogbua, J.; O'Dell, M. & McManus, J.
1999
Aw87
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
bahiense1
The Volume Algorithm revisited: relation with bundle methods
url
url
network expansion
Bahiense, L.; Oliveira, G. & Pereira, M.
IEEE Transactions on Power
Systems
, Vol. 16 , pp. 560-565 , 2001
bahn1
A cutting plane method from analytic centers for stochastic
programming
Bahn, O.; Du~Merle, O.; Goffin, J.L. & Vial, J.P.
Mathematical Programming , Vol. 69 , pp. 45-73 , 1995
bahn2
Experimental behavior of an interior-point cutting plane
algorithm for convex programming --- an application to geometric
programming
Bahn, O.; Goffin, J.L.; Vial, J.P. & Du~Merle, O.
Discrete Applied Mathematics , Vol. 49 , pp. 3-23 , 1994
bai1
Bounded error parameter estimation: A sequential analytic center
approach
url
29.03.2006
JabRef Output
1997
yqbai1
A new efficient large-update primal-dual interior-point method based on a
finite barrier
Bai, Y.Q.; Ghami, M.E. & Roos, C.
SIAM Journal on Optimization , Vol. 13 , pp. 766-782 , 2003
BakCar03a
A visual interactive approach to vehicle routing
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
balakrishnan2
Designing hierarchical survivable networks
Balakrishnan, A.; Magnanti, T.L. & Mirchandani, P.
Operations Research , Vol. 46(1) , pp. 116-136 , 1998
balakrishnan1
Network design
Balakrishnan, A.; Magnanti, T.L. & Mirchandani, P.
pp. 311-334 , 1997
BalakrishnanMagnantiShulmanWong1991
Models for planning capacity expansion in local access
telecommunications networks
Balakrishnan, A.; Magnanti, T.L.; Shulman, A. & Wong, R.T.
Annals of Operations Research , Vol. 33 , pp. 239-284 , 1991
BalakrishnanMagnantiWong1995
A decomposition algorithm for local access telecommunications network
expansion planning
Balakrishnan, A.; Magnanti, T.L. & Wong, R.T.
Operations Research , Vol. 43 , pp. 58-76 , 1995
Balakrishnan:Magnanti:Mirchandani_2004
Connectivity-splitting models for survivable network design
Balakrishnan, A.; Magnanti, T. & Mirchandani, P.
Networks , Vol. 43 , pp. 10-27 , 2004
BalakrishnanEtAl04
Connectivity-Splitting Models for Survivable Network Design
Balakrishnan, A.; Magnanti, T. & Mirchandani, P.
Networks , Vol. 43 , pp. 10-27 , 2004
Balakrishnan98
Designing hierarchical survivable networks
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Balas1
A lift-and-project cutting plane algorithm for mixed 0-1 programs
Balas, E.; Ceria, S. & Cornujols, G.
Mathematical Programming , Vol. 58 , pp. 295-324 , 1993
balas6
Gomory cuts revisited
Balas, E.; Ceria, S.; Cornujols, G. & Natraj, N.
Operations Research Letters , Vol. 19 , pp. 1-9 , 1996
balas5
Polyhedral methods for the maximum clique problem
Balas, E.; Ceria, S.; Cornujols, G. & Pataki, G.
1994
balas12
OCTANE: A new heuristic for pure 0--1 programs
Balas, E.; Ceria, S.; Dawande, M.; Margot, F. & Pataki, G.
Operations Research , Vol. 49 , pp. 207-225 , 2001
balas11
Lifted cycle inequalities for the asymmetric traveling salesman problem
Balas, E. & Fischetti, M.
Mathematics of Operations Research , Vol. 24(2) , pp. 273-292 , 1999
balas9
On the monotonization of polyhedra
Balas, E. & Fischetti, M.
Mathematical Programming , Vol. 78 , pp. 59-84 , 1997
balas8
The precedence-constrained asymmetric traveling salesman polytope
Balas, E.; Fischetti, M. & Pulleyblank, W.R.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
networks
Ball, M. & Provan, J.
Networks , Vol. 13 , pp. 253-78 , 1983
Ball77
Backtracking algorithms for network reliability analysis
Ball, M. & Slyke, R.V.
Discrete Applied Mathematics , Vol. 1 , pp. 49-64 , 1977
Ball:Vakhutinsky
Fault-tolerant virtual path layout in ATM networks
Ball, M. & Vakhutinsky, A.
INFORMS Journal on Computing , Vol. 13 , pp. 76-94 , 2000
BFC93
Core-based trees (CBT) -- An architecture for scalable inter-domain
multicast routing
Ballardie, A.; Francis, P. & Crowcroft, J.
Computer Communication Review , Vol. 23 , pp. 85-95 , 1993
Bandelt01
Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence
Spaces
Bandelt, H.
pp. 1-7 , 2001
bandelt1
Lifting theorems and facet characterization for a class of clique
partitioning inequalities
Bandelt, H.; Oosten, M.; Rutten, J.H.G.C. & Spieksma, F.C.R.
Operations Research Letters , Vol. 24 , pp. 235-243 , 1999
Bandyopadhyaya
Simulating sellers in online exchanges
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
BapatCohoonHeckJuRandall
Examining routing solutions
Bapat, S.; Cohoon, J.P.; Heck, P.L.; Ju, A. & Randall, L.J.
Proceedings of the Second Great Lakes Symposium on VLSI , 1992
Bapna00
A theoretical and empirical investigation of multi-item on-line auctions
Bapna, R.; Goes, P. & Gupta, A.
Information Technology and Management , Vol. 1 , pp. 1-23 , 2000
Bar
Origin-Based Algorithms for Transportation Network Modeling
Bar-Gera, H.
1999
bajb
Power-law distribution of the World Wide Web
Barabsi, A.; Albert, R.; Jeong, H. & Bianconi, G.
Science , Vol. 287 , pp. 2115a , 2000
barabasi
Emergence of Scaling in Random Networks
Barabsi, A. & Albert, R.
Science , Vol. 286 , pp. 509-512 , 1999
baj
Scale-free characteristics of random networks: the topology of the WorldWide Web
Barabsi, A.; Albert, R. & Jeong, H.
Physica A , Vol. 281 , pp. 69-77 , 2000
barahona15
Network reinforcement
url
29.03.2006
JabRef Output
Barahona, F.
2002
barahona10
On the $k$-cut problem
Barahona, F.
Operations Research Letters , Vol. 26(3) , pp. 99-106 , 2000
Bar96
Network design using cut inequalities
Barahona, F.
SIAM J. Optimization , Vol. 6 , pp. 823-837 , 1996
Barahona3
Network design using cut inequalities
Barahona, F.
SIAM Journal on Optimization , Vol. 6 , pp. 823-837 , 1996
barahona6
Ground state magnetization of Ising spin glasses
Barahona, F.
Physical Review B: Condensed Matter , Vol. 49(18) , pp. 2864-2867 , 1994
Ba92
Separating from the dominant of the spanning tree polytope
Barahona, F.
Operations Research Letters , Vol. 12 , pp. 201-204 , 1992
des92-6
Separating from the dominant of the spanning tree polytope
Barahona, F.
Op. Research Letters , Vol. 12 , pp. 201-203 , 1992
barahona11
29.03.2006
JabRef Output
url
url
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
bard1
Determining tax credits for converting nonfood crops to biofuels: an
application of bilevel programming
Bard, J.F.; Plummer, J. & Sourie, J.C.
pp. 23-50 , 1998
Bar97a
An analysis of a rail car unloading area for a consumer
url
products manufacturer
Bard, J.
Journal of the Operational Research Society , Vol. 48 , pp. 873-883 , 1997
BarFeo91a
An algorithm for the manufacturing equipment
url
url
url
selection problem
Bard, J. & Feo, T.
IIE Transactions , Vol. 23 , pp. 83-92 , 1991
BarFeo89a
Operations sequencing in discrete parts
manufacturing
Bard, J. & Feo, T.
Management Science , Vol. 35 , pp. 249-255 , 1989
BarFeoHol96a
A GRASP for scheduling printed wiring board
assembly
Bard, J.; Feo, T. & Holland, S.
I.I.E. Trans. , Vol. 28 , pp. 155-165 , 1996
29.03.2006
JabRef Output
BarHuaJaiDro98a
A decomposition approach to the inventory routing problem with satellite
facilities
Bard, J.; Huang, L.; Jaillet, P. & Dror, M.
Transportation Science , Vol. 32 , pp. 189-203 , 1998
BarKonYu02a
A branch-and-cut procedure for the vehicle routing
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Branch and price: column generation for solving huge integer programs
Barnhart, C.; Johnson, E.; Nemhauser, G.; Savelsbergh, M. & Vance, P.
Operations Research , Vol. 46 , pp. 316-329 , 1998
Baroni:Bayvel:Gibbens:Korotky
Analysis and design of resilient multifiber wavelength-routed optical
transport networks
Baroni, S.; Bayvel, P.; Gibbens, R. & Korotky, S.
Journal of Lightwave Technology , Vol. 17 , pp. 743-758 , 1999
BarGloKli79
Enhancement of spanning tree labeling procedures for network
optimization
Barr, R.; Glover, F. & Klingman, D.
INFOR , Vol. 17 , pp. 16-34 , 1979
BGKRS96
Designing and Reporting on Computational Experiments with Heuristic
Methods
Barr, R.; Golden, B.; Kelly, J.; Resende, M. & Stewart, W.
Journal of Heuristics , Vol. 1 , pp. 9-32 , 1995
barrpat01
Grooming Telecommunications Networks
Barr, R. & Patterson, R.
Optical Networks Magazine , Vol. 2 , pp. 20-23 , 2001
barr1
Designing and reporting on computational experiments with heuristic
methods
Barr, R.S.; Golden, B.L.; Kelly, J.P.; Resende, M.G.C. & Stewart, W.R.
Journal of Heuristics , Vol. 1 , 1996
Barr:Hickman_1994
Parallel simplex for large pure network problems: computational testing
29.03.2006
JabRef Output
url
V. Baryamureeba
Department of Informatics, University of Bergen , 2000
baryamureeba1
Properties of a class of preconditioners for weighted least squares
problems
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
battiti01
Reactive search for Traffic Grooming in WDM networks
Battiti, R. & Brunato, M.
Evolutionary Trends of the Internet , pp. 56-66 , 2001
BattitiProtasi01
Reactive local search for the maximum clique problem
Battiti, R. & Protasi, M.
Algorithmica , Vol. 29 , pp. 610-637 , 2001
BatTec92a
Parallel biased search for combinatorial optimization: Genetic algorithms
and Tabu
Battiti, R. & Tecchiolli, G.
Microprocessors and Microsystems , Vol. 16 , pp. 351-367 , 1992
B96
Multicast routing in point-to-point networks under constraints
F. Bauer
University of California, Santa Cruz , 1996
BV97
ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner
Algorithm
Bauer, F. & Varma, A.
IEEE Journal of Selected Areas in Communications , Vol. 15 , pp. 382-397 , 1997
BauerVarma
ARIES: A rearrangeable inexpensive edge-based on-line Steiner algorithm
Bauer, F. & Varma, A.
Proceedings IEEE INFOCOM '96 , pp. 361-368 , 1996
BauerVarma95
Degree-constrained multicasting in point-to-point networks
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
Beasley, J.
Journal of the Operational Research Society , Vol. 41 , pp. 1069-1072 , 1990
Be89
An SST-Based Algorithm for the Steiner Problem in Graphs
Beasley, J.
Networks , Vol. 19 , pp. 1-16 , 1989
Be88
An Algorithm for Solving Large Capacitated Warehouse Location Problems
Beasley, J.
Journal of the Operational Research Society , Vol. 33 , pp. 314-325 , 1988
Be85
A Note on Solving Large P-median Problems
Beasley, J.
European Journal of Operational Research , Vol. 21 , pp. 270 , 1985
Be84
An Algorithm for the Steiner Problem in Graphs
Beasley, J.
Networks , Vol. 14 , pp. 147-159 , 1984
Beasley84
An Algorithm for the Steiner Problem in Graphs
Beasley, J.
Networks , Vol. 14 , pp. 147-159 , 1984
Beasley:Chu
A Genetic Algorithm for the Set Covering Problem
Beasley, J. & Chu, P.
European Journal of Operations Research , Vol. 194 , pp. 392-404 , 1996
bea97
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
BB04
MiFi: Managed WiFi for QoS assurance, fairness and high throughput of
current IEEE 802.11 networks with multiple access points
Bejerano, Y. & Bhatia, R.
2004
BejCid01
Efficient Location Management Based on Moving Location Areas
Bejerano, Y. & Cidon, I.
Proc. IEEE INFOCOM 2001 , Vol. 1 , pp. 3-12 , 2001
belenguer1
A cutting plane algorithm for the capacitated arc routing problem
Belenguer, J.M. & Benavent, E.
Computers and Operations Research , Vol. 30 , pp. 705-728 , 2003
bellamy91
Digital Telephony
Bellamy, J.
John Wiley , 1991
bellavia1
An inexact interior point method for monotone NCP
Bellavia, S. & Macconi, M.
Optimization Methods and Software , Vol. 11 , pp. 211-241 , 1999
B57
Dynamic Programming
Bellman, R.
Princeton University Press , 1957
BELLMAN
Dynamic Programming
29.03.2006
JabRef Output
Bellman, R.E.
Princeton University Press , 1957
B58
On a routing problem
Bellman, R.
Quarterly of Applied Mathematics , Vol. 16 , pp. 87-90 , 1958
Bel58a
On a Routing Problem
Bellman, R.
Quart. Appl. Math. , Vol. 16 , pp. 87-90 , 1958
Bellman58
On a Routing Problem
Bellman, R.
Quarterly of Applied Mathematics , Vol. 16 , pp. 87-90 , 1958
sp58-1
On a routing problem
Bellman, R.
Q. Appl. Math. , Vol. 16 , pp. 87-90 , 1958
Bel57a
Dynamic Programming
Bellman, R.
Princeton Univ. Press , 1957
Belovich95
A design technique for reliable networks under a nonuniform traffic
distribution
Belovich, S.
IEEE Transactions on Reliability , Vol. 44 , pp. 377-87 , 1995
29.03.2006
JabRef Output
belton1
Multiple criteria decision analysis: An integrated approach
Belton, V. & Stewart, T.S.
Kluwer Academic Publishers , 2001
Belvaux:Boissin:Sutter:Wolsey
Optimal placement of add/drop multiplexers: static and dynamic models
Belvaux, G.; Boissin, N.; Sutter, A. & Wolsey, L.
European Journal of Operational Research , Vol. 108 , pp. 26-35 , 1998
Ben-Ameur:Gourdin
Internet routing and related topology issues
Ben-Ameur, W. & Gourdin, E.
SIAM Journal on Discrete Mathematics , Vol. 17 , pp. 18-49 , 2003
bental12
A Helly type theorem and semi-infinite programming
Ben-Tal, A.; Ben-Israel, A. & Rosinger, E.
pp. 127-135 , 1979
bental16
Adjustable robust solutions of uncertain linear programs
Ben-Tal, A.; Goryashko, A.; Guslitzer, E. & Nemirovski, A.
Mathematical Programming , Vol. 99 , pp. 351-376 , 2004
bental9
Optimal Design of Trusses Under a Nonconvex Global Buckling Constraint
Ben-Tal, A.; Jarre, F.; Kocvara, M.; Nemirovskii, A. & Zowe, J.
Optimization and Engineering , Vol. 1 , pp. 189-213 , 2000
bental7
Free material design via semidefinite programming: the multiload case
with contact conditions
Ben-Tal, A.; Kocvara, M.; Nemirovskii, A. & Zowe, J.
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
bental4
On the quality of SDP approximations of uncertain SDP programs
url
29.03.2006
JabRef Output
Benders, J.F.
Numerische Methematik , Vol. 4 , pp. 238-252 , 1962
ben62
Partitioning procedures for solving mixed variables programming
problems
Benders, J.
Numerische Mathematik , Vol. 4 , pp. 238-252 , 1962
Benders_1962
Partitioning procedures for solving mixed-variable programming
problems
Benders, J.
Numerische Mathematik , Vol. 4 , pp. 238-252 , 1962
bengtsson1
On portfolio selection: Improved covariance matrix estimation for
Swedish asset returns
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
bensonhy1
Interior-Point Methods for Nonconvex Nonlinear Programming:
Jamming and Comparative Numerical Testing
url
url
url
Benson, S.J.
2002
benson3
GPCG: A case study in the performance and scalability of
optimization algorithms
url
url
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
Berger:Raghavan
Long-Distance Access Network Design
Berger, R. & Raghavan, S.
Management Science , Vol. 50 , pp. 309-325 , 2004
Berg03
Power control and adaptive resource allocation in DS-CDMA systems
F. Berggren
Royal Institute of Technology , 2003
berkelaar4
The Optimal Set and Optimal Partition Approach to Linear and
Quadratic Programming
url
Berkelaar, A.B.
1997
berkelaar5
A primal-dual decomposition-based interior point approach to twostage stochastic linear programming
url
url
url
url
29.03.2006
JabRef Output
Programming
Berkelaar, A.B.; Sturm, J.F. & Zhang, S.
Applied Numerical Mathematics , Vol. 29 , pp. 317-333 , 1999
BermanRamaiyer
Improved approximations for the Steiner tree problem
Berman, P. & Ramaiyer, V.
Journal of Algorithms , Vol. 17 , pp. 381-408 , 1994
BR
Improved approximations for the Steiner tree problem
Berman, P. & Ramaiyer, V.
Journal of Algorithms , Vol. 17 , pp. 381-408 , 1994
BermanRamaiyerConf
Improved approximations for the Steiner tree problem
Berman, P. & Ramaiyer, V.
Proceedings of the Third Symposium on Discrete Algorithms , pp. 325-334 , 1992
Berman-Fujito-1999
On approximation properties of the independent set problem for low
degree graphs.
Berman, P. & Fujito, T.
Theory of Computing Systems , Vol. 32 , pp. 115-132 , 1999
03ber
Minimizing SONET ADMs in Unidirectional WDM Rings with Grooming
Ratio 3
Bermond, J. & Ceroi, S.
Networks , Vol. 41 , pp. 83-86 , 2003
02ber
Traffic grooming in unidirectional WDM ring networks using design
theory
29.03.2006
JabRef Output
29.03.2006
JabRef Output
B90
Graph Theoretic Models for Multicast Communications
Berry, L.
Computer Networks and ISDN Systems , Vol. 20 , pp. 95-99 , 1990
18ber
Reducing electronic multiplexing costs in SONET/WDM rings with
dynamically changing traffic
Berry, R. & Modiano, E.
IEEE Journal on Selected Areas in Communications , Vol. 18 , pp. 1961 - 1971 , 2000
ber00
Reducing Electronic Multiplexing Costs in SONET/WDM Rings with
Dynamically Changing Traffic
Berry, R. & Modiano, E.
IEEE Journal on Selected Areas in Communications , Vol. 18 , pp. 1961-1971 , 2000
01bmo
Grooming dynamic traffic in unidirectional SONET ring networks
Berry, R. & Modiano, E.
OFC/IOOC '99 , Vol. 1 , pp. 71 - 73 , 1999
Bertossi95
Code assignment for hidden terminal interference avoidance in
multihop packet radio networks
doi
29.03.2006
JabRef Output
29.03.2006
JabRef Output
ber95
Nonlinear Programming
Bertsekas, D.P.
Prentice-Hall , 1995
BerGal
Data Networks
Bertsekas, D.P. & Gallager, R.
Prentice-Hall , 1992
Ber98a
Network Optimization: Continuous and Discrete Models
Bertsekas, D.
Athena Scientific , 1998
Bertsekas98
Network optimization: Continuous and discrete models
Bertsekas, D.
Athena Scientific , 1998
Ber95a
Dynamic Programming and Optimal Control, Vol. 1--2
Bertsekas, D.
Athena Scientific , 1995
Ber91a
Linear networks optimization: Algorithms and Codes
Bertsekas, D.
MIT Press , 1991
Ber91b
An Auction Algorithm for shortest paths
Bertsekas, D.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Ber92
Data networks
Bertsekas, D. & Gallager, R.
Prentice-Hall , 1992
BerGueMu96a
Parallel Asynchronous Label Correcting Methods for
Shortest Paths
Bertsekas, D.; Guerriero, F. & Musmanno, R.
Journal of Optimization: Theory and Applications , Vol. 88 , pp. 297-320 , 1996
BerPalScu95a
Polynomial auction algorithms for Shortest Paths
Bertsekas, D.; Pallottino, S. & Scutell, M.
Computational Optimization and Application , Vol. 4 , pp. 99-125 , 1995
Ber89
Parallel and distributed computation -- Numerical methods
Bertsekas, D. & Tsitsiklis, J.
Prentice-Hall , 1989
Bertsekas87
Dynamic Programming. Deterministic and Stochastic Models
Bertsekas, D.
Prentice-Hall, Inc., Englewood Cliffs , 1987
bertsimas8
Portfolio construction through mixed-integer programming at Grantham,
Mayo, Van Otterloo and Company
Bertsimas, D.; Darnell, C. & Soucy, R.
Interfaces , Vol. 29 , pp. 49-66 , 1999
bertsimas3
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
bhargava1
The world wide web: opportunities for operations research and
management science
Bhargava, H.K. & Krishnan, R.
INFORMS Journal on Computing , Vol. 10 , pp. 359-383 , 1998
BD97
Routing in ad hoc networks using minimum connected dominating sets
Bharghavan, V. & Das, B.
Proceedings of ICC 1997 , 1997
Bharghavan97
Routing in Ad Hoc Networks Using Minimum Connected Dominating Sets
Bharghavan, V. & Das, B.
1997
BhaSahMuk03
An Approach for Location Area Planning in a Personal Communication
Services Network (PCSN)
Bhattacharjee, P.; Saha, D. & Mukherjee, A.
2003
Supratik-ICNP
Availability and Survivability in IP Networks
Bhattacharyya, S. & Iannaccone, G.
2003
Bianco:Guido:Leonardi
Incremental scheduling algorithms for WDM/TDM networks with
arbitrary tuning latencies
Bianco, A.; Guido, M. & Leonardi, E.
IEEE Transactions on Communications , Vol. 51 , pp. 464-475 , 2003
biegler1
Numerical experience with a reduced Hessian method for large
url
29.03.2006
JabRef Output
scale optimization
Biegler, L.; Nocedal, J.; Schmid, C. & Ternet, D.
1997
biemur01
Strong inequalities for capacitated survivable network design problems
Bienstock, C. & Muratore, G.
Mathematical Programming , Vol. 89 , pp. 127-147 , 2001
bie03
Potential Function Methods for Approximately Solving Linear
Programming Problems : Theory and Practice
Bienstock, D.
Kluwer Publishers , 2003
bienstock1
Computational study of a family of mixed-integer quadratic programming
problems
Bienstock, D.
Mathematical Programming , Vol. 74 , pp. 121-140 , 1996
Bi93a
Computational experience with an effective heuristic for some
capacity expansion problems in local access networks
Bienstock, D.
Telecommunication Systems , Vol. 1 , pp. 379-400 , 1993
Bi93b
A lot-sizing problem on trees, related to network design
Bienstock, D.
Mathematics of Operations Research , Vol. 18 , pp. 402-422 , 1993
des90-2
On the structure of minimum-weight
29.03.2006
JabRef Output
29.03.2006
JabRef Output
bienstock3
Computational integer programming (Foreword)
Bienstock, D. & Cook, W.
Mathematical Programming , Vol. 81 , pp. 147-148 , 1998
biegun96
Capacitated network design-polyhedral structure and computation
Bienstock, D. & Gnlk, O.
INFORMS Journal on Computing , pp. 243-259 , 1996
bienstock2
Computational experience with a difficult mixed integer multicommodity
flow problem
Bienstock, D. & Gnlk, O.
Mathematical Programming , Vol. 68 , pp. 213-237 , 1995
BiGu96
Capacitated network design - polyhedral structure and computation
Bienstock, D. & Gnlk, O.
INFORMS Journal on Computing , Vol. 8 , pp. 243-259 , 1996
BiGu95
Computational Experience with a Difficult Mixed-Integer Multicommodity
Flow Problem
Bienstock, D. & Gnlk, O.
Mathematical Programming , Vol. 68 , pp. 213-237 , 1995
bieg95
Computational Experience with a Difficult Mixed-integer Multicommodity
Flow Problem
Bienstock, D. & Gnlk, O.
Mathematical Programming , Vol. 68 , pp. 213-237 , 1995
Bienstock:Marcotte
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
BiKr77
Sharp Lower Bounds and Efficient Algorithms for the Simple Plant
Location Problem
Bilde, O. & Krarup, J.
Annals of Discrete Mathematics , Vol. 1 , pp. 79-97 , 1977
05bil
Multicast traffic grooming in WDM optical mesh networks
Billah, A.; Wang, B. & Awwal, A.
Proceedings IEEE Global Telecommunications Conference (GLOBECOM 2003) , Vol.
5 , pp. 2755 - 2760 , 2003
3bil
Effective traffic grooming in WDM rings
Billah, A.; Wang, B. & Awwal, A.
Proceedings IEEE Global Telecommunications Conference (GLOBECOM 2002) , Vol.
3 , pp. 2726 - 2730 , 2002
des73-1
Network design with fixed and variable
costs elements
Billheimer, J. & Gray, P.
Transportation Science , Vol. 7 , pp. 49-74 , 1973
billups3
Improving the robustness of descent-based methods for semi-smooth
equations using proximal perturbations
Billups, S.C. & Ferris, M.C.
Mathematical Programming , Vol. 87(1) , pp. 153-175 , 2000
billups2
QPCOMP: A quadratic programming based solver for mixed
complementarity problems
Billups, S.C. & Ferris, M.C.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
1999
BinOliAra01a
A greedy randomized adaptive search procedure for
url
url
Birge, J.R.
INFORMS Journal on Computing , Vol. 9 , pp. 111-133 , 1997
birge1
Decomposition and partitioning methods for multistage stochastic linear
programs
Birge, J.R.
Operations Research , Vol. 33 , pp. 989-1007 , 1985
29.03.2006
JabRef Output
birge2
A parallel implementation of the nested decomposition algorithm for
multistage stochastic linear programs
Birge, J.R.; Donohue, C.J.; Holmes, D.F. & Svintsitski, O.G.
Mathematical Programming , Vol. 75 , pp. 327-352 , 1996
birge5
Optimal flows in stochastic dynamic networks with congestion
Birge, J.R. & Ho, J.
Operations Research , Vol. 41 , pp. 203-216 , 1993
birge6
Introduction to Stochastic Programming
Birge, J.R. & Louveaux, F.
Springer , 1997
birge3
Designing approximation schemes for stochastic optimization problems,
in particular for stochastic programs with recourse
Birge, J.R. & Wets, R.J.
Mathematical Programming Study , Vol. 27 , pp. 54-102 , 1986
bilo97
Introduction to stochastic programming
Birge, J. & F.~Louveaux
Springer , 1997
Birkan:Kennington:Olinick:Ortynski:Spiride
Making a case for using integer programming to design DWDM networks
Birkan, G.; Kennington, J.; Olinick, E.; Ortynski, A. & Spiride, G.
Optical Networks Magazine , Vol. 4 , pp. 107-120 , 2003
birman95
Routing and wavelength assignment methods in single-hop all-optical
29.03.2006
JabRef Output
29.03.2006
JabRef Output
MIPLIB
MIPLIB: A test set of mixed integer programming problems
Bixby, R.E.; Boyd, E.A. & Indovina, R.R.
SIAM News , Vol. 25(2) , pp. 16 , 1992
MIPLIB3
An updated mixed integer programming library: MIPLIB 3.0
Bixby, R.E.; Ceria, S.; McZeal, C.M. & Savelsbergh, M.W.P.
Optima , Vol. 58 , pp. 12-15 , 1998
bixby6
Computational experience with parallel mixed integer programming in a
distributed environment
Bixby, R.E.; Cook, W.; Cox, A. & Lee, E.K.
Annals of Operations Research , Vol. 90 , pp. 19-43 , 1999
bixby8
Parallel mixed integer programming
Bixby, R.E.; Cook, W.; Cox, A. & Lee, E.K.
1995
Bixby9111
Very large-scale linear programming: a case study in combining interior
point and simplex methods
Bixby, R.E.; Gregory, J.W.; Lustig, I.J.; Marsten, R.E. & Shanno, D.F.
Operations Research , Vol. 40 , pp. 885-897 , 1992
bixby7
Solving a truck dispatching scheduling problem using branch-and-cut
Bixby, R.E. & Lee, E.K.
Operations Research , Vol. 46 , pp. 355-367 , 1998
bixby9
Parallelizing the dual simplex method
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Bixby:Cook:Cox:Lee2
Computational experience with parallel mixed integer programming in a
distributed environment
Bixby, R.; W.~Cook; A.~Cox & E.~K.~Lee
Annals of Operations Research, Special Issue on Parallel Optimization , 1997
Bixby:Cook:Cox:Lee
Parallel Mixed Integer Programming
Bixby, R.; W.~Cook; A.~Cox & E.~K.~Lee
1995
Bixby:Wagner
A note on Detecting Simple Redundancies in Linear Systems
Bixby, R. & Wagner, D.
Operations Research Letters , Vol. 6 , pp. 15-18 , 1987
Bjo
Least Squares Methods
Bjrck, A.
1988
DIFFSERV
An Architecture for Differentiated Services
Blake, S.; Black, D.; Carlson, M.; Davies, E.; Wang, Z. & Weiss, W.
RFC 2475 , December 1998
BlaJen92
On the computational behavior of a polynomial-time network flow
algorithm
Bland, R. & Jensen, D.
Mathematical Programming , Vol. 54 , pp. 1-41 , 1992
BleyEtAl2003
Kosten- und Qualittsoptimierung in Kommunikationsnetzen
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
url
url
Bohnenblust, J.
1940s
29.03.2006
JabRef Output
Bo94
A faster version of the ASG algorithm
Boland, N.; Ernst, A.; Goh, C. & Mees, A.
Applied Mathematics Letters , Vol. 7 , pp. 23-27 , 1994
Bo91
An algorithm for solving quadratic network flow problems
Boland, N.; Goh, C. & Mees, A.
Applied Mathematics Letters , Vol. 4 , pp. 61-64 , 1991
Bo91b
An algorithm for non-linear network programming: Implementation,
results and comparisons
Boland, N.; Goh, C. & Mees, A.
Journal of Operational Research Society , Vol. 42 , pp. 979-992 , 1991
boldi2002
Ubicrawler: A scalable fully distributed web crawler
Boldi, P.; Codenotti, B.; Santini, M. & Vigna, S.
Proc. AusWeb02. The Eighth Australian World Wide Web Conference , 2002
bollapragada2
Scheduling commercials on broadcast television
Bollapragada, S. & Garbiras, M.
Operations Research , Vol. 52 , pp. 337-345 , 2004
bollapragada1
Optimal design of truss structures by logic-based branch and cut
Bollapragada, S.; Ghattas, O. & Hooker, J.N.
Operations Research , Vol. 49 , pp. 42-51 , 2001
BollobasEtAl04
On the value of a random minimum weigth Steiner tree
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
1993
bonnans2
Sequential quadratic programming with penalization of the displacement
Bonnans, J.F. & Launay, G.
SIAM Journal on Optimization , Vol. 5 , pp. 792-812 , 1995
bonnans5
Perturbed path following predictor-corrector interior point algorithms
Bonnans, J.F.; Pola, C. & Rebai, R.
Optimization Methods and Software , Vol. 11 , pp. 183-210 , 1999
bonnans3
On the convergence of the iteration sequence of infeasible path following
algorithms for linear complementarity problems
Bonnans, J.F. & Potra, F.
Mathematics of Operations Research , Vol. 22 , pp. 378-407 , 1997
bonnans6
Perturbation Analysis of Optimization Problems
Bonnans, J.F. & Shapiro, A.
Springer-Verlag , 2001
bonnans4
Optimization problems with perturbations: A guided tour
Bonnans, J.F. & Shapiro, A.
SIAM Review , Vol. 40 , pp. 228-264 , 1998
BGLS97
Optimisation numrique: Aspects thoriques et pratiques
Bonnans, J.; Gilbert, J.; C.~Lemarchal & C.~Sagastizbal
Springer Verlag , 1997
rebbonhadlis00
Proximal decomposition method for solving global survivability in
29.03.2006
JabRef Output
telecommunication networks
Bonnans, J.; Haddou, M.; Lisser, A. & R.Rba
2000
Bonner64
On some clustering techniques
Bonner, R.E.
IBM J. Res. Develop. , Vol. 8 , pp. 22-32 , 1964
Bonomi:Lutton
The N-City Traveling Salesman Problem: Statistical Mechanics and the
Metropolis Algorithm
Bonomi, E. & Lutton, J.
SIAM Review , Vol. 26 , pp. 551-568 , 1984
Bonuccelli97
On scheduling variable length broadcasts in wireless networks
Bonuccelli, M.A. & Leonardi, S.
Telecommunication Systems , Vol. 8 , pp. 211-227 , 1997
boon1
Team formation: Matching quality supply and quality demand
Boon, B.H. & Sierksma, G.
European J. Oper. Res , Vol. 148 , pp. 277-292 , 2003
BoFr77
Large-Scale Network Topological Optimization
Boorstyn, R. & Frank, H.
IEEE Transactions on Communications , Vol. COM-25 , pp. 29-47 , 1977
Booth
Analytic formulas for full Steiner trees
Booth, R.S.
Discrete and Computational Geometry , Vol. 6 , pp. 69-82 , 1991
29.03.2006
JabRef Output
BorchersDu
The $k$-Steiner ratio in graphs
Borchers, A. & Du, D.
SIAM Journal of Computing , Vol. 26 , pp. 857-869 , 1997
brian14
Implementation issues in CSDP
url
Borchers, B.
2001
brian11
CSDP, a C library for semidefinite programming
url
Borchers, B.
Optimization Methods and Software , Vol. 11 , pp. 613-623 , 1999
brian13
CSDP 2.3 user's guide
Borchers, B.
Optimization Methods and Software , Vol. 11 , pp. 597-611 , 1999
SDPLIB
SDPLIB 1.2, a library of semidefinite programming test problems
Borchers, B.
Optimization Methods and Software , Vol. 11 , pp. 683-690 , 1999
Brian.thesis
Improved branch and bound algorithms for integer programming
B. Borchers
Rensselaer Polytechnic Institute , 1992
brian6
A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT
problems
29.03.2006
JabRef Output
29.03.2006
JabRef Output
1991
brianproj
Borchers, B.
1996
Bordoefer
Aspects of set packing, partitioning, and covering
Bordoefer, R.
1997
borgwardt2
A sharper upper bound for the expected number of shadow vertices in LPpolyhedra under orthogonal projection on two-dimensional planes
Borgwardt, K.H.
Mathematics of Operations Research , Vol. 24(3) , pp. 544-603 , 1999
Bor
The Simplex Method: A Probabilistic Analysis
Borgwardt, K.H.
Springer-Verlag , 1986
Bo03
Dynamic Cesaro-Wardrop equilibration in networks
Borkar, V. & Kumar, P.
IEEE Trans. Autom. Control , Vol. 48 , pp. 382-396 , 2003
BoEiGrMa98a
Frequency assignment in cellular phone networks
Borndrfer, R.; Eisenbltter, A.; Grtschel, M. & Martin, A.
Annals of Operations Research , Vol. 76 , pp. 73-93 , 1998
BoEiGrMa98b
The orientation model for frequency assignment problems
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Borst94b
Optimization of Fixed Time Polling Schemes
Borst, S.; Boxma, O.J.; Harink, J. & Huitema, G.
Telecommunications Systems , Vol. 3 , pp. 31-59 , 1994
BoTaRiQuBe96
A Methodology to SDH Networks Design Using Optimization Tools
Bortolon, S.; Tavares, H.; Ribeiro, R.; Quaglia, E. & Bergamaschi, M.
Proceedings of IEEE GLOBECOM 1996 , pp. 1867-1871 , 1996
borwein2
Direct theorems in semi-infinite convex programming
Borwein, J.M.
Mathematical Programming , Vol. 21 , pp. 301-318 , 1981
borwein1
Convex analysis and nonlinear optimization
Borwein, J.M. & Lewis, A.S.
Springer , 2000
bosch4
Maximum density stable patterns in variants of Conway's game of life
Bosch, R.A.
Operations Research Letters , Vol. 27 , pp. 7-11 , 2000
bosch3
Integer Programming and Conway's Game of Life
Bosch, R.A.
SIAM Review , Vol. 41(3) , pp. 596-604 , 1999
bosch2
The battle of the burger chains: Which is best --- Burger King, McDonald's,
or Wendy's?
Bosch, R.A.
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
bourjolly1
A combinatorial column generation algorithm for the maximum stable set
problem
Bourjolly, J.; Laporte, G. & Mercure, H.
Operations Research Letters , Vol. 20 , pp. 21-29 , 1997
Bo78
A heuristic technique for assigning frequencies to mobile radio nets
Box, F.
IEEE Transactions on Vehicular Technology , Vol. 27 , pp. 57-74 , 1978
Boxma93
Efficient Visit Orders for Polling Systems
Boxma, O.; H.~Levy & Weststrate, J.
Performance Evaluation , Vol. 18 , pp. 103-123 , 1993
Boxma91
Efficient Visit Frequencies for Polling Tables: Minimization of Waiting
Cost
Boxma, O.; Levy, H. & Weststrate, J.
Queueing Systems (QUESTA) , 1994
Boyce
An improved program for the full Steiner tree problem
Boyce, W.M.
ACM Transactions on Mathematical Software , Vol. 3 , pp. 359-385 , 1977
BoyceSeery
STEINER 72: An improved version of Cockayne and Schiller's program
STEINER for the minimal network problem
Boyce, W.M. & Seery, J.E.
1973
aboyd2
A fully polynomial epsilon approximation cutting plane algorithm for
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
doi
Brlaz, D.
Communications of the ACM , Vol. 22 , pp. 251-256 , 1979
Brackett89
Dense wavelength division networks: principles and applications
Brackett, C.
IEEE Journal of Selected Areas in Communications , Vol. 8 , pp. 948-964 , 1990
BraBroGra77
Design and implementation of large-scale primal transshipment
algorithms
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Bra68
ber ein paradoxen der werkehrsplannung
Braess, D.
Unternehmenforschung , Vol. 12 , pp. 256-268 , 1968
Braess
Uber ein Paradoxon der Verkehrsplanung
Braess, D.
Unternehmenforschung , Vol. 12 , pp. 258-268 , 1968
brailsford1
Organizing a social event - A difficult problem of combinatorial
optimization
Brailsford, S.C.; Hubbard, P.M.; Smith, B.M. & Williams, H.P.
Computers and Operations Research , Vol. 23 , pp. 845-856 , 1996
bramel1
Probabilistic Analysis of a vehicle routing problem with time windows
Bramel, J.; Li, C. & Simchi-Levi, D.
pp. 267-322 , 1993
bramel2
On the effectiveness of set covering formulations for the vehicle routing
problem with time windows
Bramel, J. & Simchi-Levi, D.
Operations Research , Vol. 45 , pp. 295-301 , 1997
BramSim
The Logic of Logistics: Theory, Algorithms, and Applications for Logistics
Management
Bramel, J. & Simchi-Levi, D.
Springer-Verlag , 1997
bra87
Algorithmique: conception et analyse
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Brecht88
Lower bounds on two-terminal network reliability
Brecht, T. & Colbourn, C.
Discrete Applied Mathematics , Vol. 21 , pp. 185-98 , 1988
Brecht86
Improving reliability bounds in computer networks
Brecht, T. & Colbourn, C.
Networks , Vol. 16 , pp. 369-80 , 1986
breedam1
Improvement heuristics for the vehicle routing problem based on
simulated annealing
Breedam, A.V.
European J. Oper. Res , Vol. 86 , pp. 480-490 , 1995
Bre79
New methods to color the vertices of a graph
Brelaz, D.
Communications of the ACM , Vol. 22 , pp. 251-256 , 1979
Bre96a
Heuristic-biased stochastic sampling
Bresina, J.
Proceedings of the Thirteenth National Conference on Artificial Intelligence , pp. 271278 , 1996
Breu93
Unit disk graph recognition is NP-hard
Breu, H. & Kirkpatrick, D.G.
1993
Breu:Burdet
Branch and Bound Experiments in Zero-One Programming
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
brixius4
The Steinberg Wiring Problem
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Brown93
Network transformations and bounding network reliability
Brown, J.; Colbourn, C. & Devitt, J.
Networks , Vol. 23 , pp. 1-17 , 1993
broyden2
On the discovery of the ``good Broyden'' method
Broyden, C.G.
Mathematical Programming , Vol. 87 , pp. 209-213 , 2000
broyden1
A class of methods for solving nonlinear simultaneous equations
Broyden, C.G.
Mathematics of Computation , Vol. 19 , pp. 577-593 , 1965
brun03
A Multistart Randomized Greedy Algorithm for Traffic Grooming on Mesh
Logical Topologies
Brunato, M. & Battiti, R.
Next Generation Optical Network Design and Modelling , 2003
BruBat01a
A multistart randomized greedy algorithm for traffic
grooming on mesh logical topologies
Brunato, M. & Battiti, R.
2001
Brunetta:Conforti:Fischetti
A polyhedral approach to an integer multicommodity flow problem
Brunetta, L.; Conforti, M. & Fischetti, M.
Discrete Applied Mathematics , Vol. 101 , pp. 13-36 , 2000
brunetta1
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
Burer, S.
2002
burer13
Local minima and convergence in low-rank semidefinite
programming
url
url
url
url
29.03.2006
JabRef Output
url
url
url
url
url
29.03.2006
JabRef Output
url
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
1999
burke5
Variational Analysis of Non-Lipschitz Spectral Functions
url
url
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
1999
butnariu3
url
ON UNIFORM CONVEXITY, TOTAL CONVEXITY AND THE
CONVERGENCE OF THE PROXIMAL POINT AND OUTER BREGMAN
PROJECTION ALGORITHMS IN BANACH SPACES
Butnariu, D.; Iusem, A. & Zalinescu, C.
2001
butnariu2
AVERAGED SUBGRADIENT METHODS FOR CONSTRAINED
CONVEX OPTIMIZATION AND NASH EQUILIBRIA COMPUTATION
url
url
url
url
url
29.03.2006
JabRef Output
2001
byrd4
Feasible Interior Methods Using Slacks for Nonlinear Optimization
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
(k)-edge-connected graph
Cai, G. & Sun, Y.
Networks , Vol. 19 , pp. 151-172 , 1989
cai1
Time-varying minimum cost flow problems
Cai, X.; Sha, D. & Wong, C.
European J. Oper. Res , Vol. 131 , pp. 352-374 , 2001
CalGKW97
Genetic approach to radio network optimization for mobile systems
Calgari, P.; Guidec, F.; Kuonen, P. & Wagner, D.
Proceedings of IEEE VTC 97 , pp. 755-759 , 1997
CVJ
A new technique for generating quadratic programming test problems
Calamai, P.H.; Vincente, L.N. & Judice, J.J.
Mathematical Programming , Vol. 61 , pp. 215-231 , 1993
cmp
The fractal properties of Internet
Caldarelli, G.; Marchetti, R. & Pietronero, L.
Europhysics Letters , Vol. 52 , pp. 386-391 , 2000
CalinescuZelikovsky04
The Polymatroid Steiner Problems
Calinescu, G. & Zelikovsky, A.
pp. 234-245 , 2004
Callon-DRCN
Availability and Security for IP Data Networks
Callon, R.
2003
29.03.2006
JabRef Output
isis
Use of OSI IS-IS for Routing in TCP/IP and Dual Environments
Callon, R.
1990
Calvert97
Braess's paradox in a queueing network with state-dependent routing
Calvert, B.; Solomon, W. & Ziedins, I.
Journal of Applied Prob. , Vol. 34 , pp. 134-154 , 1997
calvert
Modeling Internet topology
Calvert, K. & Zegura, M.D.E.
IEEE Communications Magazine , Vol. 35 , pp. 160-163 , 1997
CZD95
Core Selection Methods for Multicast Routing
Calvert, K.; Zegura, E. & Donahoo, M.
IEEE ICCCN'95 , pp. 638-642 , 1995
Camp1
A nonlinear optimization approach for solving facility layout problems
van Camp, D.J.; Carter, M.W. & Vannelli, A.
European J. Oper. Res , Vol. 57 , pp. 174-189 , 1992
CamSav03a
Incentive Schemes for Consumer Direct Delivery
Campbell, A. & Savelsbergh, M.
2003
CamSav02a
Decision Support for Consumer Direct Grocery Initiatives
Campbell, A. & Savelsbergh, M.
29.03.2006
JabRef Output
2002
campbell1
Kernel Methods: A Survey of Current Techniques
url
Campbell, C.
2000
Campell
Integer programming formulations of discrete hub location problems
Campbell, J.
European Journal of Operational Research , Vol. 72 , pp. 387-405 , 1994
CaMa94
Algoritmos e Heuri sticas Desenvolvimento e Avaliaco de Performance
Campello, R. & Maculan, N.
EDUFF , 1994
Cancela95
A recursive variance-reduction algorithm for estimating communicationnetwork reliability
Cancela, H. & Khadiri, M.E.
IEEE Transactions on Reliability , Vol. 44 , pp. 595-602 , 1995
CancelaRobledoRubino04
A GRASP algorithm with RNN based local search for designing a WAN
access network
Cancela, H.; Robledo, F. & Rubinob, G.
Electronic Notes in Discrete Mathematics , Vol. 18 , pp. 59-65 , 2004
CannellEtAl03
Service Control for Next-Generation Applications in Wireless IP
Multimedia Networks
Cannell, L.; Grech, M.; Lee, A. & Unmehopa, M.
Bell Labs Technical Journal , Vol. 8 , 2003
29.03.2006
JabRef Output
CaHo
Large-scaled 0/1 linear programming on distributed workstations
Cannon, T.L. & Hoffman, K.L.
Annals of Operations Research , Vol. 22 , pp. 181-217 , 1990
CanCalCabVeg02a
Procedimientos constructivos adaptivos (GRASP) para el
problema
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Cao:Anand:Yizhi:Chunming
A study of waveband switching with multilayer multigranular optical
cross-connects
Cao, X.; Anand, V.; Yizhi, X. & Chunming, Q.
IEEE Journal on Selected Areas in Communications , Vol. 21 , pp. 1081-1095 , 2003
03cav
Performance evaluation of wavelength band switching in multifiber alloptical networks
Cao, X.; Anand, V.; Xiong, Y. & Qiao, C.
Proceedings of IEEE INFOCOM 2003 , Vol. 3 , pp. 2251 - 2261 , 2003
CapR01
Call Admission Control Techniques for UMTS
Capone, A. & Redana, S.
Proceedings of IEEE VTC Fall 2001 , 2001
CapT99
Channel assignment problem in cellular systems: A new model and Tabu
Search algorithm
Capone, A. & Trubian, M.
IEEE Trans. on Vehicular Technology , Vol. 48 , pp. 1252-1260 , 1999
TarC02
A bioelectromagnetic overview of the Universal Mobile
Telecommunication System (UMTS)
Cappelli, M. & Tarricone, L.
Proceedings of IEEE MTT-S International Microwave Symposium Digest , Vol. 3 , pp.
2265-2268 , 2002
caprara2
Branch and cut algorithms
Caprara, A. & Fischetti, M.
1997
caprara1
29.03.2006
JabRef Output
$0,12$-Chvtal-Gomory cuts
Caprara, A. & Fischetti, M.
Mathematical Programming , Vol. 74 , pp. 221-235 , 1996
caprara5
On the separation of maximally violated mod-$k$ cuts
Caprara, A.; Fischetti, M. & Letchford, A.N.
Mathematical Programming , Vol. 87(1) , pp. 37-56 , 2000
caprara7
Modeling and solving the train timetabling problem
Caprara, A.; Fischetti, M. & Toth, P.
Operations Research , Vol. 50 , pp. 851-861 , 2002
caprara6
On the separation of split cuts and related inequalities
Caprara, A. & Letchford, A.N.
Mathematical Programming , Vol. 94 , pp. 279-294 , 2002
caprara4
Exact solution of the quadratic knapsack problem
Caprara, A.; Pisinger, D. & Toth, P.
INFORMS Journal on Computing , Vol. 11 , pp. 125-137 , 1999
caprara3
Modeling and solving the crew rostering problem
Caprara, A.; Toth, P.; Fischetti, M. & Vigo, D.
Operations Research , Vol. 46 , pp. 820-830 , 1998
caroe2
Dual decomposition in stochastic integer programming
Car, C.C. & Schultz, R.
Operations Research Letters , Vol. 24(1--2) , pp. 37-45 , 1999
29.03.2006
JabRef Output
caroe1
L-shaped decomposition of two-stage stochastic programs with integer
recourse
Car, C.C. & Tind, J.
Mathematical Programming , Vol. 83 , pp. 451-464 , 1998
CarFerKak01
Fractional Path Coloring with Applications to WDM Networks
Caragiannis, I.; Ferreira, A. & Kakllamanis, C.
Proceedings of the 28th International Colloquium on Automata, Languages, and
Programming , pp. 732-743 , 2001
00car
All-optical wavelength shifting of subcarrier channels using differencefrequency-generation in a PPLN
Cardakli, M.; Sahin, A.; Adamczyk, O.; Willner, A.; Parameswaran, K. &
Fejer, M.
CLEO '01 , pp. 382 - 383 , 2001
Cardei02
Connected Domination in Multihop Ad Hoc Wireless Networks
Cardei, M.; Cheng, X.; Cheng, X. & Du, D.
Proceedings of the International Conference on Computer Science and Informatics ,
pp. 251-255 , 2002
Cardoso01
Convex quadratic programming approach to the maximum matching
problem
Cardoso, D.M.
Journal of Global Optimization , Vol. 21 , pp. 91-106 , 2001
des89-3
Computer-Aided Design Procedure for
Survivable Fiber Optic Networks
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
CaPa90.1
An exact algorithm for the maximum clique problem
Carraghan, R. & Pardalos, P.
Operations Research Letters , Vol. 9 , pp. 375-382 , 1990
carraway1
Generalized dynamic programming for stochastic combinatorial
optimization
Carraway, R.L.; Morin, T.L. & Moskowitz, H.
Operations Research , Vol. 37 , pp. 819-829 , 1989
CarBak02a
A GRASP interactive approach to the vehicle routing
problem with backhauls
Carreto, C. & Baker, B.
pp. 185-200 , 2002
CarBak99a
A GRASP interactive approach to the vehicle routing problem with
backhauls
Carreto, C. & Baker, B.
Abstracts of the Third Metaheuristics International Conference , pp. 125-128 , 1999
carrizosa1
Locating an undesirable facility by generalized cutting planes
Carrizosa, E. & Plastria, F.
Mathematics of Operations Research , Vol. 23 , pp. 680-694 , 1998
carter1
The indefinite zero-one quadratic program
Carter, M.W.
Discrete Applied Mathematics , Vol. 7 , pp. 23-44 , 1984
CasTho03a
29.03.2006
JabRef Output
url
url
Castro, J.
2003
castro1
A specialized interior point algorithm for multicommodity flows
url
Castro, J.
SIAM Journal on Optimization , Vol. 10 , pp. 852-877 , 2000
castro4
Solving difficult multicommodity problems through a specialized interiorpoint algorithm
29.03.2006
JabRef Output
Castro, J.
2000
castro2
A parallel implementation of an interior-point algorithm for
multicommodity network flows
url
url
29.03.2006
JabRef Output
url
Censor, Y.
pp. 25-49 , 2003
censor3
Block-Iterative Algorithms with Diagonally Scaled Oblique
Projections for the Linear Feasibility Problem
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Chamberland04
An efficient heuristic for the expansion problem of cellular wireless
networks
Chamberland, S.
Computers and Operations Research , Vol. 31 , pp. 1769-1791 , 2004
ChSaMa97
Heuristics for Ring Network Design when Several Types of Switches are
Available
Chamberland, S.; Sanso, B. & Marcotte, O.
Proceedings of IEEE International Conference on Communications 1997 , pp. 570574 , 1997
ChSa00
Topological Expansion of Multiple-Ring Metropolitan Area Networks
Chamberland, S. & Sans, B.
Networks , Vol. 36 , pp. 210-224 , 2000
chan1
Worst-case analyses, linear programming, and the bin-packing problem
Chan, L.M.A.; Simchi-Levi, D. & Bramel, J.
Mathematical Programming , Vol. 83 , pp. 213-227 , 1998
vwcchan1
Multiple layers of CMOS integrated circuits using recrystallized
silicon film
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Chang, S.
Journal of Operational Research Society , Vol. 45 , pp. 187-201 , 1994
Changsg92
Fair integration of routing and flow control in communication-networks
Chang, S.
IEEE Transactions on Communications , Vol. COM-40 , pp. 821-834 , 1992
ChGa93
Telecommunications network topological design and capacity expansion:
Formulations and algorithms
Chang, S. & Gavish, B.
Telecommunications Systems , Vol. 1 , pp. 99-131 , 1993
tchang1
Heuristics for cardinality constrained portfolio optimisation
Chang, T.; Meade, N.; Beasley, J.E. & Sharaiha, Y.M.
Computers and Operations Research , Vol. 27 , pp. 1271-1302 , 2000
Changyg92
Optimal virtual circuit routing in computer networks
Chang, Y.; Wu, J. & Ho, H.
IEE Proceedings-I Communications Speech and Vision , Vol. 139 , pp. 625-632 , 1992
chao1
A new heuristic for the multi-depot vehicle routing problem that improves
upon best-known solutions
Chao, I.; Golden, B.L. & Wasil, E.
pp. 371-406 , 1993
ChaoEtAl04
Assigning service requests in Voice-over-Internet gateway multiprocessors
Chao, S.; Chinneck, J. & Goubran, R.
Computers and Operations Research , Vol. 31 , pp. 2419-2437 , 2004
29.03.2006
JabRef Output
ChaoHsu
Rectilinear Steiner tree construction by local and global refinement
Chao, T. & Hsu, Y.
Proceedings of the International Conference on Computer-Aided Design , pp. 432435 , 1990
ChaKimPar03a
GRASP with a new local search scheme for
url
29.03.2006
JabRef Output
chalis02
Simplex and interior-point specialized algorithms for solving non-oriented
multicommodity flow problems
Chardaire, P. & Lisser, A.
Operations Research , Vol. 50 , pp. 260-276 , 2002
chardaire1
Simplex and interior point specialized algorithms for solving nonoriented
multicommodity flow problems
Chardaire, P. & Lisser, A.
Operations Research , Vol. 50 , pp. 260-276 , 2002
Chardaire
A primal simplex specialization for solving non-oriented multicommodity
flow problems
Chardaire, P. & Lisser, A.
Investigacin Operativa , Vol. 5 , pp. 117-152 , 1996
Chardaire:Lutton:Sutter
Upper and lower bounds for the two-level simple plant location problem
Chardaire, P.; Lutton, J. & Sutter, A.
Annals of Operations Research , Vol. 86 , pp. 117-140 , 1999
ChaMcKMak01a
Application of GRASP to the multiconstraint
knapsack problem
Chardaire, P.; McKeown, G. & Maki, J.
pp. 30-39 , 2001
Chari1996
Multi-hour design of computer backbone networks
Chari, K.
Telecommunications Systems , Vol. 6 , pp. 347-365 , 1996
29.03.2006
JabRef Output
CharikarChekuriCheungDaiGoelGuhaLi99
Approximation Algorithms for Directed Steiner Problems
Charikar, M.; Chekuri, C.; Cheung, T.; Dai, Z.; Goel, A.; Guha, S. & Li, M.
Journal of Algorithms , Vol. 33 , pp. 73-91 , 1999
Charikaretal04
Resource Optimization in QoS Multicast Routing of Real-Time Multimedia
Charikar, M.; Naor, J. & Schieber, B.
IEEE/ACM Transactions on Networking , Vol. 12 , pp. 340-348 , 2004
ChaCoo67
Management Models and Industrial Applications of Linear Programming:
Volume I
Charnes, A. & Cooper, W.
John Wiley and Sons, Inc. , 1967
charnes1
Programming with linear fractional functionals
Charnes, A. & Cooper, W.W.
Naval Research Logistics Quarterly , Vol. 9 , pp. 181-186 , 1962
ChaHud01a
The noising methods: A survey
Charon, I. & Hudry, O.
pp. 245-261 , 2002
ChaHud93
The noising method: A new method for combinatorial optimization
Charon, I. & Hudry, O.
Operations Research Letters , Vol. 14 , pp. 133-137 , 1993
ChartrandZhang02
The Steiner number of a graph
Chartrand, G. & Zhang, P.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
ChenEtAl01
Approximations for Steiner trees with minimum number of Steiner points
Chen, D.; Du, D.; Hu, X.; Lin, G.; Wang, L. & Xue, G.
Theoretical Computer Science , Vol. 262 , pp. 83-99 , 2001
ChenEtAl00
Approximations for Steiner Trees with Minimum Number of Steiner
Points
Chen, D.; Du, D.; Hu, X.; Lin, G.; Wang, L. & Xue, G.
Journal of Global Optimization , Vol. 18 , pp. 17-33 , 2000
Chen
Constrained wirelength minimization of a Steiner tree
Chen, D.S.
1994
CHK93
The Steiner problem in distributed computing systems
Chen, G.; Houle, M. & Kuo, M.
Information Sciences , Vol. 74 , pp. 73-96 , 1993
ChenNocetti02
Connectivity-Based k-Hop Clustering in Wireless Networks
Chen, G.; Nocetti, F.; Gonzalez, J. & Stojmenovic, I.
Proceedings of the 35th Annual Hawaii International Conference on System Sciences
(HICSS'02)-Volume 7 , pp. 188.3 , 2002
ChenXue03
A PTAS for weight constrained Steiner trees in seriesparallel graphs
Chen, G. & Xue, G.
Theoretical Computer Science , Vol. 304 , pp. 237-247 , 2003
ChenNahrstedt
Effective Location-Guided Overlay Multicast in Mobile Ad Hoc Networks
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
2000
xchen2
Non-interior continuation methods for solving semidefinite
complementarity problems
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
CRKG89
A loop-free extended Bellman-Ford routing protocol without bouncing
effect
Cheng, C.; Riley, R.; Kumar, S. & Garcia-Luna-Aceves, J.
ACM Computer Commun. Rev. , Vol. 19 , pp. 224-236 , 1989
echeng2
Separating subdivision of bicycle wheel inequalities over cut polytopes
Cheng, E.
Operations Research Letters , Vol. 23 , pp. 13-19 , 1999
echeng
Wheel inequalities for stable set polytopes
Cheng, E. & Cunningham, W.H.
Mathematical Programming , Vol. 77 , pp. 389-421 , 1997
Cheng03b
Energy-efficient Broadcast and Multicast Routing in Ad Hoc Wireless
Networks
Cheng, M.; Sun, J.; Min, M. & Du, D.
Proceedings of the IEEE International Conference on Performance, Computing, and
Communications Conference , pp. 87-94 , 2003
ChengLimWu
Optimal rectilinear Steiner tree for extremal point sets
Cheng, S.; Lim, A. & Wu, C.
1993
ChengLimWuISAAC
Optimal rectilinear Steiner tree for extremal point sets
Cheng, S.; Lim, A. & Wu, C.
Vol. 762 , pp. 523-532 , 1993
Cheng00
The Steiner tree problem for terminals on the boundary of a rectilinear
29.03.2006
JabRef Output
polygon
Cheng, S.
Theoretical Computer Science , Vol. 237 , pp. 213-238 , 2000
Cheng98
Topological optimization of a reliable communication network
Cheng, S.
IEEE Transactions on Reliability , Vol. 47 , pp. 225-33 , 1998
Cheng03a
A Polynomial-Time Approximation Scheme for the Minimum-Connected
Dominating Set in Ad-Hoc Wireless Networks
Cheng, X.; Huang, X.; Li, D. & Du, D.
Networks , Vol. 42 , pp. 202-208 , 2003
Cheng03
A Polynomial-Time Approximation Scheme for the Minimum-Connected
Dominating Set in Ad Hoc Wireless Networks
Cheng, X.; Huang, X.; Li, D.; Wu, W. & Du, D.Z.
Networks , Vol. 42 , pp. 202-208 , 2003
cheng.thesis
A least squares approach to interior point methods with an application to
geometric programming
Z.-Y. Cheng
Rensselaer Polytechnic Institute , 1993
Cheng210
A Primal-Dual Interior Point Method for Linear Programming Based on a
Weighted Barrier Function
Cheng, Z. & Mitchell, J.E.
Journal of Optimization Theory and Applications , Vol. 87 , pp. 301-321 , 1995
Cheng208
An Alternative Derivation of the Projective Interior Point Method for
29.03.2006
JabRef Output
29.03.2006
JabRef Output
CheBM94
Network Planning for Third-Generation Mobile Radio Systems
Cheung, J.; Beach, M. & McGeehan, J.
IEEE Communications Magazine , pp. 54-59 , 1994
CGZ98
Adaptive Shared Tree Multicast in Mobile Wireless Networks
Chiang, C.; Gerla, M. & Zhang, L.
Proceedings of GLOBECOM'98 , pp. 1817-1822 , 1998
ChiangSarrafzadehWongSwitchbox
An algorithm for exact rectilinear Steiner trees for switchbox with
obstacles
Chiang, C.; Sarrafzadeh, M. & Wong, C.K.
IEEE Transactions on Circuits and Systems , Vol. 39 , pp. 446-455 , 1992
ChiangSarrafzadehWongChannel
An optimal algorithm for rectilinear Steiner trees for channels with
obstacles
Chiang, C.; Sarrafzadeh, M. & Wong, C.K.
International Journal of Circuit Theory and Applications , Vol. 19 , pp. 551-563 , 1991
ChiangSarrafzadehWongMinmax
Global routing based on Steiner min-max trees
Chiang, C.; Sarrafzadeh, M. & Wong, C.K.
IEEE Transactions on Computer-Aided Design , Vol. 9 , pp. 1318-1325 , 1990
29.03.2006
JabRef Output
CWS94
A weighted Steiner tree-based global router with simultaneous length and
density minimization
Chiang, C.; Wong, C.K. & Sarrafzadeh, M.
IEEE Transactions on Computer-Aided Design , pp. 1461-1469 , 1994
ChiKouUrb02a
Incorporating workflow interference in facility layout design: The quartic
assignment problem
Chiang, W.; Kouvelis, P. & Urban, T.
Management Science , Vol. 48 , pp. 584-590 , 2002
cgg
External-memory graph algorithms
Chiang, Y.; Goodrich, M.T.; Grove, E.F.; Tamassia, R.; Vengroff, D.E. &
Vitter, J.S.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms , pp.
139-149 , 1995
ChiSta02
An application of iterated local search to graph coloring
Chiarandini, M. & Stantzle, T.
Proceedings of the Computational Symposium on Graph Coloring and its
Generalizations , pp. 112-125 , 2002
ChiStu02
An application of iterated local search to graph coloring
Chiarandini, M. & Stutzle, T.
Proceedings of the Computational Symposium on Graph Coloring and its
Generalizations , pp. 112-125 , 2002
ChiChlMonNuc02
Energy Efficient Design of Wireless Ad Hoc Networks
Chiasserini, C.; Chlamtac, I.; Monti, P. & Nucci, A.
Vol. 2345 , pp. 376-386 , 2003
29.03.2006
JabRef Output
ChMaRe94
Proximal Decomposition for Multicommodity Flow Problems with Convex
Costs
Chifflet, J.; Mahey, P. & Reynier, V.
Telecommunication Systems , Vol. 3 , pp. 1-10 , 1994
21chu
Cost effectiveness of joint multilayer protection in packet-over-optical
networks
Chigan, C.; Atkinson, G. & Nagarajan, R.
IEEE Journal of Lightwave Technology , Vol. 21 , pp. 2694 - 2704 , 2003
chinneck1
Locating minimal infeasible constraint sets in linear programs
Chinneck, J.W. & Dravniecks, E.W.
ORSA Journal on Computing , Vol. 3 , pp. 157-168 , 1991
chi00
Traffic Grooming Algorithms for Reducing Electronic Multiplexing Costs
in WDM Ring Networks
Chiu, A. & Modiano, E.
Journal of Lightware Technology , Vol. 18 , pp. 2-12 , 2000
18chiu
Traffic grooming algorithms for reducing electronic multiplexing costs in
WDM ring networks
Chiu, A. & Modiano, E.
IEEE Journal of Lightwave Technology , Vol. 18 , pp. 2 - 12 , 2000
01mod
Reducing electronic multiplexing costs in unidirectional SONET/WDM
ring networks via efficient traffic grooming
Chiu, A. & Modiano, E.
The Bridge to Global Integration. , Vol. 1 , pp. 322 - 327 , 1998
Chlamtac03
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Chlamtac87
Distributed nodes organization algorithm for channel access in a multihop
dynamic radio network
Chlamtac, I. & Pinter, S.S.
IEEE Transactions on Computers , Vol. 36 , pp. 728-737 , 1987
Chal83
On the Uncapacitated Plant Location Problem I: Valid Inequalities and
Facets
Cho, D.C.; Johnson, E.L.; Padberg, M. & Rao, M.R.
Mathematics of Operations Research , Vol. 8 , pp. 579-589 , 1983
ChPaRa83
On the Uncapacitated Plant Location Problem II: Facets and Lifting
Theorems
Cho, D.C.; Padberg, M. & Rao, M.R.
Mathematics of Operations Research , Vol. 8 , pp. 590-612 , 1983
Cho2002
Parallel Crawlers
Cho, J. & Garcia-Molina, H.
Proc. 11th WWW Conference (WWWC'02) , 2002
Cho2000a
Synchronizing a database to improve freshness
doi
29.03.2006
JabRef Output
01cho
Unification and extension of the traffic-grooming problem in WDM ring
networks
Cho, W.; Wang, J.; Mukherjee, B.; Moslehi, B. & Black, R.
Proceedings of the Optical Fiber Communication Conference (OFC 2000) , Vol. 1 , pp.
162 - 164 , 2000
Cho
A min-cost flow base min-cost rectilinear Steiner distance-preserving tree
construction
Cho, J.
Proceedings of the International Symposium on Physical Design , pp. 82-87 , 1997
CHKD96
Multimedia Multicast Transport Service for Groupware
Chockler, G.; Huleihel, N.; Keidar, I. & Dolev, D.
TINA Conference on the Convergence of Telecommunications and Distributed
Computing Technologies , pp. 43-54 , 1996
cchoi2
Solving Sparse Semidefinite Programs Using the Dual Scaling
Algorithm with an Iterative Solver
url
url
29.03.2006
JabRef Output
chogol90
Solving multicommodity network flow problems by an interior-point
method
Choi, I. & Goldfarb, D.
SIAM Proc. in Appl. Math. , Vol. 46 , pp. 58-69 , 1990
CMoSh
Further development of a primal-dual interior point method
Choi, I.C.; Monma, C.L. & Shanno, D.F.
ORSA Journal on Computing , Vol. 2(4) , pp. 304-311 , 1990
ChoGolLap00
A functional classification of routing and wavelength assignment schemes
in DWDM networks: Static case
Choi, J.; Golmie, N.; Lapeyrere, F.; Mouveaux, F. & Su, D.
Proceedings of the 7th International Conference on Optical Communication and
Networks , pp. 1109-1115 , 2000
Choi:Seidmann:Suh
Decision models for designing and planning private communication
networks
Choi, S.; Seidmann, A. & Suh, M.
Decision Support Systems , Vol. 15 , pp. 389-403 , 1995
ChoiTurnerWolf03
Configuring sessions in programmable networks
Choi, S.; Turner, J. & Wolf, T.
Computer Networks , Vol. 41 , pp. 269-284 , 2003
tchoi1
Estimates for the Nash-Sofer preconditioner for the reduced Hessian for
some elliptic variational inequalities
Choi, T.D. & Kelley, C.T.
SIAM Journal on Optimization , Vol. 9 , pp. 327-341 , 1999
chopra4
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
christof9
Computing physical maps of chromosomes with nonoverlapping
probes by branch-and-cut
url
url
url
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Christofoletti, L.M.
Departamento de Engenaria de Sistemas,
Universidade Estadual de Campinas
, 2002
ChrArm01a
Estratgias de reincio de busca local baseadas em memria para
programao de tarefas em uma mquina
Christofoletti, L. & Armentano, V.
Proceedings of the XXXIII Brazilan Symposium on Operations Research , pp. 13811389 , 2001
ChrLar91
An optimal on-line algorithm for $K$-servers on trees
Chrobak, M. & Larmore, L.
SIAM Journal on Computing , Vol. 20 , pp. 144-148 , 1991
98chu
Reducing Electronic Multiplexing Costs in Unidirectional SONET/WDM
Ring Networks Via Efficient Traffic Grooming
Chu, A.L. & Modiano, E.H.
Proceedings of GLOBECOM 1998 , pp. 322-327 , 1998
ChuEtAl00
Digital data networks design using genetic algorithms
Chu, C.; Premkumar, G. & Chou, H.
European Journal of Operational Research , Vol. 127 , pp. 140-158 , 2000
cbchua2
A new notion of weighted centers for semidefinite programming
url
Chua, C.B.
2004
cbchua1
A primal-dual second order cone approximations algorithm for
url
29.03.2006
JabRef Output
url
Chua, C.B.
SIAM Journal on Optimization , Vol. 14 , pp. 500-506 , 2003
chua1
An Analytic Center Cutting Plane Method With Deep Cuts For
Semidefinite Feasibility Problems
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
CHH97
A fast multicast routing algorithm for delay-sensitive applications
Chung, S.; Hong, S. & Huh, H.
IEEE GLOBECOM'97 , pp. 1898-1902 , 1997
ChungHongKimChung98
Algorithms for the Degree-Constrained Multicast Trees in Packet-Switched
Networks
Chung, S.; Hong, S.; Kim, S. & Chung, H.
Global Telecommunications Conference , Vol. 2 , pp. 1054-1059 , 1998
Chvatal:Book
Linear Programming
Chvtal, V.
W.H. Freeman and Company, Oxford, England , 1983
chvatal2
Edmonds polytopes and a hierarchy of combinatorial problems
Chvtal, V.
Discrete Mathematics , Vol. 4 , pp. 305-337 , 1973
Chvatal79
A greedy heuristic for the set-covering problem
Chvatal, V.
Mathematics of Operations Research , Vol. 4 , pp. 233-235 , 1979
Chva83
Linear Programming
Chvtal, V.
W. H. Freeman and Company , 1983
CicioraFarmerLarge1999
Modern cable television technology: Video, voice, and data
communications
29.03.2006
JabRef Output
doi
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
ClGr01
Mining the Rings: Strategies for Ring-to-Mesh Evolution
Clouqueur, M.; Grover, W.D.; Leung, D. & Shai, O.
Proceedings 3rd International Workshop on the Design of Reliable Communication
Networks (DRCN 2001) , pp. 113-120 , 2001
CloutierBennour
Topological characterization of Hwang's optimal Steiner trees
Cloutier, J. & Bennour, I.
Proceedings of the Canadian Conference on Computational Geometry , pp. 157-162 ,
1993
kn:jllgv
Using distributed topology update and preplanned configurations to
achieve trunk network survivability
Coan, B.A.; Leland, W.E.; Vecchi, M.P. & Wu, L.
IEEE Transactions on Reliability , Vol. 40 , 1992
Cocci93
Pricing in Computer Networks: Motivation, Formulation, and Example
Cocci, R.; Shenker, S.; Estrin, D. & Zhang, L.
IEEE/ACM Transactions on Networking , Vol. 1 , pp. 614-627 , 1993
Cockayne
On the Steiner problem
Cockayne, E.J.
Canadian Mathematical Bulletin , Vol. 10 , pp. 431-450 , 1967
Cockayne85
An upper bound for the k-domination number of a graph
Cockayne, E.J.; Gamble, B. & Shepherd, B.
Journal of Graph Theory , Vol. 9 , pp. 533-534 , 1985
CockayneHewgillImproved
29.03.2006
JabRef Output
29.03.2006
JabRef Output
CohoonGanleyChapter
Rectilinear interconnections in the presence of obstacles
Cohoon, J.P. & Ganley, J.L.
1996
GanleyCohoonThumbnailJournal
Rectilinear Steiner trees on a checkerboard
url
29.03.2006
JabRef Output
Coit96b
Adaptive penalty methods for genetic optimization of constrained
combinatorial problems
Coit, D.; Smith, A. & Tate, D.
INFORMS Journal on Computing , Vol. 8 , pp. 173-82 , 1996
Colbourn87
Combinatorics of network reliability
Colbourn, C.
Oxford , pp. x+160 pp. , 1987
Col1
Large Sparse Numerical Optimization
Coleman, T.F.
Springer-Verlag , 1984
coleman6
The Efficient Computation of Structured Gradients using Automatic
Differentiation
url
url
url
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
IEEE Transactions on Systems, Man, and Cybernetics , Vol. 24 , pp. 1747-1754 , 1994
ColSer98a
Consumer choice in competitive location models:
Formulations and heuristics
Colom, R. & Serra, D.
1998
17com
Integrated IP/WDM routing in GMPLS-based optical networks
Comellas, J.; Martinez, R.; Prat, J.; Sales, V. & Junyent, G.
IEEE Network , Vol. 17 , pp. 22 - 27 , 2003
CommanderButenkoPardalos04heurperf
On the Performance of Heuristics for Broadcast Scheduling
Commander, C.W.; Butenko, S. & Pardalos, P.M.
pp. 63-82 , 2004
conforti1
Balanced $0,1$-matrices, bicoloring and total dual integrality
Conforti, M. & Cornujols, G.
Mathematical Programming , Vol. 71 , pp. 249-258 , 1995
conforti2
A class of logic problems solvable by linear programming
Conforti, M. & Cornujols, G.
33rd FOCS , pp. 670-675 , 1992
conforti7
Balanced $0 1$ matrices. Part I: Decomposition
url
29.03.2006
JabRef Output
conforti8
Balanced $0 1$ matrices. Part II: Algorithm
url
url
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
consiglio2
Integrated simulation and optimization models for tracking international
fixed income indices
Consiglio, A. & Zenios, S.
Mathematical Programming , Vol. 89 , pp. 311-339 , 2001
consiglio1
Designing portfolios of financial products via integrated simulation and
optimization models
Consiglio, A. & Zenios, S.
Operations Research , Vol. 47 , pp. 195-208 , 1999
consiglio3
A model for designing callable bonds and its solution using tabu search
Consiglio, A. & Zenios, S.
Journal of Economic Dynamics and Control , Vol. 21 , pp. 1445-1470 , 1997
cr79
On the theory of binary asymmetric error correcting codes
Constantin, S.D. & Rao, T.R.N.
Information and Control , Vol. 40 , pp. 20-36 , 1979
Constantinides02
The 4S web-marketing mix model
Constantinides, E.
Electronic Commerce Research and Applications , Vol. 1 , pp. 57-76 , 2002
constantino1
A cutting plane approach to capacitated lot-sizing with start-up costs
Constantino, M.
Mathematical Programming , Vol. 75 , pp. 353-376 , 1996
Co90
Integer programming solution for capacity expansion of the local access
29.03.2006
JabRef Output
network
Cook, W.
1990
cook3
On the matrix-cut rank of polyhedra
Cook, W. & Dash, S.
Mathematics of Operations Research , Vol. 26 , pp. 19-30 , 2001
cook1
Computing minimum-weight perfect matchings
Cook, W. & Rohe, A.
INFORMS Journal on Computing , Vol. 11 , pp. 138-148 , 1999
cook2
Combinatorial Optimization
Cook, W.J.; Cunningham, W.H.; Pulleyblank, W.R. & Schrijver, A.
John Wiley , 1997
CooKwoGloSchTayWit02a
Mobility management in cellular telephony
2002
cf2
The size of the largest strongly connected component of a random graph
with a given degree sequence
Cooper, C. & Frieze, A.
2002
cf1
A general model of undirected Web graphs
Cooper, C. & Frieze, A.
Algorithms - ESA 2001, Ninth Annual European Symposium , pp. 500-511 , 2001
29.03.2006
JabRef Output
Co64
Heuristic Methods for Location-Allocation Problems
Cooper, L.
SIAM Review , Vol. 6 , pp. 37-53 , 1964
coppersmith1
A Polytope for a Product of Real Linear Functions in 0/1 Variables
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
CotDan
Complementary pivot theory of mathematical programming
Cottle, R.W. & Dantzig, G.B.
Linear Algebra and its applications , Vol. 1 , pp. 103-125 , 1968
cou03
Lightpath Assignment for Multifibers WDM Optical Networks with
Wavelength Translators
Coudert, D. & Rivano, H.
Jul. 2003
cou02a
Lightpath Assignment for Multifibers WDM Networks with
Wavelength Translators
29.03.2006
JabRef Output
1991
des93-3
Linear-Time Algorithms for the
2-Connected Steiner Subgraph Problem on Special Classes of Graphs
29.03.2006
JabRef Output
Cowie-codered
Global Routing Instabilities
during Code Red 2 and Nimda Worm Propagation
Cowie, J. & Ogielski, A.
2001
CoxSan00
Designing Least-Cost Survivable Wireless Backhaul Networks
Cox, L. & Sanchez, J.
Journal of Heuristics , Vol. 6 , pp. 525-540 , 2000
Cozzens82
T-colorings of graphs and the channel assignment problem
Cozzens, M.B. & Roberts, F.S.
Congressus Numerantium , Vol. 35 , pp. 191-208 , 1982
CrainicFrangioniGendron2001
Bundle-based relaxation methods for multicommodity capacitated fixed
charge network design problems
Crainic, T.; Frangioni, A. & Gendron, B.
Discrete Applied Mathematics , Vol. 112 , pp. 73-99 , 2001
crainic1
A simplex-based tabu search method for capacitated network design
Crainic, T.G.; Gendreau, M. & Farvolden, J.M.
INFORMS Journal on Computing , Vol. 12 , pp. 223-236 , 2000
crafragen01
Bundle-based relaxation methods for multicommodity capacitated fixed
charge network design
Crainic, T.; Frangioni, A. & Gendron, B.
Discrete Appl. Math. , Vol. 112 , pp. 73-99 , 2001
CraGen02
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
czyzyk1
Using a massively paralle processor to solve large sparse linear programs
by an interior-point method
Czyzyk, J.; Fourer, R. & Mehrotra, S.
1994
czyzyk5
PCx: An interior-point code for linear programming
Czyzyk, J.; Mehrotra, S.; Wagner, M. & Wright, S.J.
Optimization Methods and Software , Vol. 11 , pp. 397-430 , 1999
czyzyk3
PCx user guide (version 1.1)
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
dahl04
On the directed hop-constrained shortest path problem
Dahl, G. & Gouveia, L.
Operations Research Letters , Vol. 32 , pp. 15-22 , 2004
dahl04c
The 2-path network problem
Dahl, G. & Johannessen, B.
Networks , Vol. 43 , pp. 190-199 , 2004
DahJoh00
The 2-path network design problem
Dahl, G. & Johannessen, B.
2000
Dahl:Martin:Stoer
Routing through virtual paths in layered telecommunication networks
Dahl, G.; Martin, A. & Stoer, M.
Operations Research , Vol. 47 , pp. 693-702 , 1999
DahMarSto99a
Routing through virtual paths in layered telecommunication networks
Dahl, G.; Martin, A. & Stoer, M.
Operations Research , Vol. 47 , pp. 693-702 , 1999
DaMaSt95
Routing through virtual paths in layered telecommunication networks
Dahl, G.; Martin, A. & Stoer, M.
1995
des95-3
Routing through virtual paths in layered
telecommunication networks
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
DFJ
Solutions of a large-scale travelling salesman problem
Dantzig, G.B.; Fulkerson, D.R. & Johnson, S.M.
Operations Research , Vol. 2 , pp. 393-410 , 1954
Dan60a
On the shortest route through a network
Dantzig, G.
Management Science , Vol. 6 , pp. 187-190 , 1960
Dantzig57
Discrete variable extremum problems
Dantzig, G.
Operations Research , Vol. 4 , pp. 266-277 , 1957
dan55
The Generalized Simplex Method for Minimizing a Linear Form under
Linear Inequality Constraints
Dantzig, G.; Orden, A. & Wolfe, P.
Pacific Journal of Mathematics , Vol. 5 , pp. 183-195 , 1955
dantzwolf61
The decomposition algorithm for linear programming
Dantzig, G. & Wolfe, P.
Econometrica , Vol. 29 , pp. 767-778 , 1961
Dantzig:Wolfe_1960
Decomposition principle for linear programs
Dantzig, G. & Wolfe, P.
Operations Research , Vol. 8 , pp. 101-111 , 1960
darbydowman1
Properties of some combinatorial optimization problems and their effect
on the performance of integer programming and constraint logic
29.03.2006
JabRef Output
programming
Darby-Dowman, K. & Little, J.
INFORMS Journal on Computing , Vol. 10 , pp. 276-286 , 1998
Das97a
Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets
Das, B. & Bharghavan, V.
Proceedings of the IEEE International Conference on Communications , pp. 376-380 ,
1997
das97routing
Routing in Ad-Hoc Networks Using Minimum Connected Dominating Sets
Das, B. & Bharghavan, V.
IEEE International Conference on Communications (ICC '97) , pp. 376-380 , 1997
DB97
Routing in ad-hoc networks using minimum connected dominating sets
Das, B. & Bharghavan, V.
Proceedings of ICC 1997 , pp. 376-380 , 1997
DasLoui01
Reconstructing a Minimum Spanning Tree after Deletion of Any Node
Das, B. & Loui, M.
Algorithmica , Vol. 31 , pp. 530-547 , 2001
Das97b
Routing in Ad-Hoc Networks Using a Spine
Das, B.; Sivakumar, R. & Bharghavan, V.
1997
das97virtual
Routing in Ad-Hoc Networks Using a Virtual Backbone
Das, B.; Sivakumar, R. & Bharghavan, V.
Proceedings of the International Conference on Computers and Communication
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
des97-1
Uncapacitated network design with bifurcated routing
A. De Jongh
Universit Libre de Bruxelles , 1998
des95-5
Finding disjoint routes in telecommunications
networks with two technologies
De Jongh, A.; Gendreau, M. & Labb, M.
1995
DeGhoWel94a
Solving a generalized model for CON due date
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
rfc1112
Host extensions for IP multicasting
url
Deering, S.E.
1989
Deeter98
Economic design of reliable networks
Deeter, D. & Smith, A.
IIE Transactions , Vol. 30 , pp. 1161-74 , 1998
Deeter97
Heuristic optimization of network design considering all-terminal
reliability
Deeter, D. & Smith, A.
Annual Reliability and Maintainability Symposium 1997 Proceedings (Cat.
No.97CH36029) , pp. 194-9 , 1997
degraeve1
Optimal integer solutions to industrial cutting stock problems
Degraeve, Z. & Schrage, L.
INFORMS Journal on Computing , Vol. 11(4) , pp. 406-419 , 1999
dellamico2
Exact solution of the SONET ring loading problem
Dell'Amico, M.; Labbe, M. & Maffioli, F.
Operations Research Letters , Vol. 25(3) , pp. 119-129 , 1999
dellamico1
Annotated bibliographies in combinatorial optimization
Dell'Amico, M.; Maffioli, F. & Martello, S.
John Wiley , 1997
DelMM04
A tree partitioning dynamic policy for OVSF codes assignment in wideband
CDMA
29.03.2006
JabRef Output
1997
delorme1
Laplacian eigenvalues and the maximum cut problem
Delorme, C. & Poljak, S.
Mathematical Programming , Vol. 62 , pp. 557-574 , 1993
DelGanRod03a
GRASP for set packing problems
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
url
Demmel, J.W.
SIAM , 1997
dempe1
Sensitivity analysis for linear optimization problem with fuzzy data
in the objective function
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
DIJKSTRA
A Note on Two Problems in Connection with Graphs
Dijkstra, E.W.
Numerical Mathematics , Vol. 1 , pp. 269-271 , 1959
D59
A note on two problems in connexion with graphs
Dijkstra, E.
Numer. Math. , Vol. 1 , pp. 269-271 , 1959
Di59
A Note on Two Problems in Connection with Graphs
Dijkstra, E.
Numer. Math. , Vol. 1 , pp. 269-271 , 1959
Dijkstra59
A Note on Two Problems in Connexion with Graphs
Dijkstra, E.
Numerical Mathematics , Vol. 1 , pp. 262-271 , 1959
sp59-1
A note on two problems in connection with graphs
Dijkstra, E.
Numer. Math. , Vol. 1 , pp. 269-271 , 1959
Dikin2
Determining the interior point of a system of linear inequalities
Dikin, I.I.
Kibernetika i Sistemnyi Analiz. , Vol. 1 , pp. 67-74 , 1992
Dik1
Iterative Solution of Problems of Linear and Quadratic Programming
Dikin, I.I.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
investigation
Dodd, N.
Parallel Computing , Vol. 16 , pp. 269-272 , 1990
dolan7
NEOS Server 4.0 Administrative Guide
url
Dolan, E.
2001
dolan6
The NEOS Server for Optimization: Version 4 and Beyond
url
url
url
url
url
29.03.2006
JabRef Output
dolan3
Optimization on the NEOS Server
Dolan, E.D.; Fourer, R.; Mor, J.J. & Munson, T.S.
SIAM News , Vol. 35 , pp. 4, 8-9 , 2002
dolan
Spanning trees in random graphs
Dolan, P.
Vol. 2 , pp. 47-58 , 1992
DBRW
Optimizing over three-dimensional subspaces in an interior-point method
for linear programming
Domich, P.D.; Boggs, P.T.; Rogers, J.E. & Witzgall, C.
Linear Algebra and its Applications , Vol. 152 , pp. 315-342 , 1991
domingoferrer1
Practical Data-Oriented Microaggregation for Statistical Disclosure
Control
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
dou03
On the Availability and Capacity Requirements of Shared Backup Pathprotected Mesh Networks
Doucette, J.; Clouqueur, M. & Grover, W.
Optical Networks Magazine , pp. 29-44 , 2003
DoGi05
Investigation of Node Protection Strategies with Node-Encircling $p$Cycles
Doucette, J.; Giese, P. & Grover, W.D.
2005
DoGr02
Capacity Design Studies of Span-Restorable Mesh Networks with SharedRisk Link Group (SRLG) Effects
Doucette, J. & Grover, W.D.
Optical Networking and Communications Conference (OptiComm 2002) , pp. 25-38 ,
2002
DoGr01
Comparison of Mesh Protection and Restoration Schemes and the
Dependency on Graph Connectivity
Doucette, J. & Grover, W.D.
Proceedings of 3rd International Workshop on Design of Reliable Communication
Networks (DRCN 2001) , pp. 121-128 , 2001
DoGr00
Influence of Modularity and Economy-of-scale Effects on Design of MeshRestorable DWDM Networks
Doucette, J. & Grover, W.D.
IEEE Journal on Selected Areas in Communications , Vol. 18 , pp. 1912-1923 , 2000
Doucette:Grover
Influence of modularity and economy-of-scale effects on design of meshrestorable DWDM networks
Doucette, J. & Grover, W.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Steiner trees
Du, D. & Pardalos, P.
pp. 111-124 , 1993
du1
Global convergence of Rosen's gradient projection method
Du, D. & Zhang, X.
Mathematical Programming , Vol. 44 , pp. 357-366 , 1989
DuEtAL00
On Shortest k-Edge-Connected Steiner Networks in Metric Spaces
Du, X.; Hu, X. & Jia, X.
Journal of Combinatorial Optimization , Vol. 4 , pp. 99-107 , 2000
DuanYu03
Power distribution system optimization by an algorithm for capacitated
Steiner tree problems with complex-flows and arbitrary cost functions
Duan, G. & Yu, Y.
Electrical Power and Energy Systems , Vol. 25 , pp. 515-523 , 2003
Dubashi03
Fast distributed algorithms for (weakly) connected dominating sets and
linear-size skeletons
Dubhashi, D.; Mei, A.; Panconesi, A.; Radhakrishnan, J. & Srinivasan., A.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete
Algorithms , pp. 717-724 , 2003
Duchet82
On Hadwiger's number and stability numbers
Duchet, P. & Meyniel, H.
Annals of Discrete Mathematics , Vol. 13 , pp. 71-74 , 1982
duckworth2
Mathematics of one day cricket
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
Duin89b
Reduction Tests for the Steiner Problem in Graphs
Duin, C. & Volgenant, A.
Operations Research Letters , Vol. 19 , pp. 549-567 , 1989
DuinVoss99
The Pilot Method: A Strategy for Heuristic Repetition with Application to
the Steiner Problem in Graphs
Duin, C. & Vo, S.
Networks , Vol. 34 , pp. 181-191 , 1999
DuinVoss97
Efficient Path and Vertex Exchange in Steiner Tree Algorithms
Duin, C. & Vo, S.
Networks , Vol. 29 , pp. 89-105 , 1997
Duin
Steiner's Problem in Graphs: Approximation, Reduction, Estimation
C. W. Duin
Faculteit der Economische Wetenschappen en Econometrie, Universiteit van
Amsterdam , 1993
DuVo87
Some generalizations of the Steiner tree in graphs
Duin, C.W. & Volgenant, A.
Networks , Vol. 17 , pp. 353-364 , 1987
DuinVoss91
Efficient path and vertex exchange in Steiner tree algorithms
Duin, C. & Vo, S.
Networks , Vol. 29 , pp. 89-105 , 1997
dv99
The pilot method: A strategy for heuristic repetition with application to
29.03.2006
JabRef Output
29.03.2006
JabRef Output
spielman2
Smoothed analysis of Renegar's Condition Number for Linear
Programming
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
DuKu99
Design of Partially Survivable Networks for Cellular Telecommunication
Systems
Dutta, A. & Kubat, P.
European Journal of Operational Research , Vol. 118 , pp. 52-64 , 1999
Dutta:Kubat
Design of partially survivable networks for cellular telecommunication
systems
Dutta, A. & Kubat, P.
European Journal of Operational Research , Vol. 118 , pp. 52-64 , 1999
16dut
Traffic grooming in WDM networks: past and future
Dutta, R. & Rouskas, G.
IEEE Network , Vol. 16 , pp. 46 - 56 , 2002
20dut
On optimal traffic grooming in WDM rings
Dutta, R. & Rouskas, G.
IEEE Journal on Selected Areas in Communications , Vol. 20 , pp. 110 - 121 , 2002
dut00
A Survey of Virtual Topology Design Algorithms for Wavelength Routed
Optical Networks
Dutta, R. & Rouskas, G.
Optical Networks Magazine , Vol. 1 , pp. 73-89 , 2000
dybvig1
Short sales restrictions and kinks on the mean variance frontier
Dybvig, P.H.
The Journal of Finance , Vol. 39 , pp. 239-244 , 1984
Dye:Stougie:Tomasgard
The stochastic single resource service-provision problem
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Tail91
Robust taboo search for the quadratic assignment problem
E.~Taillard
Parallel Computing , Vol. 7 , pp. 443-455 , 1991
Easton80
Sequential destruction method for Monte Carlo evaluation of system
reliability
Easton, M. & Wong, C.
IEEE Transactions on Reliability , Vol. R-29 , pp. 27-32 , 1980
eaves1
Optimal scaling of balls and polyhedra
Eaves, B.C. & Freund, R.M.
Mathematical Programming , Vol. 23 , pp. 138-147 , 1982
ecker4
Geometric Programming: methods, computations, and applications
Ecker, J.G.
SIAM Review , Vol. 22 , pp. 338-362 , 1980
Ecker1
Introduction to Operations Research
Ecker, J.G. & Kupferschmid, M.
John Wiley , 1986
ecker3
An application of nonlinear optimization in molecular biology
url
Ecker, J.G.; Kupferschmid, M.; Lawrence, C.E.; Reilly, A.A. & Scott, A.C.H.
European J. Oper. Res , Vol. 138 , pp. 452-458 , 2002
eckstein7
A Practical General Approximation Criterion for Methods of
Multipliers Based on Bregman Distances
url
29.03.2006
JabRef Output
Eckstein, J.
2000
eckstein6
How much communication does parallel branch and bound need?
Eckstein, J.
INFORMS Journal on Computing , Vol. 9 , pp. 15-29 , 1997
eck94
Parallel alternating direction multiplier decomposition of convex
programs
Eckstein, J.
JOTA , Vol. 80 , 1994
Eckstein257
Parallel Branch-and-Bound Algorithms for General mixed Integer
Programming on the CM--5
Eckstein, J.
SIAM Journal on Optimization , Vol. 4 , pp. 794-814 , 1994
eckstein3
Parallel branch-and-bound methods for mixed integer programming
Eckstein, J.
SIAM News , Vol. 27 , pp. 1,12,14,15 , 1994
eckstein5
Control strategies for parallel mixed integer branch and bound
Eckstein, J.
Proceedings, Supercomputing '94: Washington, D.C., November 14-18, 1994 , 1994
Eckstein_1994
Parallel branch-and-bound algorithms for general mixed integer
programming on the CM-5
Eckstein, J.
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
edirisinghe3
Bound-based approximations in multistage stochastic programming:
Nonanticipativity aggregation
Edirisinghe, N.C.P.
Annals of Operations Research , Vol. 84 , pp. 103-128 , 1998
edirisinghe1
Implementing bounds-based approximations in convex-concave two-stage
stochastic programming
Edirisinghe, N.C.P. & Ziemba, W.T.
Mathematical Programming , Vol. 75 , pp. 295-325 , 1996
Ed70
Submodular functions, matroids and certain polyhedra
Edmonds, J.
pp. 69-87 , 1970
Edm
Paths, Trees and flowers
Edmonds, J.
Canadian Journal of Mathematics , Vol. 17 , pp. 449-467 , 1965
Edm2
Maximum matching and a polyhedron with 0, 1 vertices
Edmonds, J.
Journal of Research National Bureau of Standards , Vol. 69B , pp. 125-130 , 1965
edmonds3
Theoretical improvements in algorithmic efficiency for network flow
problems
Edmonds, J. & Karp, R.M.
Journal of the Association for Computing Machinery , Vol. 19 , pp. 248-264 , 1972
EfRa66
A Branch and Bound Algorithm for Plant Location
29.03.2006
JabRef Output
url
A. Eisenbltter
TU-Berlin and Konrad-Zuse-Zentrum fr Informationstechnik , 2001
EisG05
A novel view on cell coverage and coupling for UMTS radio network
evaluation and design
Eisenbltter, A. & Geerdes, H.
Proceedings of the 2nd International Network Optimization Conference (INOC) , Vol.
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
ElBakry3
On the convergence rate of Newton interior-point methods in the absence
of strict complementarity
El-Bakry, A.S.; Tapia, R.A. & Zhang, Y.
Computational Optimization and Applications , Vol. 6 , pp. 157-167 , 1996
ElayoubiEtAl04
Admission control in UMTS in the presence of shared channels
Elayoubi, S.; Chahed, T. & Hbuterne, G.
Computer Communications , Vol. 27 , pp. 1115-1126 , 2004
elhedhli1
The Integration of Interior-Point Cutting Plane Methods within
Branch-and-Price Algorithms
url
29.03.2006
JabRef Output
Configuration Constraints
Ellwein, L. & Gray, P.
AIIE Transactions , Vol. 3 , pp. 290-298 , 1971
Elm78a
Activity Networks: Project Planning and Control byNetwork Models
Elmaghraby, S.
Wiley , 1978
Elperin91
Estimation of network reliability using graph evolution models
Elperin, T.; Gertsbakh, I. & Lomonosov, M.
IEEE Transactions on Reliability , Vol. 40 , pp. 572-81 , 1991
ELWALID
MATE: MPLS Adaptive Traffic Engineering
Elwalid, A.; Jin, C.; Low, S. & Widjaja, I.
Proceedings INFOCOM'01 , 2001
ElzingaHearnRandolph
Minimax multifacility location with Euclidean distances
Elzinga, J.; Hearn, D. & Randolph, W.D.
Transportation Science , Vol. 10 , pp. 321-336 , 1976
elzinga1
A central cutting plane algorithm for the convex programming problem
Elzinga, J. & Moore, T.J.
Mathematical Programming , Vol. 8 , pp. 134-145 , 1975
Eng04
The role of e-marketplaces in supply chain management
Eng, T.Y.
Industrial Marketing Management , Vol. 33 , pp. 97-105 , 2004
29.03.2006
JabRef Output
enge1
A counterexample to H. Arsham's ``Initialization of the simplex
algorithm: an artificial free approach''
url
url
url
url
url
url
29.03.2006
JabRef Output
Ephremides90
Scheduling broadcasts in multihop radio networks
Ephremides, A. & Truong, T.V.
IEEE Transactions on Communications , Vol. 38 , pp. 456-461 , 1990
Ephremides87
A design concept of reliable mobile radio networks with frequency
hopping signaling
Ephremides, A.; Wieselthier, J. & Baker, D.
Proceedings of the IEEE , pp. 56-73 , 1987
epp99
Finding the K Shortest Paths
Eppstein, D.
SIAM Journal of Computing , Vol. 28 , pp. 652-673 , 1999
erd3
On the strength of connectedness of a random graph
Erds, P. & Rnyi, A.
Acta Math. Acad. Sci. Hungar. , Vol. 12 , pp. 261-267 , 1961
erd2
On the evolution of random graphs
Erds, P. & Rnyi, A.
Publ. Math. Inst. Hungar. Acad. Sci. , Vol. 5 , pp. 17-61 , 1960
erd1
On random graphs
Erds, P. & Rnyi, A.
Publicationes Mathematicae , Vol. 6 , pp. 290-297 , 1959
ErdemWong04
Rectilinear Steiner Tree Construction Using Answer Set Programming
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
E94
MBONE -- The multicast backbone
Eriksson, H.
Communications of ACM , Vol. 37 , pp. 54-60 , 1994
erkut1
Modeling of transport risk for hazardous materials
Erkut, E. & Verter, V.
Operations Research , Vol. 46 , pp. 625-642 , 1998
ErlJan98
Efficient Implementation of an Optimal Greedy Algorithm for Wavelength
Assignment in Directed Tree Networks
Erlebach, T. & Jansen, K.
Proceedings WAE'98 , pp. 13-24 , 1998
ErlJanKak99
Optimal wavelength routing on directed fiber trees
Erlebach, T.; Jansen, K.; Kaklamanis, C.; Mihail, M. & Persiano, P.
Theoretical Computer Science , Vol. 221 , pp. 119-137 , 1999
ErlJanKak97
An optical greedy algorithm for wavelength allocation in directed tree
networks
Erlebach, T.; Jansen, K.; Kaklamanis, C. & Persiano, P.
Proceedings of the DIMACS Workshop on Network Design: Connectivity and Facilities
Location. DIMACS Series in Discrete Mathematics and Theoretical Computer Science ,
pp. 117-129 , 1997
ErlJan01
The complexity of path coloring and call scheduling
Erlebach, T. & K.~Jansen
Theoretical Computer Science , Vol. 255 , pp. 33-50 , 2001
ErlebachRueegg04
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
de Farias, I.R.
2003
00far
Novel two-stage wavelength-routed access architecture employing
spectral-grooming and replicated arrayed waveguide gratings
Farjady, F.; Parker, M. & Walker, S.
Telecommunications, 1998 , pp. 214 - 218 , 1998
pce:04
Path Computation Element (PCE) Architecture
Farrel, A.; Vasseur, J. & Ash, J.
29.03.2006
JabRef Output
2005
Faal93
A primal partitioning solution for the arc-chain formulation of a
multicommodity network flow problem
Farvolden, J.; Powell, W. & Lustig, I.
Operations Research , Vol. 41 , pp. 669-692 , 1993
faybusovich8
Self-concordant barriers for cones generated by Chebyshev systems
url
Faybusovich, L.
2001
faybusovich9
On the Nesterov approach to semi-infinite programming
url
Faybusovich, L.
2001
faybusovich5
Euclidean Jordan algebras and generalized affine-scaling vector
fields
url
Faybusovich, L.
1998
faybusovich6
A Jordan-algebraic approach to potential-reduction algorithms
url
Faybusovich, L.
1998
faybusovich2
Infinite-dimensional semidefinite programming: regularized
determinants and self-concordant barriers
url
Faybusovich, L.
1996
29.03.2006
JabRef Output
faybusovich3
Semidefinite programming: A path-following algorithm for a linearquadratic functional
Faybusovich, L.
SIAM Journal on Optimization , Vol. 6 , pp. 1007-1024 , 1996
faybusovich4
Linear systems in Jordan algebras and primal-dual interior-point
algorithms
url
Faybusovich, L.
1996
faybusovich1
Jordan algebras, Symmetric cones and Interior-point methods
url
Faybusovich, L.
1995
faybusovich7
A long-step primal-dual algorithm for the symmetric programming
problem
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Experience
Feldmann, A.; Greenberg, A.; Lund, C.; Reingold, N.; Rexford, J. & True, F.
IEEE/ACM Trans. Networking , Vol. 9 , 2001
netdb:01
IP Network Configuration for Intradomain Traffic Engineering
Feldmann, A. & Rexford, J.
IEEE Network , pp. 46-57 , 2001
fen51
Convex cones, Sets and Functions
Fenchel, W.
1951
Fenelon
Branching Strategies for MIP
Fenelon, M.
CPLEX , 1991
FY99
Efficient multicast routing with delay constraints
Feng, G. & Yum, T.P.
International Journal of Communication Systems , Vol. 12 , pp. 181-195 , 1999
FengYum99
Efficient multicast routing with delay constraints
Feng, G. & Yum, T.
International Journal of Communication Systems , Vol. 12 , pp. 181-195 , 1999
Fenger:Glenstrup
Performance evaluation of multirate time division multiplexed wavelength
routed optical networks
Fenger, C. & Glenstrup, A.
Computer Communications , Vol. 26 , pp. 1644-1650 , 2003
29.03.2006
JabRef Output
fr
Greedy randomized adaptive search procedures
Feo, T.A. & Resende, M.G.C.
Journal of Global Optimization , Vol. 6 , pp. 109-133 , 1995
fr2
A greedy randomized adaptive search procedure for maximum
independent set
Feo, T.A. & Resende, M.G.C.
Operations Research , Vol. 42 , pp. 860-878 , 1994
feo0
A probabilistic heuristic for a computationally difficult set covering
problem
Feo, T.A. & Resende, M.G.C.
Operations Research Letters , Vol. 8 , pp. 67-71 , 1989
FeoBarHol95a
Facility-wide planning and scheduling of printed
url
url
url
29.03.2006
JabRef Output
url
url
url
29.03.2006
JabRef Output
url
scheduling problem
Feo, T.; Venkatraman, K. & Bard, J.
Computers and Operations Research , Vol. 18 , pp. 635-643 , 1991
Feremans01
Generalized Spanning Trees and Expansions
C. Feremans
Universit Libre de Bruxelles, Institut de Statistique et de Recherche Oprationelle ,
2001
FeremansEtAl02
A Comparative Analysis of Several Formulations for the Generalized
Minimum Spanning Tree Problem
Feremans, C.; Labb, M. & Laporte, G.
Networks , Vol. 39 , pp. 29-34 , 2002
Feremans:Labbe:Laporte
The generalized minimum spanning tree problem:polyhedral analysis and
branch-and-cut algorithm
Feremans, C.; Labbe, M. & Laporte, G.
Networks , Vol. 43 , pp. 71-86 , 2004
FerMar99a
GRASP for seam drawing in mosaicking of aerial photographic maps
Fernndez, E. & Mart, R.
Journal of Heuristics , Vol. 5 , pp. 181-197 , 1999
fernandez1
On the undirected rural postman problem: tight bounds based on a new
29.03.2006
JabRef Output
formulation
Fernndez, E.; Meza, O.; Garfinkel, R. & Ortega, M.
Operations Research , Vol. 51 , pp. 281-291 , 2003
FerRib05
A multistart constructive heuristic for sequencing by hybridization using
adaptive memory
Fernandes, E. & Ribeiro, C.
Electronic Notes in Discrete Mathematics , 2005
Yaacov02
K-clustering in wireless ad hoc networks
Fernandess, Y. & Malkhi, D.
Proceedings of the Second ACM International Workshop on
Principles of Mobile Computing
, pp. 31-37 , 2002
FV90
A scheme for real-time channel establishment in wide-area networks
Ferrari, D. & Verma, D.
IEEE Journal on Selected Areas in Communications , Vol. 8 , pp. 368-379 , 1990
fer01
On the Design of Multifiber WDM Network
Ferreira, A.; Prennes, S.; Richa, A.; Rivano, H. & Stier, N.
2001
FerreiraEtAl03
Models, Complexity and Algorithms for the Design of Multi-fiber WDM
Networks
Ferreira, A.; Prennes, S.; Rivano, H.; Richa, A. & Moses, N.
Telecommunication Systems , Vol. 24 , pp. 123-138 , 2003
ferreira2
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
ferris9
Modeling languages and Condor: metacomputing for optimization
Ferris, M.C. & Munson, T.S.
Mathematical Programming , Vol. 88 , pp. 487-505 , 2000
ferris6
Linear programming for the emergency broadcast system
Ferris, M.C. & Munson, T.S.
SIAG/OPT Views-and-News , Vol. 10(1) , pp. 6-8 , 1999
ferris5
Engineering and economic applications of complementarity problems
Ferris, M.C. & Pang, J.S.
SIAM Review , Vol. 39 , pp. 669-713 , 1997
FerPhi
An interior point method for semi-infinite linear programming
Ferris, M.C. & Philpott, A.B.
Mathematical Programming , Vol. 43 , pp. 257-276 , 1989
FerPhi2
On the performance of Karmarkar's algorithm
Ferris, M.C. & Philpott, A.B.
Operational Research Society Journal , Vol. 39 , pp. 257-270 , 1988
ferris12
Robust path choice in networks with failures
Ferris, M.C. & Ruszczyski, A.
Networks , Vol. 35 , pp. 181-194 , 2000
Fes00a
New Auction Algorithms for Shortest Path Problems
P. Festa
29.03.2006
JabRef Output
url
url
Festa, P.
AIROnews , Vol. 7 , pp. 7-11 , 2003
FesParRibRes02a
Randomized heuristics for the MAX-CUT problem
Festa, P.; Pardalos, P.M.; Resende, M.G.C. & Ribeiro, C.C.
Optimization Methods and Software , Vol. 7 , pp. 1033-1058 , 2002
FesParRes01a
Algorithm 815: FORTRAN Subroutines for
Computing Approximate Solution to Feedback Set
Problems using GRASP
Festa, P.; Pardalos, P. & Resende, M.
ACM Transactions on Mathematical Software , Vol. 27 , pp. 456-464 , 2001
FesParRes99a
FORTRAN Subroutines for Computing Approximate Solution to Feedback
Set Problems using GRASP
Festa, P.; Pardalos, P. & Resende, M.
1999
FesParResRib02a
Randomized heuristics for the max-cut problem
Festa, P.; Pardalos, P.; Resende, M. & Ribeiro, C.
Optimization Methods and Software , Vol. 7 , 2002
FesRai01a
GRASP in switching input optimal control synthesis
Festa, P. & Raiconi, G.
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
approximate data
Filipowski, S.
SIAM Journal on Optimization , Vol. 9(4) , pp. 1010-1040 , 1999
filipowski2
On the complexity of solving sparse symmetric linear programs specified
with approximate data
Filipowski, S.
Mathematics of Operations Research , Vol. 22 , pp. 769-792 , 1997
filipowski1
On the complexity of solving feasible systems of linear inequalities
specified with approximate data
Filipowski, S.
Mathematical Programming , Vol. 71 , pp. 259-288 , 1995
40fin
A practical architecture for implementing end-to-end QoS in an IP network
Fineberg, V.
IEEE Communication Magazine , Vol. 40 , pp. 122 - 130 , 2002
fsv00
Solving General Ring Network Design Problems by Meta-Heuristics
Fink, A.; Schneidereit, G. & Vo, S.
pp. 91-113 , 2000
FinSchVos99
Solving general ring network design problems by meta-heuristics
Fink, A.; Schneidereit, G. & Voss, S.
pp. 91-113 , 1999
FiScVo98
Ring Network Design for Metropolitan Area Networks
Fink, A.; Schneidereit, G. & Voss, S.
29.03.2006
JabRef Output
1998
fischetti1
A branch-and-cut algorithm for the symmetric generalized traveling
salesman problem
Fischetti, M.; Gonzlez, J.J.S. & Toth, P.
Operations Research , Vol. 45 , pp. 378-394 , 1997
fischetti5
Solving the orienteering problem through branch-and-cut
Fischetti, M.; Gonzalez, J.J.S. & Toth, P.
INFORMS Journal on Computing , Vol. 10 , pp. 133-148 , 1998
Fischetti:Jacur:Gonzalez
Optimisation of the interconnecting network of a UMTS radio mobile
telephone system
Fischetti, M.; Jacur, G. & Gonzlez, J.
European Journal of Operational Research , Vol. 144 , pp. 56-67 , 2003
fis96
Frequency Assignment in Mobile Radio Systems using Branch-and-cut
Techniques
Fischetti, M.; Lepschy, C.; Minerva, G.; Jacur, G. & Toto, E.
pp. 312-314 , 1996
FiLeMiRoTo00
Frequency assignment in mobile radio systems using branch-and-cut
techniques
Fischetti, M.; Lepschy, C.; Minerva, G.; Romanin-Jacur, G. & Toto, E.
European Journal of Operational Research , Vol. 123 , pp. 241-255 , 2000
fischetti6
Models and algorithms for the 2-dimensional cell suppression problem in
statistical disclosure control
Fischetti, M. & Salazar, J.J.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Fi81
The Lagrangean Relaxation Method for Solving Integer Programming
Problems
Fisher, M.
Management Science , Vol. 27 , pp. 1-18 , 1981
Fisher:81
The Lagrangian Relaxation Method for Solving Integer Programming
Problems
Fisher, M.
Management Science , Vol. 27(1) , pp. 1-18 , 1981
Fisher:1
A Dual Algorithm for the One-Machine Scheduling Problem
Fisher, M.
Mathematical Programming , Vol. 11 , pp. 229-251 , 1976
Fisher
Optimal Solution of Scheduling Problems Using Lagrangian Multipliers:
Part I
Fisher, M.
Operations Research , Vol. 21 , pp. 1114-1127 , 1973
Fisher:Jaikumer
A Generalized Assignment Heuristic for Vehicle Routing
Fisher, M. & Jaikumer, R.
Networks , Vol. 11 , pp. 109-124 , 1981
Fial78a
An Analysis of Approximations for Maximizing Submodular Set Functions
I
Fisher, M.; Nemhauser, G. & Wolsey, L.
Mathematical Programming , Vol. 14 , pp. 265-294 , 1978
Fial78b
An Analysis of Approximations for Maximizing Submodular Set Functions
29.03.2006
JabRef Output
II
Fisher, M.; Nemhauser, G. & Wolsey, L.
Mathematical Programming Study , Vol. 8 , pp. 73-87 , 1978
FiNeWo78a
An Analysis of Approximations for Maximizing Submodular Set Functions
I
Fisher, M.; Nemhauser, G. & Wolsey, L.
Mathematical Programming , Vol. 14 , pp. 265-294 , 1978
FiNeWo78b
An Analysis of Approximations for Maximizing Submodular Set Functions
II
Fisher, M.; Nemhauser, G. & Wolsey, L.
Mathematical Programming Study , Vol. 8 , pp. 73-87 , 1978
Fial75
Using Duality to Solve Discrete Optimization Problems: Theory and
Computational Experience
Fisher, M.; Northup, W. & Shapiro, F.
Mathematical Programming Study , Vol. 3 , pp. 56-94 , 1975
FiNoSh75
Using Duality to Solve Discrete Optimization Problems: Theory and
Computational Experience
Fisher, M.; Northup, W. & Shapiro, F.
Mathematical Programming Study , Vol. 3 , pp. 56-94 , 1975
Fisher:Northup:Shapiro
Using Duality to Solve Discrete Optimization Problems: Theory and
Computational Experience
Fisher, M.; Northup, W. & Shapiro, J.
Mathematical Programming Study , Vol. 3 , pp. 56-94 , 1975
Fisher:Shapiro
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
fletcher9
Solving mathematical programs with complementarity constraints as
nonlinear programs
Fletcher, R. & Leyffer, S.
Optimization Methods and Software , Vol. 18 , pp. 15-40 , 2004
fletcher7
Numerical experience with solving MPECs as NLPs
url
url
url
url
url
29.03.2006
JabRef Output
models
Fleten, S.; H}yland, K. & Wallace, S.W.
European J. Oper. Res , Vol. 140 , pp. 37-49 , 2002
FleGlo99
Improved constructive multistart strategies for the quadratic assignment
problem using adaptive memory
Fleurent, C. & Glover, F.
INFORMS Journal on Computing , Vol. 11 , pp. 189-203 , 1999
FleGlo99a
Improved constructive multistart strategies
for the quadratic assignment problem using
adaptive memory
Fleurent, C. & Glover, F.
INFORMS Journal on Computing , Vol. 11 , pp. 198-204 , 1999
fliege1
An Efficient Interior-Point Method for Convex Multicriteria
Optimization Problems
url
Fliege, J.
2004
fliege2
A multicriteria approach to bilevel optimization
url
29.03.2006
JabRef Output
Floren
A note on "A faster approximation algorithm for the Steiner problem in
graphs"
Floren, R.
Information Processing Letters , Vol. 38 , pp. 177-178 , 1991
Fl77
An improved linear approximation algorithm for the network equilibrium
(packet switching) problem
Florian, M.
Proceedings of the 1977 Conference on Decision and Control , Vol. FA 1-10:00 , pp.
812-818 , 1977
FlorHearn
Network Equilibrium Models and Algorithms
Florian, M. & Hearn, D.
Vol. 8 , pp. 485-550 , 1995
floudas3
Recent Advances in Global Optimization for Process Synthesis,
Design and Control: Enclosure of All Solutions
url
Floudas, C.A.
1999
floudas6
Deterministic global optimization: theory, methods and applications
Floudas, C.A.
Kluwer Academic Publishers , 1999
floudas4
Global optimization in design and control of chemical process
systems
url
Floudas, C.A.
Proceedings of DYCOPS-5 on Dynamics and Control of Process Systems , pp. 167-178 ,
1998
29.03.2006
JabRef Output
floudas2
Nonlinear and Mixed Integer Optimization
Floudas, C.A.
Oxford University Press , 1995
FlAg
A decomposition strategy for global optimum search in the pooling
problem
Floudas, C.A. & Aggarwal, A.
ORSA Journal on Computing , Vol. 2(3) , pp. 225-235 , 1990
floudas5
Handbook of test problems in local and global optimization
Floudas, C.A.; Pardalos, P.M.; Adjiman, C.; Esposito, W.R.; Gms, Z.H.;
Harding, S.T.; Klepeis, J.L.; Meyer, C.A. & Schweiger, C.A.
Kluwer Academic Publishers , 1999
FP
Handbook of Test Problems in Local and Global Optimization
Floudas, C.A.; Pardalos, P.M.; Adjiman, C.S.; Esposito, W.R.; Gumus, Z.H.;
Harding, S.T.; Klepeis, J.L.; Meyer, C.A. & Schweiger, C.A.
Kluwer Academic Publishers , 1999
FloydJacobson1995
Link sharing and resource management models for packet networks
Floyd, S. & Jacobson, V.
IEEE/ACM Transactions on Networking , Vol. 3 , pp. 365-386 , 1995
fong:01
Better Alternatives to OSPF Routing
Fong, J.; Gilbert, A.; Kannan, S. & Strauss, M.
Proc. Workshop on Approximation and Randomized Algorithms in Communication
Networks , 2001
Fonseca95
Multiobjective genetic algorithms made easy: Selection sharing and mating
29.03.2006
JabRef Output
restriction
Fonseca, C. & Fleming, P.
First International Conference on 'Genetic Algorithms in Engineering Systems:
Innovations and Applications' GALESIA (Conf. Publ. No.414) , pp. 45-52 , 1995
Nelson02
A procedure for resource allocation in switchlet networks
Fonseca, N.; Castro, A. & Rios, A.
GLOBECOM 2002, IEEE Global Telecommunications Conference , Vol. 21 , pp. 18951898 , 2002
ForFul62
Flows in Networks
Ford, L. & Fulkerson, D.
Princeton University Press , 1962
F56
Network Flow Theory
Ford, L.
1956
FoFu62
Flows in Networks
Ford, L. & Fulkerson, D.
Princeton University Press , 1962
Ford:Fulkerson_1958
A suggested computation for maximal multicommodity network flows
Ford, L. & Fulkerson, D.
Management Science , Vol. 5 , pp. 97-101 , 1958
For56a
Network Flow Theory
Ford, L.J.
29.03.2006
JabRef Output
1956
Forrest:Hirst:Tomlin
Practical solution of large mixed integer programming problems with
UMPIRE
Forrest, J.; Hirst, J. & Tomlin, J.
Management Science , Vol. 20 , pp. 736-773 , 1974
forsgren3
Optimality conditions for nonconvex semidefinite programming
url
Forsgren, A.
Mathematical Programming , Vol. 88(1) , pp. 105-128 , 2000
forsgren1
Primal-dual interior point methods for nonconvex nonlinear
programming
url
29.03.2006
JabRef Output
forsgren4
On weighted linear least-squares problems related to interior
methods for convex quadratic programming
url
29.03.2006
JabRef Output
des94-4
Minimum-weight two-connected networks with bounded cycle
lengths
Fortz, B.
1994
FL04
Two-connected networks with rings of bounded cardinality
Fortz, B. & Labb, M.
Computational Optimization and Applications , Vol. 27 , pp. 123-148 , 2004
FL02
Polyhedral results for two-connected networks with bounded rings
Fortz, B. & Labb, M.
Mathematical Programming , Vol. 93 , pp. 27-54 , 2002
FL02a
Two-connected networks with rings of bounded cardinality
Fortz, B. & Labb, M.
2002
des99-1
Structural results for two-connected networks with rings
of bounded cardinality
Fortz, B. & Labb, M.
1999
des99-2
Facets for the polyhedron of two-connected networks
with bounded rings
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
FoLaMa00
Solving the two-connected network with bounded meshes problem
Fortz, B.; Labb, M. & Maffioli, F.
Operations Research , Vol. 48 , pp. 866-877 , 2000
FortzLabbeMaffioli00
Solving the two-connected network with bounded meshes problem
Fortz, B.; M.~Labb & F.~Maffioli
Operations Research , Vol. 48 , pp. 866-877 , 2000
FMMP03
Two-edge connected subgraphs with bounded rings: Polyhedral results
and Branch-and-Cut
Fortz, B.; Mahjoub, A.; Mc Cormick, S. & Pesneau, P.
2003
FORTZ2
Traffic Engineering with Traditional IP Routing Protocols
Fortz, B.; Rexford, J. & Thorup, M.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Fortz-Thorup
Internet Traffic Engineering by optimizing OSPF Weights
Fortz, B. & Thorup, M.
Proc. 19th IEEE Conference on Computer Communications (INFOCOM'2000) , pp.
519-528 , 2000
FORTZ1
Internet Traffic Engineering by Optimizing OSPF Weights
Fortz, B. & Thorup, M.
Proceedings of IEEE INFOCOM'00 , 2000
fortzT1
Increasing Internet Capacity Using Local Search
Fortz, B. & Thorup, M.
2000
FortzThorup2000
Internet traffic engineering by optimizing OSPF weights
Fortz, B. & Thorup, M.
Proceedings of IEEE INFOCOM 2000 , pp. 519-528 , 2000
FT00
Internet Traffic Engineering by Optimizing OSPF Weights
Fortz, B. & Thorup, M.
Proc. 19th IEEE Conf. on Computer Communications (INFOCOM) , pp. 519-528 , 2000
thorup:00
Internet Traffic Engineering by Optimizing OSPF Weights
Fortz, B. & Thorup, M.
Proc. IEEE INFOCOM , 2000
des94-3
Heuristics for the Optimum 2-Connected
Spanning Subgraph Problem with Cycle Constraints
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
fox2
Faster simulated annealing
Fox, B.L.
SIAM Journal on Optimization , Vol. 5 , pp. 488-505 , 1995
fox1
Integrating and accelerating tabu search, simulated annealing, and genetic
algorithms
Fox, B.L.
Annals of Operations Research , Vol. 41 , pp. 47-67 , 1993
fragniere1
Structure exploiting tool in algebraic modeling languages
url
url
29.03.2006
JabRef Output
Benders Decomposition
Frana, P. & Luna, H.
Transportation Science , Vol. 16 , pp. 113-126 , 1982
FrancisMcginnisWhite
Facility Layout and Location: An Analytical Approach
Francis, R.L.; McGinnis, L.F. & White, J.A.
Prentice-Hall , 1992
FrancisWhite
Facility Layout and Location: An Analytical Approach
Francis, R.L. & White, J.A.
Prentice-Hall , 1974
FMcGW92
Facility Layout and Location: An Analytical Approach
Francis, R.; McGinnis Jr., L. & White., J.
Prentice-Hall , 1992
FrMcWh83
Locational Analysis
Francis, R.; McGinnis, L. & White, J.
European Journal of Operational Research , Vol. 12 , pp. 220-252 , 1983
franconi1
Microaggregation and model based methods for disclosure
limitation and their application to business microdata
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
FW56
An algorithm for quadratic programming
Frank, M. & Wolfe, P.
Naval Research Logistics Quarterly , Vol. 3 , pp. 95-110 , 1956
ofrank1
On reliability in stochastic networks
Frank, O. & Gaul, W.
Networks , Vol. 12 , pp. 119-126 , 1982
FrantzeskakisLuss1999
The network redesign problem for access telecommunications networks
Frantzeskakis, L.F. & Luss, H.
Naval Research Logistics , Vol. 46 , pp. 487-506 , 1999
frantzeskakis1
Bounding procedures for multistage stochastic dynamic networks
Frantzeskakis, L.F. & Powell, W.B.
Networks , Vol. 23 , pp. 575-595 , 1993
Frantzeskaskis:Luss
The network redesign problem for access telecommunications networks
Frantzeskaskis, L. & Luss, H.
Naval Research Logistics , Vol. 46 , pp. 487-506 , 1999
Fraser00
The strategic challenge of electronic commerce
Fraser, J.; Fraser, N. & McDonald, F.
Supply Chain Management: An International Journal , Vol. 5 , pp. 7-14 , 2000
fragerkle73
The flow-deviation method: an approach to store-and-forward
communication network design
Fratta, F.; Gerla, M. & Kleinrock, L.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Frederickson, G. & J J, J.
SIAM Journal on Computing , Vol. 10 , pp. 270-283 , 1981
FreTar87a
Fibonacci heaps and their uses in improved networkoptimization
algorithms
Fredman, M. & Tarjan, R.
Journal of ACM , Vol. 34 , pp. 596-615 , 1987
frenk1
An interior point subgradient method for linearly constrained
nondifferentiable convex programming
url
url
Freund, R.M.
Mathematical Programming , Vol. 99 , pp. 197-221 , 2004
freund7
On the Primal-Dual Geometry of Level Sets in Linear and Conic
Optimization
url
Freund, R.M.
2001
Freund3453
Following a ``balanced'' trajectory from an infeasible point to an optimal
linear programming solution with a polynomial-time algorithm
Freund, R.M.
Mathematical Programming , Vol. 21 , pp. 839-859 , 1996
Freund180
Projective transformations for interior--point algorithms,
29.03.2006
JabRef Output
29.03.2006
JabRef Output
freund2
Interior Point Methods: Current Status and Future Directions
url
url
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Fri83
Complexity of a 3-dimensional assignment problem
Frieze, A.
European Journal of Operational Research , Vol. 13 , pp. 161-164 , 1983
FriIanMag94
A wavelength-division-multiplexed passive optical network with costshared components
Frigo, N.; Iannone, P.; Magill, P.; Darcie, T.; Downs, M.; Desai, B.; Koren,
U.; Koch, T.; Dragone, C.; Presby, H. & Bodeep, G.
IEEE Photonic Technology Letter , Vol. 6 , pp. 1365-1367 , 1994
Gila
Dynamic online and offline channel pricing for heterogeneous customers
in virtual acceptances
Fruchter, G.E. & Tapiero, C.
International Game Theory Review , 2005
fu1
Approximation algorithms for quadratic programming
Fu, M.; Luo, Z. & Ye, Y.
Journal of Combinatorial Optimization , Vol. 2 , pp. 29-50 , 1998
Fuchs03
A note on the terminal Steiner tree problem
Fuchs, B.
Information Processing Letters , Vol. 87 , pp. 219-220 , 2003
fujie2
Semidefinite programming relaxation for nonconvex quadratic programs
Fujie, T. & Kojima, M.
Journal of Global Optimization , Vol. 10 , pp. 367-380 , 1997
fujie1
29.03.2006
JabRef Output
url
url
url
url
29.03.2006
JabRef Output
url
url
url
url
29.03.2006
JabRef Output
url
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
Gnlk, O.; Kimbrel, T.; Ladanyi, L.; Schieber, B. & Sorkin, G.B.
2004
gunluk1
Mixing mixed-integer inequalities
Gnlk, O. & Pochet, Y.
Mathematical Programming , Vol. 90 , pp. 429-457 , 2001
guler7
On the Self-Concordance of the Universal Barrier Function
Gler, O.
SIAM Journal on Optimization , Vol. 7 , pp. 295-303 , 1997
guler8
Hyperbolic Polynomials and Interior Point Methods for Convex
Programming
Gler, O.
Mathematics of Operations Research , Vol. 22 , pp. 350-377 , 1997
29.03.2006
JabRef Output
guler4
Barrier functions in interior point methods
Gler, O.
Mathemtics of Operations Research , Vol. 21 , pp. 860-885 , 1996
guler5
Limiting behavior of weighted central paths in linear programming
Gler, O.
Mathematical Programming , Vol. 65 , pp. 347-363 , 1994
guler9
Ergodic convergence in proximal point algorithms with Bregman
functions
Gler, O.
pp. 155-165 , 1994
guler6
Characterization of the Barrier Parameter of Homogeneous Convex Cones
Gler, O. & Tunel, L.
Mathematical Programming , Vol. 81 , pp. 55-76 , 1995
GulerYe
Convergence behaviour of interior point algorithms
Gler, O. & Ye, Y.
Mathematical Programming , Vol. 60(2) , pp. 215-228 , 1993
gomez1
Solving some special cases of Inexact Linear Programming
problems via cutting plane methods
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Gal99
UMTS the next generation of mobile radio
Gallagher, M. & Webb, W.
IEE Review , Vol. 45 , pp. 59-63 , 1999
eva1
Constrained discriminant analysis via 0/1 mixed integer programming
Gallagher, R.J.; Lee, E.K. & Patterson, D.A.
Annals of Operations Research --- Non-Traditional Approaches to Statistical
Classification and Regression , Vol. 74 , pp. 65-88 , 1997
Gal59a
ber extreme Punkt- und Kantenmengen
Gallai, T.
Ann. Univ. Sci. Budapest. Etvs Sect. Math. , Vol. 2 , pp. 133-138 , 1959
gallo2
Max Horn SAT and the minimum cut problem in directed hypergraphs
Gallo, G.; Gentile, C.; Pretolani, D. & Rago, G.
Mathematical Programming , Vol. 80 , pp. 213-237 , 1998
gallo1
Network Optimization: Algorithms and Applications (Foreword)
Gallo, G. & Grigoriadis, M.D.
Mathematical Programming , Vol. 78 , pp. 105-108 , 1997
GalPal88a
Shortest Path Methods
Gallo, G. & Pallottino, S.
Ann. Oper. Res. , Vol. 7 , pp. 3-79 , 1988
GalPal86a
Shortest Path Methods: A Unified Approach
Gallo, G. & Pallottino, S.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
J. L. Ganley
Department of Computer Science, University of Virginia , 1995
GanleyCohoonIJCGA
Improved computation of optimal rectilinear Steiner minimal trees
Ganley, J.L. & Cohoon, J.P.
International Journal of Computational Geometry and Applications , 1997
GanleyCohoonThumbnail
Thumbnail rectilinear Steiner trees
Ganley, J.L. & Cohoon, J.P.
Proceedings of the Fifth Great Lakes Symposium on VLSI , pp. 46-49 , 1995
GanleyCohoonCCCG
Optimal rectilinear Steiner minimal trees in~$O(n^2 2.62^n)$ time
Ganley, J.L. & Cohoon, J.P.
Proceedings of the Sixth Canadian Conference on Computational Geometry , pp. 308313 , 1994
GanleyCohoonGreatLakes
A faster dynamic programming algorithm for exact rectilinear Steiner
minimal trees
Ganley, J.L. & Cohoon, J.P.
Proceedings of the Fourth Great Lakes Symposium on VLSI , pp. 238-241 , 1994
29.03.2006
JabRef Output
GanleyCohoonISCAS
Routing a multi-terminal critical net: Steiner tree construction in the
presence of obstacles
Ganley, J.L. & Cohoon, J.P.
Proceedings of the International Symposium on Circuits and Systems , pp. 113-116 ,
1994
GanleySaloweBottle
Optimal and approximate bottleneck Steiner trees
Ganley, J.L. & Salowe, J.S.
Operations Research Letters , Vol. 19 , pp. 217-224 , 1996
Gao2001b
Inherently Safe Backup Routing with BGP
Gao, L.; Griffin, T.G. & Rexford, J.
Proc. IEEE INFOCOM , 2001
gao:01a
Stable Internet Routing Without Global Coordination
Gao, L. & Rexford, J.
IEEE/ACM Trans. Networking , Vol. 9 , pp. 681-692 , 2001
Gar01a
Algorithmic approach for the single source capacitated
plant location problem
J.A. Daz Garca
Departamento d'Estadstica i Investigaci Operativa,
Univarsitat Politcnica de Catalunya
, 2001
GarLozSmiGue01a
A comparison of GRASP and an exact method for solving a production and
delivery scheduling problem
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Gavish, B.
Networks , Vol. 12 , pp. 355-377 , 1982
GaAl90
Backbone Network Design Tools with Economic Tradeoffs
Gavish, B. & Altinkemer, K.
ORSA Journal on Computing , Vol. 2 , pp. 236-252 , 1990
GavishAltinkemer1990
Backbone network design tools with economic tradeoffs
Gavish, B. & Altinkemer, K.
ORSA Journal on Computing , Vol. 2 , pp. 236-252 , 1990
GavishNeuman92
Routing in a network with unreliable components
Gavish, B. & I.~Neuman
IEEE Transactions on Telecommunications , Vol. 40 , pp. 1248-1258 , 1992
GaNe89
A system for routing and capacity assignment in computer communication
networks
Gavish, B. & Neuman, I.
IEEE Transactions on Communications , Vol. 37 , pp. 360-366 , 1989
GavishNeuman1989
A system for routing and capacity assignment in computer communication
networks
Gavish, B. & Neuman, I.
IEEE Transactions on Communications , Vol. 37 , pp. 360-366 , 1989
GavPir85
Efficient Algorithms for Solving Multiconstraint Zero-One Knapsack
Problems to Optimality
Gavish, B. & Pirkul, H.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
problem
Gendreau, M.; Laporte, G.; Musaraganyi, C. & Taillard, E.
Computers and Operations Research , Vol. 26 , pp. 1153-1173 , 1999
gendreau1
A tabu search heuristic for the vehicle routing problem with stochastic
demands and customers
Gendreau, M.; Laporte, G. & Sguin, R.
Operations Research , Vol. 44 , pp. 469-477 , 1996
gendreau2
An exact algorithm for the vehicle routing problem with stochastic
demands and customers
Gendreau, M.; Laporte, G. & Sguin, R.
Transportation Science , Vol. 29 , pp. 143-155 , 1995
gendreau3
A tabu search heuristic for the vehicle routing problem
Gendreau, M.; Laporte, G. & Sguin, R.
Management Science , Vol. 40 , pp. 1276-1290 , 1994
Gendreau
A tabu search heuristic for the Steiner tree problem
Gendreau, M.; Larochelle, J. & Sans, B.
1998
GendreauEtAl99
A Tabu Search Heuristic for the Steiner Tree Problem
Gendreau, M.; Larochelle, J. & Sans, B.
Networks , Vol. 34 , pp. 162-172 , 1999
Gendreau98
A Tabu Search Heuristic for the Steiner Tree Problem
Gendreau, M.; Larochelle, J. & Sans, B.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Geoffrion1974
Lagrangian relaxation for integer programming
Geoffrion, A.
Mathematical Programming Study , Vol. 2 , pp. 82-114 , 1974
geogra74
Multicommodity distribution system design by Benders decomposition
Geoffrion, A. & Graves, G.
Management Science , Vol. 5 , pp. 822-844 , 1974
Ge75
A Guide to Computer-Assisted Methods for Distribution Systems Planning
Geoffrion, A.
Sloan Management Review , Vol. 16 , pp. 17-41 , 1975
Ge74
Lagrangean Relaxation for Integer Programming
Geoffrion, A.
Mathematical Programming Study 2 , 1974
Geo74
Lagrangian relaxation for integer programming
Geoffrion, A.
Mathematical Programming Study , Vol. 2 , pp. 82-114 , 1974
Ge72
Generalized Benders decomposition
Geoffrion, A.
Journal of Optimization Theory and Applications , Vol. 10 , pp. 237-260 , 1972
Ge71
Duality in Nonlinear Programming
Geoffrion, A.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Ge77
Topological design of distributed computer networks
Gerla, M. & Kleinrock, L.
IEEE Trans. Comm. , Vol. COM-25 , pp. 48-60 , 1977
GeKl77
On the Topological Design of Distributed Computer Networks
Gerla, M. & Kleinrock, L.
IEEE Transactions on Communications , Vol. 25 , pp. 48-60 , 1977
GerlaKleinrock1977
On the topological design of distributed computer networks
Gerla, M. & Kleinrock, L.
IEEE Transactions on Communications , Vol. COM-25 , pp. 48-61 , 1977
GeMoPa89
Topology design and bandwidth allocation in ATM nets
Gerla, M.; Monteiro, J. & Pazos, R.
IEEE Journal on Selected Areas in Communications , Vol. 7 , pp. 1253-1261 , 1989
GerlaTsai95
Multicluster, mobile, multimedia radio network
Gerla, M. & Tsai, J.T.C.
Wireless Networks , Vol. 1 , pp. 255-265 , 1995
GerTsa95
Multicluster, Mobile, Multimedia Radio Network
Gerla, M. & Tsai, J.
Wireless Networks , Vol. 1 , pp. 255-265 , 1995
Gerla95
Multicluster, mobile, multimedia radio network
Gerla, M. & Tsai, J.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Gho96a
Computational aspects of the maximum diversity problem
url
Ghosh, J.
Operations Research Letters , Vol. 19 , pp. 175-181 , 1996
GIBBENS
Dynamic Alternative Routing: Modeling and Behavior
Gibbens, R.J.; Kelly, F.P. & Key, P.
Proc. 12th Int'l Teletraffic Congress, ITC 12 , 1988
Gibbons1
A continuous based heuristic for the maximum clique problem
Gibbons, L.E.; Hearn, D.W. & Pardalos, P.M.
Vol. 26 , pp. 103-124 , 1996
Gibbons2
Continuous characterizations of the maximum clique problem
Gibbons, L.E.; Hearn, D.W.; Pardalos, P.M. & Ramana, M.V.
Math. Oper. Res. , Vol. 22 , pp. 754-768 , 1997
Gibbs03
Environment and policy factors shaping global e-commerce diffusion: A
cross-country comparison
Gibbs, J.; Kraemer, K. & Dedrick, J.
The Information Society , Vol. 19 , pp. 5-18 , 2003
GilbertPollak
Steiner minimal trees
Gilbert, E.N. & Pollak, H.O.
SIAM Journal on Applied Mathematics , Vol. 16 , pp. 1-29 , 1966
jcgilbert1
Examples of ill-behaved central paths in convex optimization
url
29.03.2006
JabRef Output
2001
gilbert1
An efficient algorithm to compute row and column counts for sparse
Cholesky factorization
Gilbert, J.R.; Ng, E.G. & Peyton, B.W.
SIAM Journal on Matrix Analysis and Applications , Vol. 15 , pp. 1075-1091 , 1994
gilder00
TELECOSM: How Infinite Bandwidth will Revolutionize Our World
Gilder, G.
Free Press , 2000
Vitetal91
On the capacity of a cellular CDMA system
Gilhousen, K.S.; Jacobs, I.M.; Padovani, R.; Viterbi, A.J.; Weaver, L.A. &
Wheatley, C.E.
IEEE Trans. on Vehicular Technology , Vol. 40 , pp. 303-312 , 1991
gill7
LIMITED-MEMORY REDUCED-HESSIAN METHODS FOR LARGE-SCALE
UNCONSTRAINED OPTIMIZATION
Gill, P.E. & Leonard, M.W.
1997
gill5
Primal-dual methods for linear programming
Gill, P.E.; Murray, W.; Poncleon, D.B. & Saunders, M.A.
Mathematical Programming , Vol. 70 , pp. 251-277 , 1995
gill8
SNOPT: An SQP algorithm for large-scale constrained optimization
url
29.03.2006
JabRef Output
GMSTW
On Projected Newton Barrier Methods for Linear Programming and an
Equivalence to Karmarkar's Projective Method
Gill, P.E.; Murray, W.; Saunders, M.A.; Tomlin, J.A. & Wright, M.H.
Mathematical Programming , Vol. 36 , pp. 183-209 , 1986
gill6
Some theoretical properties of an augmented Lagrangian merit function
Gill, P.E.; Murray, W.; Saunders, M.A. & Wright, M.H.
pp. 101-1?? , 1992
GMSWqp
Inertia-controlling methods for quadratic programming
Gill, P.E.; Murray, W.; Saunders, M.A. & Wright, M.H.
SIAM Review , Vol. 33(1) , pp. 1-36 , 1991
GMSWopt
Constrained Nonlinear Programming
Gill, P.E.; Murray, W.; Saunders, M.A. & Wright, M.H.
pp. 171-210 , 1989
GMSW
Sparse Matrix Methods in Optimization
Gill, P.E.; Murray, W.; Saunders, M.A. & Wright, M.H.
SIAM Journal on Scientific and Statistical Computing , Vol. 5 , pp. 562-589 , 1984
gill4
Numerical Linear Algebra and Optimization
Gill, P.E.; Murray, W. & Wright, M.H.
Addison-Wesley , 1991
GMW
Practical Optimization
Gill, P.E.; Murray, W. & Wright, M.H.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
Givens, W.
SIAM Journal on Applied Mathematics , Vol. 6 , pp. 26-50 , 1958
glashoff1
Linear Optimization and Approximation
Glashoff, K. & Gustafson, S.
Springer Verlag , 1983
Gla78
A quadratic network optimization model for equilibrium single commodity
trade flows
Glassey, C.
Mathematical Programming , Vol. 14 , pp. 98-107 , 1978
glineur2
Topics in Convex Optimization: Interior-Point Methods, Conic
Duality and Approximations
url
F. Glineur
Service MATHRO, Facult Polytechnique de Mons , 2001
glineur1
Proving strong duality for geometric optimization using a conic
formulation
url
Glineur, F.
1999
GlineurPhD01
Topics in Convex Optimization: Interior-Point methods, Conic
Duality and Approximations
url
Fr. Glineur
Facult Polytechnique de Mons , 2001
Image0101
Conic optimization: an elegant framework for convex optimization
url
Glineur, F.
29.03.2006
JabRef Output
2001
Glineur00
An extended conic formulation for geometric optimization
url
Glineur, F.
Foundations of Computing and Decision Sciences , Vol. 25 , pp. 161-174 , 2000
Image0001
Polyhedral approximation of the second-order cone: computational
experiments
url
Glineur, F.
2000
Image0006
An extended conic formulation for geometric optimization
url
Glineur, F.
2000
Image0007
Self-concordant functions in structured convex optimization
url
Glineur, F.
2000
Image0008
Approximating geometric optimization with $l_p$-norm
optimization
url
Glineur, F.
2000
Image9901
Interior-point methods for linear programming: a guided tour
url
Glineur, F.
1999
Image9903
29.03.2006
JabRef Output
url
Glineur, F.
1999
Glineur98
Interior-point methods for linear programming: a guided tour
url
Glineur, F.
Belgian Journal of Operations Research, Statistics and Computer Science , Vol. 38 , pp.
3-30 , 1998
GlineurDEA98
Pattern separation via ellipsoids and conic programming
url
Glineur, Fr.
Facult Polytechnique de Mons , 1998
Glineur97
Etude des mthodes de point intrieur appliques la
programmation linaire et la programmatiuon semidfinie
url
Glineur, Fr.
Facult Polytechnique de Mons , 1997
Image0005
A conic formulation for $l_p$-norm optimization
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Tabu search
Glover, F. & Laguna, M.
Kluwer Publishers , 1997
GloLag97
Tabu Search
Glover, F. & Laguna, M.
Kluwer , 1997
glover4
Tabu Search
Glover, F. & Laguna, M.
Kluwer Academic Publishers , 1997
GloverLaguna97
Tabu Search
Glover, F. & Laguna, M.
Kluwer Academic Publishers , 1997
tabu97-1
Tabu Search
Glover, F. & Laguna, M.
Kluwer Academic Publishers , 1997
GloLagMar03
Scatter search and path relinking: Advances and applications
Glover, F.; Laguna, M. & Marti, R.
pp. 1-35 , 2003
GloLagMar00a
Fundamentals of scatter search and path relinking
Glover, F.; Laguna, M. & Mart, R.
Control and Cybernetics , Vol. 39 , pp. 653-684 , 2000
29.03.2006
JabRef Output
GloverA2000
Fundamentals of scatter search and path relinking
Glover, F.; Laguna, M. & Marti, R.
Control and Cybernetics , Vol. 39 , pp. 653-684 , 2000
eject3
TSP ejection chains
Glover, F. & Pesch, E.
Discrete Applied Mathematics , Vol. 76 , pp. 165-181 , 1997
glover5
Foundation-penalty cuts for mixed-integer programming
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
url
Goemans, M.X.
Mathematical Programming , Vol. 79 , pp. 143-161 , 1997
goemans2
Worst-case comparison of valid inequalities for the TSP
Goemans, M.X.
Mathematical Programming , Vol. 69 , pp. 335-349 , 1995
Go94
The Steiner tree polytope and related polyhedra
Goemans, M.X.
Mathematical Programming , Vol. 63 , pp. 157-182 , 1994
Goemans
The Steiner tree polytope and related polyhedra
Goemans, M.X.
Mathematical Programming , Vol. 63 , pp. 157-182 , 1994
goemans4
The Steiner tree polytope and related polyhedra
Goemans, M.X.
Mathematical Programming , Vol. 63 , pp. 157-182 , 1994
GoMy93
A Catalogue of Steiner Tree Formulations
29.03.2006
JabRef Output
29.03.2006
JabRef Output
des93-5
Survivable networks, LP relaxations and the
parsimonious property
Goemans, M. & Bertsimas, D.
Mathematical Programming , Vol. 60 , pp. 145-166 , 1993
Goemans93
A Catalog of Steiner Tree Formulations
Goemans, M. & Myung, Y.
Networks , Vol. 23 , pp. 19-28 , 1993
GWinH97
A Primal-Dual Method for Approximation Algorithms and its Application
to Network Design Problems
Goemans, M. & William-son, D.
1997
des96-3
The primal-dual method for approximation
algorithms and its application to network design problems
Goemans, M. & Williamson, D.
Approximation Algorithms for NP-Hard Problems , 1996
GoeWil96
The primal dual method for approximation algorithms and its application
to network design problems
Goemans, M. & Williamson, D.
pp. 144-191 , 1996
des95-8
A general approximation technique for
constrained forest problems
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
GolKha93
On implementing scaling push-relabel algorithms for the minimum-cost
flow problem
Goldberg, A. & Kharitonov, M.
pp. 157-198 , 1993
golops98
An implementation of a combinatorial approximation algorithm for
minimum-cost multicommodity flow
Goldberg, A.V.; Oldham, J.D.; Plotkin, S. & Stein, C.
Proceedings of the 6th international IPCO conference, Houston, Texas, June 22-24,
1998 , Vol. 1412 , pp. 338-352 , 1998
Gol01a
A Simple Shortest Path Algorithm with Linear Average Time
Goldberg, A.
2001
GolSil97a
Implementations of Dijkstra's Algorithm Based on Multi-LevelBuckets
Goldberg, A. & Silverstein, C.
pp. 292-327 , 1997
Goldberg89
Genetic Algorithms in Search, Optimization, and Machine Learning
Goldberg, D.E.
Addison-Wesley , 1989
Gol89
Genetic algorithms in search, optimization, and machine learning
Goldberg, D.
Addison-Wesley , 1989
Goldberg:book
29.03.2006
JabRef Output
url
Goldfarb, D.
2002
goldfarb5
Robust convex quadratically constrained programs
url
url
29.03.2006
JabRef Output
goldfarb7
A polynomial dual simplex algorithm for the generalized circulation
problem
Goldfarb, D.; Jin, Z. & Lin, Y.
Mathematical Programming , Vol. 91 , pp. 271-288 , 2002
goldfarb8
Combinatorial interior point methods for generalized network flow
problems
Goldfarb, D. & Lin, Y.
Mathematical Programming , Vol. 93 , pp. 227-246 , 2002
GldLiu
An O$(n^3L)$ primal interior point algorithm for convex quadratic
programming
Goldfarb, D. & Liu, S.
Mathematical Programming , Vol. 49(3) , pp. 325-340 , 1990/1991
GldLiuWang
A logarithmic barrier function algorithm for quadratically constrained
convex quadratic programming
Goldfarb, D.; Liu, S. & Wang, S.
SIAM Journal on Optimization , Vol. 1(2) , pp. 252-267 , 1991
goldfarb3
On parametric semidefinite programming
Goldfarb, D. & Scheinberg, K.
Applied Numerical Mathematics: Transactions of IMACS , Vol. 29 , pp. 361-377 , 1999
goldfarb1
Interior Point Trajectories in Semidefinite Programming
url
29.03.2006
JabRef Output
Linear Programming
Goldfarb, D. & Todd, M.J.
pp. 73-170 , 1989
gold
Property testing in massive graphs
Goldreich, O.
pp. 123-147 , 2002
Goldschmidt:Laugier:Olinick
SONET/SDH ring assignment with capacity constraints
Goldschmidt, O.; Laugier, A. & Olinick, E.
Discrete Applied Mathematics , Vol. 129 , pp. 99-128 , 2003
GVL3
Matrix Computations
Golub, G.H. & Loan, C.F.V.
Johns Hopkins University Press , 1996
GVL
Matrix Computations
Golub, G.H. & Loan, C.F.V.
Johns Hopkins University Press , 1983
GomOli01a
A GRASP approach to the nesting problem
Gomes, A. & Oliveira, J.
Proceedings of MIC'2001 , pp. 47-52 , 2001
GMLO98
Asynchronous Organizations for Solving the Point-to-Point Connection
Problem
Gomes, F.; Meneses, C.; Lima, A. & Oliveira, C.
Proc. of the Intl. Conference on Multiagents Systems (ICMAS) , pp. 144-149 , 1998
29.03.2006
JabRef Output
GomSil99a
An experimental evaluation of the GRASP metaheuristic
applied to the uncapacitated location problem
Gomes, M. & da Silva, J.
1999
gomory9
Early integer programming
Gomory, R.E.
Operations Research , Vol. 50 , pp. 78-81 , 2002
Gom3
An algorithm for integer solutions to linear programs
Gomory, R.E.
pp. 269-302 , 1963
Gom2
Solving linear programming problems in integers
Gomory, R.E.
Combinatorial Analysis , pp. 211-215 , 1960
Gom1
Outline of an algorithm for integer solutions to linear programs
Gomory, R.E.
Bulletin of the American Mathematical Society , Vol. 64 , pp. 275-278 , 1958
GoHu61
Multi-terminal Networks Flows
Gomory, R.E. & Hu, T.C.
J. SIAM , Vol. 9 , pp. 551-570 , 1961
GomHu
29.03.2006
JabRef Output
29.03.2006
JabRef Output
gra61-1
Multi-terminal network flows
Gomory, R. & Hu, T.
SIAM J. Appl. Math. , Vol. 9 , pp. 551-570 , 1961
gonmin95
Graphs and Algorithms
Gondran, M. & Minoux, M.
John Wiley & Sons , 1995
GoMi79
Graphes et Algorithms
Gondran, M. & Minoux, M.
Eyrolles , 1979
gon79
Graphes et algorithmes
Gondran, M. & Minoux, M.
Eyrolles , 1979
gondzio1
Warm Start of the Primal-Dual Method Applied in the Cutting Plane
Scheme
url
Gondzio, J.
Mathematical Programming , Vol. 83 , pp. 125-143 , 1998
gondzio11
Presolve analysis of linear programs prior to applying an interior point
method
Gondzio, J.
INFORMS Journal on Computing , Vol. 9 , pp. 73-91 , 1997
gondzio0
Multiple centrality corrections in a primal-dual method for linear
29.03.2006
JabRef Output
programming
Gondzio, J.
Computational Optimization and Applications , Vol. 6 , pp. 137-156 , 1996
gondzio7
HOPDM (ver 2.12) --- A fast LP solver based on a primal-dual interior point
method
Gondzio, J.
European J. Oper. Res , Vol. 85 , pp. 221-225 , 1995
gondzio13
Solving nonlinear portfolio optimization problems with the primaldual interior point method
url
url
url
url
29.03.2006
JabRef Output
url
url
url
url
29.03.2006
JabRef Output
url
Gonzaga, C.C.
SIAM Journal on Optimization , Vol. 10(1) , pp. 183-194 , 2000
gonzaga13
The largest step path following algorithm for monotone linear
complementarity problems
Gonzaga, C.C.
Mathematical Programming , Vol. 76 , pp. 309-332 , 1997
Gon7
Path Following Methods for Linear Programming
Gonzaga, C.C.
SIAM Review , Vol. 34(2) , pp. 167-224 , 1992
Gon227
On lower bound updates in primal potential reduction methods for linear
programming
Gonzaga, C.C.
Mathematical Programming , Vol. 52(3) , pp. 415-428 , 1991
Gon4
Large Step Path following methods for linear programming, Part I: Barrier
function method
Gonzaga, C.C.
SIAM Journal on Optimization , Vol. 1(2) , pp. 268-279 , 1991
Gon44
Search directions for interior linear-programming methods
Gonzaga, C.C.
Algorithmica , Vol. 6 , pp. 153-181 , 1991
29.03.2006
JabRef Output
Gon5
Large Step Path following methods for linear programming, Part II:
Potential reduction method
Gonzaga, C.C.
SIAM Journal on Optimization , Vol. 1(2) , pp. 280-292 , 1991
Gon6
Interior Point Algorithms For Linear Programming With Inequality
Constraints
Gonzaga, C.C.
Mathematical Programming , Vol. 52(2) , pp. 209-225 , 1991
Gon3
Polynomial affine algorithms for linear programming
Gonzaga, C.C.
Mathematical Programming , Vol. 49(1) , pp. 7-21 , 1990
Gon1
Conical Projection Algorithms for Linear Programming
Gonzaga, C.C.
Mathematical Programming , Vol. 43 , pp. 151-174 , 1989
Gon2
An algorithm for solving linear programming problems in $O(n^3L)$
operations
Gonzaga, C.C.
Progress in Mathematical Programming , pp. 1-28 , 1989
gonzaga12
Fast convergence of the simplified largest step path following algorithm
Gonzaga, C.C. & Bonnans, J.F.
Mathematical Programming , Vol. 76 , pp. 95-115 , 1997
gonzaga14
url
29.03.2006
JabRef Output
url
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
GSH02
Cell size adaptation in W-CDMA cellular system
Goto, K.; Suzuki, T. & Hattori, T.
Proc. of Veh. Tech. Conf. , 2002
gould7
On modified factorizations for large-scale linearly constrained
optimization
Gould, N.I.M.
SIAM Journal on Optimization , Vol. 9 , pp. 1041-1063 , 1999
gould2
On the Solution of Equality Constrained Quadratic Programming
Problems Arising in Optimization
url
url
url
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
GouLabYam02
Telecommunication and Location
Gourdin, E.; Labbe, M. & Yaman, H.
pp. 275-305 , 2002
GLY01
Telecommunication and Location
Gourdin, E.; Labb, M. & Yaman, H.
2001
gouveia96
Multicommodity flow models for spanning trees with hop constraints
Gouveia, L.
European Journal of Operational Research , Vol. 95 , pp. 178-190 , 1996
Gouveia1998
Using variable redefinition for computing lower bounds for minimum
spanning and Steiner trees with hop constraints
Gouveia, L.
INFORMS Journal on Computing , Vol. 10 , pp. 180-188 , 1998
Gouveia3
Using Variable Redefinition for Computing Lower Bounds for Minimum
Spanning and Steiner Trees with Hop Constraints
Gouveia, L.
INFORMS Journal on Computing , Vol. 10 , pp. 180-187 , 1998
Gouv96
Multicommodity flow models for spanning trees with hop constraints
Gouveia, L.
European journal of Operational Research , Vol. 95 , pp. 178-190 , 1996
Gouveia1996
Multicommodity flow models for spanning trees with hop constraints
29.03.2006
JabRef Output
Gouveia, L.
European Journal of Operational Research , Vol. 95 , pp. 178-190 , 1996
Gouveia_1996
Multicommodity flow models for spanning trees with hop constraints
Gouveia, L.
European Journal of Operational Research , Vol. 95 , pp. 178-190 , 1996
gouveia1
A result on projection for the vehicle routing problem
Gouveia, L.
European J. Oper. Res , Vol. 85 , pp. 610-624 , 1995
Gouveia1995
Using the Miller-Tucker-Zemlin constraints to formulate a minimal
spanning tree problem with hop constraints
Gouveia, L.
Computers and Operations Research , Vol. 22 , pp. 959-970 , 1995
Gouveia_1995
Using the Miller-Tucker-Zemlin constraints to formulate a minimal
spanning tree problem with hop constraints
Gouveia, L.
Computers and Operations Research , Vol. 22 , pp. 959-970 , 1995
Gouveia:Hall
Multistars and directed flow formulations
Gouveia, L. & Hall, L.
Networks , Vol. 40 , pp. 188-201 , 2002
Gouv98
Designing reliable tree networks with two cable technologies
Gouveia, L. & Janssen, L.
European journal of Operational Research , Vol. 105 , pp. 552-568 , 1998
29.03.2006
JabRef Output
GouveiaLopes1997
Using generalized capacitated trees for designing the topology of local
access networks
Gouveia, L. & Lopes, M.J.
Telecommunication Systems , Vol. 7 , pp. 315-337 , 1997
gouveia03
Network flow models for designing diameter-constrained minimumspanning and Steiner trees
Gouveia, L. & Magnanti, T.
Networks , Vol. 41 , pp. 159-173 , 2003
GouveiaMagnanti03
Network Flow Models for Designing Diameter-Constrained MinimumSpanning and Steiner Trees
Gouveia, L. & Magnanti, T.
Networks , Vol. 41 , pp. 159-173 , 2003
GouveiaMagnantiRequejo04
A 2-Path Approach for Odd-Diameter-Constrained Minimum Spanning
and Steiner Trees
Gouveia, L.; Magnanti, T. & Requejo, C.
Networks , Vol. 44 , pp. 254-265 , 2004
GouveiaPatricioSousaValadas2003
MPLS over WDM network design with packet level QoS constraints based
on ILP models
Gouveia, L.; Patrcio, P.; e Sousa, A. & R., V.
Proceedings of IEEE INFOCOM 2003 , 2003
GouveiaPires01
Models for a Steiner ring network design problem with revenues
Gouveia, L. & Pires, J.
European Journal of Operational Research , Vol. 133 , pp. 21-31 , 2001
29.03.2006
JabRef Output
GouveiaRequejo01
A new Lagrangean relaxation approach for the hop-constrained minimum
spanning tree problem
Gouveia, L. & Requejo, C.
European Journal of Operational Research , Vol. 132 , pp. 539-552 , 2001
GouveiaRequejo2001
A new Lagrangian relaxation approach for the hop-constrained minimum
spanning tree problem
Gouveia, L. & Requejo, C.
European Journal of Operational Research , Vol. 132 , pp. 539-552 , 2001
goux1
Solving large MINLPs on computational grids
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
greenberg6
Simultaneous primal-dual right-hand-side sensitivity analysis from a
strictly complementary solution of a linear program
Greenberg, H.J.
SIAM Journal on Optimization , Vol. 10(2) , pp. 427-442 , 2000
greenberg4
A Simplified Introduction to LaTeX
url
Greenberg, H.J.
Mathematics Department, University of Colorado -- Denver , 1999
greenberg5
Matrix sensitivity analysis from an interior solution of a linear program
Greenberg, H.J.
INFORMS Journal on Computing , Vol. 11(3) , pp. 316-327 , 1999
greenberg1
Rim sensitivity analysis from an interior solution
url
Greenberg, H.J.
1996
OB1.analyze
ANALYZE User Documentation
Greenberg, H.J.
1990
OB1.modler
MODLER User Documentation
Greenberg, H.J.
1990
OB1.randmod
RANDMOD User Documentation
29.03.2006
JabRef Output
Greenberg, H.J.
1990
greenberg2
On the Dimension of the Set of Rim Perturbations for Optimal
Partition Invariance
url
29.03.2006
JabRef Output
grigoriadis1
Coordination complexity of parallel price-directive decomposition
Grigoriadis, M.D. & Khachiyan, L.G.
Mathematics of Operations Research , Vol. 21 , pp. 321-340 , 1996
grigoriadis3
An interior point method for bordered block-diagonal linear programs
Grigoriadis, M.D. & Khachiyan, L.G.
SIAM Journal on Optimization , Vol. 6 , pp. 913-932 , 1996
grik96
Approximate minimum-cost multicommodity flows in $O( -2KNM)$ time
Grigoriadis, M.D. & Khachiyan, L.G.
Mathematical Programming , Vol. 75 , pp. 477-482 , 1996
grik94
Fast approximation schemes for convex programs with many blocks and
coupling constraints
Grigoriadis, M.D. & Khachiyan, L.G.
SIAM Journal on Optimization , Vol. 4 , pp. 86-107 , 1994
grik91
Fast approximation schemes for convex programs with many blocks and
coupling constraints
Grigoriadis, M.D. & Khachiyan, L.G.
1991
griwhi72
A partitioning algorithm for the multicommodity network flow problem
Grigoriadis, M. & White, W.
Mathematical Programming , Vol. 3 , pp. 157-177 , 1972
gm
On coloring random graphs
29.03.2006
JabRef Output
url
Grimwood, G. R.
Victoria University , 1994
grone1
Positive definite completions of partial Hermitian matrices
Grone, B.; Johnson, C.; de Sa, E.M. & Wolkowicz, H.
Linear Algebra and its Applications , Vol. 58 , pp. 109-124 , 1984
grossglauser:02
Passive traffic measurement for IP operations
Grossglauser, M. & Rexford, J.
2004
Grossman96
Applying the INN model to the max clique problem
Grossman, T.
Vol. 26 , pp. 125-146 , 1996
grossmann1
Special Issue on Mixed Integer Programming and Its Applications to
Engineering: prologue
Grossmann, I.E. & Sahinidis, N.V.
Optimization and Engineering , Vol. 4 , pp. 5-6 , 2003
GrossoEtAl01
Logical Topologies Design over WDM Wavelength Routed Networks
Robust to Traffic Uncertainties
Grosso, A.; Leonardi, E.; Mellia, M. & Nucci, A.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Grover, W.D.
W. H. Freeman and Company , 2003
GrDo02
Advances in Optical Network Design with $p$-Cycles: Joint optimization
and pre-selection of candidate $p$-cycles
Grover, W.D. & Doucette, J.
Proceedings of the IEEE-LEOS Summer Topical Meeting on All Optical Networking ,
pp. 49-50 , 2002
GrSt98
Cycle-Oriented Distributed Preconfiguration: Ring-like Speed with Meshlike Capacity for Self-planning Network Restoration
Grover, W.D. & Stamatelakis, D.
Proceedings of IEEE International Conference on Communications (ICC 1998) , pp.
537-543 , 1998
GrVe91
Development and performance verification of a distributed asynchronous
protocol for real-time network restoration
Grover, W.D.; Venables, B.D.; MacGregor, M.H. & Sandham, J.H.
IEEE Journal on Selected Areas in Communications , Vol. 9 , pp. 112-125 , 1991
web_grover
www.ee.ualberta.ca/$~$grover/
Grover, W.
2005
grover
Mesh-Based Survivable Networks
Grover, W.
Prentice Hall , 2004
Wayne02
Design of a meta-mesh of chain subnetworks: Enhancing the attractiveness
of mesh-restorable WDM networking on low connectivity graphs
29.03.2006
JabRef Output
Grover, W.
IEEE Journal on Selected Areas in Communications , Vol. 20 , pp. 47-61 , 2002
20gdj
Design of a meta-mesh of chain subnetworks: enhancing the attractiveness
of mesh-restorable WDM networking on low connectivity graphs
Grover, W. & Doucette, J.
IEEE Journal on Selected Areas in Communications , Vol. 20 , pp. 47 - 61 , 2002
Grover:Doucette
Topological design of survivable mesh-based transport networks
Grover, W. & Doucette, J.
Annals of Operations Research , Vol. 106 , pp. 79-125 , 2001
gruber3
On semidefinite programming and applications in combinatorial
optimization
url
G. Gruber
University of Technology, Graz , 2000
gruber2
Computational experience with Stable Set Relaxations
url
url
29.03.2006
JabRef Output
GrMoSt94
Design of survivable networks
Grtschel, M.; Monma, C. & Stoer, M.
1994
GrMoSt92a
Computational results with a cutting plane algorithm for designing
communication networks with low-connectivity constraints
Grtschel, M.; Monma, C. & Stoer, M.
Operations Research , Vol. 40 , pp. 309-330 , 1992
GrMoSt92b
Facets for polyhedra arising in the design of communication networks
with low-connectivity constraints
Grtschel, M.; Monma, C. & Stoer, M.
SIAM Journal on Optimization , Vol. 2 , pp. 474-504 , 1992
GrMoSt91
Polyhedral approaches to network survivability
Grtschel, M.; Monma, C. & Stoer, M.
Vol. 5 , 1991
Grot1
Grtschel, M.
1987
GH3
Solution of large-scale travelling salesman problems
Grtschel, M. & Holland, O.
Mathematical Programming , Vol. 51(2) , pp. 141-202 , 1991
GH2
29.03.2006
JabRef Output
29.03.2006
JabRef Output
GLSbook
Geometric Algorithms and Combinatorial Optimization
Grtschel, M.; Lovasz, L. & Schrijver, A.
Springer-Verlag , 1988
GLS81
The ellipsoid method and its consequences in combinatorial optimization
Grtschel, M.; Lovasz, L. & Schrijver, A.
Combinatorica , Vol. 1 , pp. 169-197 , 1981
grotschel11
Polyhedral and computational investigations for designing
communication networks with high survivability requirements
Grtschel, M.; Monma, C.L. & Stoer, M.
Operations Research , Vol. 43 , pp. 1012-1024 , 1995
GrMonma
Computational results with a cutting plane algorithm for designing
communication networks with low-connectivity constraints
Grtschel, M.; Monma, C.L. & Stoer, M.
Operations Research , Vol. 40 , pp. 309-330 , 1992
des90-3
Integer polyhedra arising from certain
design problems with connectivity constraints
Grtschel, M. & Monma, C.
SIAM J. Discrete Math. , Vol. 3 , pp. 502-523 , 1990
des95-2
Polyhedral and computational investigations
for designing communication networks with
high survivability requirements
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
Gu, M.
SIAM Journal on Optimization , Vol. 10(2) , pp. 462-502 , 2000
29.03.2006
JabRef Output
zgu2
Lifted cover inequalities for 0--1 integer programs: complexity
Gu, Z.; Nemhauser, G.L. & Savelsbergh, M.W.P.
INFORMS Journal on Computing , Vol. 11 , pp. 117-123 , 1999
zgu3
Lifted cover inequalities for mixed 0--1 integer programs
Gu, Z.; Nemhauser, G.L. & Savelsbergh, M.W.P.
Mathematical Programming , Vol. 85(3) , pp. 439-467 , 1999
zgu1
Lifted cover inequalities for 0--1 integer programs: computation
Gu, Z.; Nemhauser, G.L. & Savelsbergh, M.W.P.
INFORMS Journal on Computing , Vol. 10 , pp. 427-438 , 1998
guan1
A Branch-and-Cut Algorithm for the Stochastic Uncapacitated LotSizing Problem
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Guig2003
Lagrangean relaxation
Guignard, M.
TOP , Vol. 11 , pp. 151-199 , 2004
Guig1998
Efficient cuts in Lagrangean relax-and-cut schemes
Guignard, M.
European Journal of Operational Research , Vol. 105 , pp. 216-223 , 1998
guignard1
An improved dual-based algorithm for the generalized assignment
problem
Guignard, M. & Rosenwein, M.B.
Operations Research , Vol. 37 , pp. 658-663 , 1989
Guignard:Spielberg
Logical reduction methods in zero-one programming
Guignard, M. & Spielberg, K.
Operations Research , Vol. 29 , pp. 49-74 , 1981
GuSp79
A Direct Dual Method for the Mixed Plant Location Problem with some
Side Constraints
Guignard, M. & Spielberg, K.
Mathematical Programming , Vol. 17 , pp. 198-228 , 1979
guipar90
Minimum concave cost network flow problems
Guisewite, G. & Pardalus, P.
Annals Operations Res. , Vol. 25 , pp. 75-100 , 1990
Guitart
In: A high performance approximate algorithm for the Steiner problem in
graphs
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
Gunasekaran04
Information systems in supply chain integration and management
Gunasekaran, A. & Ngai, E.
European Journal of Operational Research , Vol. 159 , pp. 269-295 , 2004
aparnagupta1
Optimal asset allocation with bahvioral utilities: a plan for acquiring and
consuming retirement funds
A. Gupta
Scientific Computing and Computational Mathematics, Stanford University , 2000
gupta1
Graph Partitioning Based Sparse Matrix Orderings for InteriorPoint Algorithms
url
Gupta, A.
1996
Guptaetal04b
Boosted Sampling: Approximation Algorithms for Stochastic Optimization
Gupta, A.; Pal, M.; Ravi, R. & Sinha, A.
2004
GuptaSrinivasan03
On the Covering Steiner Problem
Gupta, A. & Srinivasan, A.
Vol. 2914 , pp. 244-251 , 2003
GuptaEtAl04a
Cost-Sharing Mechanisms for Network Design
Gupta, A.; Srinivasan, A. & Tardos, E.
pp. 139-150 , 2004
Gupta99
The economics of network management
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Guler2
Interior point approach to the theory of linear programming
Gler, O. & Roos, C.
1992
3hzhu
Dynamic traffic grooming in WDM mesh networks using a novel graph
model
H, Z.; Zang, H.; Zhu, K. & Mukherjee, B.
Proceedings IEEE Global Telecommunications Conference (GLOBECOM 2002) , Vol.
3 , pp. 2681 - 2685 , 2002
San90
Finding Steiner forests in planar graphs
H. Suzuki, T.A. & Nishizeki, T.
Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms , pp.
444-453 , 1990
hastad1
Some optimal inapproximability results
H.astad, J.
J. of the ACM , Vol. 48 , pp. 798-859 , 2001
Hadley1
An efficient eigenvector approach for finding netlist partitions
Hadley, S.W.; Mark, B.L. & Vannelli, A.
IEEE Transactions on Computer-Aided Design , Vol. 11 , pp. 885-892 , 1992
haeberly1
Extending Mehrotra and Gondzio Higher Order Methods to Mixed
Semidefinite-Quadratic-Linear Programming
url
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
haight1
An integer optimization approach to a probabilistic reserve site selection
problem
Haight, R.G.; Revelle, C. & Snyder, S.A.
Operations Research , Vol. 48 , pp. 697-708 , 2000
Hajek85
Extremal splittings of point processes
Hajek, B.
Mathematics of Operations Research , Vol. 10 , pp. 543-556 , 1985
Hajek02
Do greedy autonomous systems make for a sensible Internet?
Hajek, B. & Gopal, G.
Conference on Stochastic Networks , 2002
hajek1
Optimal dynamic routing in communication networks with continuous
traffic
Hajek, B. & Ogier, R.
Networks , Vol. 14 , pp. 457-487 , 1984
Hajek88
Link scheduling in polynomial time
Hajek, B. & Sasaki, G.
IEEE Transactions on Information Theory , Vol. 34 , pp. 910-917 , 1988
Hakimi
Steiner's problem in graphs and its implications
Hakimi, S.L.
Networks , Vol. 1 , pp. 113-133 , 1971
Ha71
Steiner's Problem in Graphs and its Implications
29.03.2006
JabRef Output
Hakimi, S.
Networks , Vol. 1 , pp. 113-133 , 1971
Hakimi71
Steiner's Problem in Graphs and Its Implications
Hakimi, S.
Networks , Vol. 1 , pp. 113-133 , 1971
Ha65
Optimum distribution of switching centers in a communication network
and some related graph theoretic problems
Hakimi, S.
Operations Research , Vol. 13 , pp. 462-475 , 1965
Ha64
Optimal locations of switching centers and the absolute
centers and median of a graph
Hakimi, S.
Operations Research , Vol. 12 , pp. 450-459 , 1964
halabi:01
Internet Routing Architectures
Halabi, S. & McPherson, D.
Cisco Press , 2001
Hale80
Frequency assignment: theory and applications
Hale, W.K.
Proceedings of the IEEE , Vol. 68 , pp. 1497-1514 , 1980
Ha80
Frequency assignment: Theory and applications
Hale, W.
29.03.2006
JabRef Output
url
Halick, M.
Operations Research Letters , Vol. 28 , pp. 9-19 , 2001
halicka4
Analyticity of the central path at the boundary point in semidefinite
programming
url
Halick, M.
2001
halicka1
Analytical properties of the central path at boundary point in linear
programming
Halick, M.
Mathematical Programming , Vol. 84 , pp. 335-355 , 1999
halicka3
On the convergence of the central path in semidefinite optimization
url
29.03.2006
JabRef Output
hall2
Scheduling to minimize average completion time: off-line and on-line
approximation algorithms
Hall, L.; Schulz, A.S.; Shmoys, D.B. & Wein, J.
Mathematics of Operations Research , Vol. 22 , pp. 513-544 , 1997
hall4
Two-thirds is sharp for affine scaling
Hall, L. & Vanderbei, R.J.
Operations Research Letters , Vol. 13(4) , pp. 197-201 , 1993
nghall1
Supply chain scheduling: batching and delivery
Hall, N.G. & Potts, C.N.
Operations Research , Vol. 51 , pp. 566-584 , 2003
HalldorssonEtAl98
Approximating Steiner Trees in Graphs with Restricted Weights
Halldrsson, M.; Ueno, S.; Nakao, H. & Kajitani, Y.
Networks , Vol. 31 , pp. 283-292 , 1998
Halldorsson00:Approximations
Approximations of weighted independent set and hereditary subset
problems
Halldrsson, M.
Journal of Graph Algorithms and Applications , Vol. 4(1) , pp. 1-16 , 2000
Halldorsson97:Low
Low-degree graph partitioning via local search with applications to
constraint satisfaction, max cut, and 3-coloring
Halldrsson, M. & Lau, H.C.
Journal of Graph Algorithms and Applications , Vol. 1(3) , pp. 1-13 , 1997
HaThSuBlCh96
Increased capacity in an MS protection ring using
29.03.2006
JabRef Output
url
covering problem
Hammer, P. & D.J. Rader, ~.
Journal of Heuristics , Vol. 7 , pp. 131-144 , 2001
JamRad99a
Maximally disjoint solutions of the set covering problem
Hammer, P. & D.J. Rader, ~.
Journal of Heuristics , Vol. 7 , pp. 131-144 , 2001
HCHP03
Tradeoff between coverage and capacity in dynamic optimization of 3G
cellular networks
Hampel, G.; Clarkson, K.; Hobby, J. & Polakos, P.
2003
Massey022
Provisioning of Bandwidth Sharing and Exchange
Hamshire, R.; Massey, W.A.; Mitra, D. & Wang, Q.
pp. 207-226 , 2002
29.03.2006
JabRef Output
Han01
Data mining, concepts and techniques
Han, J. & Kamber, M.
Morgan Kaufmann , 2001
HS00
Secure Multicast Software Delivery
Han, L. & Shahmehri, N.
IEEE 9th International Workshops on Enabling Technologies: Infrastructure for
Collaborative Enterprises (WET ICE'00) , pp. 207-212 , 2000
han2
On approximation of Max-Vertex-Cover
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
problem
Hansen, P.; Mladenovi, N. & Taillard, &.
Operations Research Letters , Vol. 22 , pp. 55-62 , 1998
HaPe99
Tabu search for the frequency assignment problem in cellular radio
networks
Hao, J. & Perrier, L.
1999
HaoDorGal98
Tabu search for frequency assignment in mobile radio networks
Hao, J.; Dorne, R. & Galinier, P.
Journal of Heuristics , Vol. 4 , pp. 47-62 , 1998
HaoSGOSL97
A low-cost cellular mobile communication system: A hierarchical
optimization network resource planning approach
Hao, Q.; Soong, B.; Gunawan, E.; Ong, J.; Soh, C. & Li, Z.
IEEE Journal on Selected Areas in Communications , Vol. 15 , pp. 1315-1326 , 1997
HaouariChaouachi04
Upper and lower bounding strategies for the generalized minimum
spanning tree problem
Haouari, M. & Chaouachi, J.
European Journal of Operational Research , 2004
har00
Performance Evaluation of Multicast Routing Methods in Optical
Switching Networks with Multiple Wavebands
Harai, H.; Murata, M. & Miyahara, H.
Electronics and Communications in Japan , Vol. 83 , pp. 84-96 , 2000
Harant00
Some news about the independence number of a graph
29.03.2006
JabRef Output
Harant, J.
Discussiones Mathematicae Graph Theory , Vol. 20 , pp. 71-79 , 2000
Harant98
A lower bound on the independence number of a graph
Harant, J.
Discrete Mathematics , Vol. 188 , pp. 239-243 , 1998
Harant99
On dominating sets and independent sets of graphs
Harant, J.; Pruchnewski, A. & Voigt, M.
Combinatorics, Probability and Computing , Vol. 8 , pp. 547-553 , 1999
des62-1
The maximum connectivity of a graph
Harary, F.
Proceedings of the National Academy of Sciences , Vol. 48 , pp. 1142-1146 , 1962
HararyRoss57
A procedure for clique detection using the group matrix
Harary, F. & Ross, I.C.
Sociometry , Vol. 20 , pp. 205-215 , 1957
harche2
A generalized exchange heuristic for the capacitated vehicle routing
problem
Harche, F. & Raghavan, P.
International Journal Systems Science , Vol. 25 , pp. 1911-1920 , 1994
optim:harche1
The column subtraction algorithm: An exact method for solving weighted
set covering, packing and partitioning problems
Harche, F. & Thompson, G.L.
Computers and Operations Research , Vol. 21 , pp. 689-705 , 1994
29.03.2006
JabRef Output
hardin2
Resource-constrained scheduling and production planning: linear
programming-based studies
J. Hardin
School of Industrial and Systems Engineering, Georgia Institute of Technology , 2001
hardin1
On the boolean-quadric packing uncapacitated facility-location polytope
Hardin, J.; Lee, J. & Leung, J.
Annals of Operations Research , Vol. 83 , pp. 77-94 , 1998
Hardin:Lee:Leung
On the Boolean-quadric packing uncapacitated facility-location polytope
Hardin, J.; Lee, J. & Leung, J.
Annals of Operations Research , Vol. 83 , pp. 77-94 , 1998
harlp52
Inequalities
Hardy, G.H.; Littlewood, J.E. & Polya, G.
Cambridge University Press , 1952
H93
The History of the Net
Hardy, H.
School of Communications, Grand Valley State University, Allendale , 1993
harker1
Finite-dimensional variational inequality and nonlinear complementarity
problems: A survey of theory, algorithms and applications
Harker, P.T. & Pang, J.
Mathematical Programming , Vol. 48 , pp. 161-220 , 1990
hbg01
Uniform integration of genome mapping data using intersection graphs
29.03.2006
JabRef Output
url
assignment problem
Hasan, M.; Osman, I. & AlKhamis, T.
International Journal of Applied Mathematics , Vol. 8 , pp. 365-380 , 2002
HasanVijayanWong
A neighborhood improvement algorithm for rectilinear Steiner trees
Hasan, N.; Vijayan, G. & Wong, C.K.
Proceedings of the International Symposium on Circuits and Systems , pp. 2869-2872 ,
1990
pardalos13
Test case generators and computational results for the maximum clique
problem
29.03.2006
JabRef Output
url
url
Hauser, R.
2000
29.03.2006
JabRef Output
hauser1
Self-Scaled Barrier Functions: Decomposition and Classification
url
Hauser, R.
1999
hauser2
Square-Root Fields and the "V-Space" Approach to Primal-Dual
Interior-Point Methods for Self-Scaled Conic Programming
url
Hauser, R.
1999
hauser3
Target Directions for Primal-Dual Interior-Point Methods for SelfScaled Conic Programming
url
Hauser, R.
1999
hauser4
Primal-Dual Symmetric Scale-Invariant Square-Root Fields for
Isotropic Self-Scaled Barrier Functionals
url
Hauser, R.
1999
hauser5
Nesterov-Todd directions are Newton directions
url
Hauser, R.
1999
hauser8
Self-scaled barrier on symmetric cones and their classification
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Hegland01
Data mining techniques
Hegland, M.
Acta Numerica , Vol. 10 , pp. 313-355 , 2001
heinkenschloss1
Superlinear and quadratic convergence of affine-scaling interior-point
Newton methods for problems with simple bounds without strict
complementarity assumption
Heinkenschloss, M.; Ulbrich, M. & Ulbrich, S.
Mathematical Programming , Vol. 86(3) , pp. 615-635 , 1999
HeldK
The travelling salesman problem and minimum spanning trees
Held, M. & Karp, R.M.
Operations Research , Vol. 18 , pp. 1138-1162 , 1970
HeKa71
The Traveling Salesman Problem and Minimum Spanning Trees: Part II
Held, M. & Karp, R.
Mathematical Programming , Vol. 1 , pp. 6-25 , 1971
Held:Karp:2
The Traveling Salesman Problem and Minimum Spanning Trees: Part II
Held, M. & Karp, R.
Mathematical Programming , Vol. 1 , pp. 6-25 , 1971
HK71
The traveling salesman problem and minimum spanning trees: Part II
Held, M. & Karp, R.
Mathematical Programming , Vol. 1 , pp. 6-25 , 1971
HeKa70
The Traveling Salesman Problem and Minimum Spanning Trees
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
Helmberg, C.
2001
helmberg11
SBmethod: a C++ implementation of the spectral bundle method
url
Helmberg, C.
2000
helmberg4
Fixing variables in semidefinite relaxations
url
Helmberg, C.
SIAM Journal on Matrix Analysis and Applications , Vol. 21 , pp. 952-969 , 2000
helmberg8
Semidefinite Programming for Combinatorial Optimization
url
Helmberg, C.
2000
sdp_webpage
Semidefinite Programming Homepage
Helmberg, C.
1996
29.03.2006
JabRef Output
helmberg7
A Spectral Bundle Method with Bounds
url
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
HeHoRoVa-RR03-16
A Ring Network Design Problem and Heuristics for Generating a Set of
Feasible Rings
Henningsson, M.; Holmberg, K.; Rnnqvist, M. & Vrbrand, P.
2003
HeHoRoVa-RR03-20
A Ring Network Design Problem Solved by a Ring Generation and
Allocation Approach
Henningsson, M.; Holmberg, K.; Rnnqvist, M. & Vrbrand, P.
2003
HeHoRoVa-RR03-21
A Column Generation Approach for a Ring Network Design Problem
Henningsson, M.; Holmberg, K.; Rnnqvist, M. & Vrbrand, P.
2003
henrion1
Decision Analysis and Expert Systems
Henrion, M.; Breese, J.S. & Horvitz, E.J.
AI Magazine , pp. 64-91 , 1991
henz1
Scheduling a major college basketball conference -- revisited
Henz, M.
Operations Research , Vol. 49 , pp. 163-168 , 2001
Heragu1
Recent models and techniques for solving the layout problem
Heragu, S.S.
European J. Oper. Res , Vol. 57 , pp. 136-144 , 1992
Heragu2
Experimental analysis of simulated annealing based algorithms for the
layout problem
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
hertz2
A tabu search heuristic for the capacitated arc routing problem
Hertz, A.; Laporte, G. & Mittaz, M.
Operations Research , Vol. 48(1) , pp. 129-135 , 2000
hertz1
A tutorial on tabu search
Hertz, A.; Taillard, E. & de Werra, D.
??
tabu97-2
Tabu search
Hertz, A.; Taillard, E. & de Werra, D.
Local Search in Combinatorial Optimization , pp. 121-136 , 1997
HerWer87
Using tabu search techniques for graph coloring
Hertz, A. & de Werra, D.
Computing , Vol. 39 , pp. 345-351 , 1987
Herzberg:Bye:Utano
The hop-limit approach for spare-capacity assignment in survivable
networks
Herzberg, M.; Bye, S. & Utano, A.
IEEE/ACM Transactions on Networking , Vol. 3 , pp. 775-784 , 1995
HrzRcZir
A quadratically convergent method for linear programming
Herzel, S.; Recchioni, M.C. & Zirilli, F.
Linear Algebra and its Applications , Vol. 152 , pp. 255-290 , 1991
herzel2
Two interior-point algorithms for a class of convex programming
problems
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Hifi97
A genetic algorithm - based heuristic for solving the weighted maximum
independent set and some equivalent problems
Hifi, M.
J. Oper. Res. Soc. , Vol. 48 , pp. 612-622 , 1997
Hig90
Minimizing pseudoconvex functions on convex compact sets
Higgins, J. & Polak, E.
Journal of Optimization Theory and Applications , Vol. 65 , pp. 1-27 , 1990
higham2
Accuracy and stability of numerical algorithms
Higham, N.J.
SIAM , 1996
Higham
A survey of condition number estimation for triangular matrices
Higham, N.J.
SIAM Review , Vol. 29(4) , pp. 575-596 , 1987
HightowerSurvey
The interconnection problem---a tutorial
Hightower, D.W.
Proceedings of the Tenth Design Automation Workshop , pp. 1-21 , 1973
higle4
Variance reduction and objective function evaluation in stochastic linear
programs
Higle, J.L.
INFORMS Journal on Computing , Vol. 10 , pp. 236-247 , 1998
higle6
An introductory tutorial on stochastic linear programming models
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Hipolito, A.
Computational Optimization and Applications , Vol. 2 , pp. 29-46 , 1993
hirl91
Convex Analysis and Minimization Algorithms I
Hiriart-Urruty, J.B. & Lemarechal, C.
Springer-Verlag , 1991
hiriarturruty1
Convex analysis and minimization algorithms I
Hiriart-Urruty, J. & Lemarchal, C.
Springer-Verlag , 1993
hiriarturruty1and2
Convex analysis and minimization algorithms, Volumes I and II
Hiriart-Urruty, J. & Lemarchal, C.
Springer-Verlag , 1993
hiriarturruty2
Convex analysis and minimization algorithms II
Hiriart-Urruty, J. & Lemarchal, C.
Springer-Verlag , 1993
HUL93II
Convex Analysis and Minimization Algorithms II, Advanced Theory and
Bundle Methods
Hiriart-Urruty, J. & Lemarchal, C.
Springer-Verlag , 1993
Hjo95a
The vehicle routing problem and local search
metaheuristics
C.A. Hjorring
29.03.2006
JabRef Output
29.03.2006
JabRef Output
hoc97
Approximation Algorithms for NP-Hard Problems
Hochbaum, D.
PWS Publishing Company , 1997
des89-4
Analysis of a flow problem with fixed charges
Hochbaum, D. & A., S.
Networks , Vol. 19 , pp. 291-312 , 1989
HoSe89
Analysis of a Flow Problem with Fixed Charges
Hochbaum, D. & Segev, A.
Networks , Vol. 19 , pp. 291-312 , 1989
HS89
Analysis of a Flow Problem with Fixed Charges
Hochbaum, D. & Segev, A.
Networks , Vol. 19 , pp. 291-312 , 1989
hocs90
Convex separable optimization is not much harder than linear
optimization
Hochbaum, D.S. & Shanthikumar, J.G.
Journal of the Association for Computing Machinery , Vol. 37 , pp. 843-862 , 1990
Hochbaum83:Efficient
Efficient bounds for the stable set, vertex cover, and set packing problems
Hochbaum, D.
Discrete Applied Mathematics , Vol. 6 , pp. 243-254 , 1983
HS
Test Examples for Nonlinear Programming Codes
Hock, W. & Schittkowski, K.
29.03.2006
JabRef Output
Springer-Verlag , 1981
Hoesel:Koster:Leensel:Savelsbergh
Polyhedral results for the edge capacity polytope
van Hoesel, S.; Koster, A.; van de Leensel, R. & Savelsbergh, M.
Mathematical Programming , Vol. Ser. A 92 , pp. 335-358 , 2002
Hoesel-Mueller-2001
Optimization in electronic markets: Examples in combinatorial auctions
van Hoesel, S. & Mller, R.
Netnomics , Vol. 3 , pp. 23-33 , 2001
hoffmana1
On approximate solutions of systems of linear inequalities
Hoffman, A.J.
Journal of Research of the National Bureau of Standards , Vol. 49 , pp. 263-265 , 1952
hoffmana2
When is a team `mathematically' eliminated?
Hoffman, A.J. & Rivlin, T.J.
Procedings of the Princeton Symposium on Mathematical Programming , 1970
hofp85
LP-based combinatorial problem solving
Hoffman, K. & Padberg, M.
Annals of Operations Research , Vol. 4 , pp. 145-194 , 1985
HoPa3
Solving Airline Crew Scheduling Problems by Branch-and-Cut
Hoffman, K.L. & Padberg, M.
Management Science , Vol. 39(6) , pp. 657-682 , 1993
HoPa2
Improving LP-Representation of Zero-One Linear Programs for Branch-
29.03.2006
JabRef Output
and-Cut
Hoffman, K.L. & Padberg, M.
ORSA Journal on Computing , Vol. 3(2) , pp. 121-134 , 1991
HoPa
LP-based combinatorial problem solving
Hoffman, K.L. & Padberg, M.
Annals of Operations Research , Vol. 4 , pp. 145-194 , 1985
Hoffman:Padberg2
Solving airline crew-scheduling problems by branch-and-cut
Hoffman, K. & M.~Padberg
Management Science , Vol. 39 , pp. 657-682 , 1992
Hoffman:Padberg1
Improving LP-representations of zero-one linear programs for branchand-cut
Hoffman, K. & M.~Padberg
ORSA Journal on Computing , Vol. 3 , pp. 121-134 , 1991
Hofri87
Packet Delay under the Golden Ratio Weighted TDM Policy in a MultipleAcces Channel
Hofri, M. & Rosberg, Z.
IEEE Transaction on Information Theory , Vol. IT-33 , pp. 341-349 , 1987
holder2
Uniform bounds on the limiting and marginal derivatives of the analytic
center solution over a set of normalizing weights
Holder, A.G. & Caron, R.J.
Operations Research Letters , Vol. 26(2) , pp. 49-54 , 2000
holder1
Analytic central path, sensitivity analysis and parametric linear
programming
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Global Optimization
Horst, R. & Tuy, H.
Springer-Verlag , 1996
hor90
Global Optimization - Deterministic Approaches
Horst, R. & Tuy, H.
Springer-Verlag , 1990
hort93
Global Optimization (Deterministic Approaches)
Horst, R. & Tuy, H.
Springer-Verlag , 1993
hossain04
Clustering in mobile wireless ad hoc networks: issues and approaches
Hossain, E.; Palit, R. & Thulasiraman, P.
pp. 383-424 , 2004
hotta2
A complexity analysis of a smoothing method using CHKSfunctions for monotone linear complementarity problems
url
29.03.2006
JabRef Output
HougardyProemel98
Zelikovsky's 1+ln2 Approximation Algorithm for the Steiner Problem in
Graphs: A Simplified Analysis
Hougardy, S. & Proemel, H.
1998
hough1
Complete orthogonal decomposition for weighted least squares problems
Hough, P.D. & Vavasis, S.A.
1995
houle04
Dimensioning WDM Optical Networks with Minimum MSPP Configuration
Houle, A.; Jaumard, B. & Solari, Y.
Proceedings of the Seventh INFORMS Telecommunications Conference , 2004
Hou
Unitary triangularization of a nonsymmetric matrix
Householder, A.S.
Journal of the Association of Computer Machinery , Vol. 5 , pp. 339-342 , 1958
Hoyler81
The NP-completeness of edge-coloring
Hoyler, I.
SIAM Journal on Computing , Vol. 10 , pp. 718-720 , 1981
29.03.2006
JabRef Output
des93-7
On finding a minimum augmentation to biconnect a graph
Hsu, T. & Ramachandran, V.
SIAM Journal on Computing , Vol. 22 , pp. 889-891 , 1993
des91-4
A linear time algorithm for triconnectivity augmentation
Hsu, T. & Ramachandran, V.
Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science , pp. 548559 , 1991
HsuEtAL05
Two Variations of the Minimum Steiner Problem
Hsu, T.; Tsai, K.; Wang, D. & Lee, D.
Journal of Combinatorial Optimization , Vol. 9 , pp. 101-120 , 2005
hu01
Optimal traffic grooming for wavelength-division-multiplexing rings with
all-to-all uniform traffic
Hu, J.Q.
Journal of Optical Networking , Vol. 1 , pp. 32-42 , 2001
hu01a
Traffic grooming in wavelength-division-multiplexing ring networks: a
linear programming solution
Hu, J.Q.
Journal of Optical Networking , Vol. 1 , pp. 397-408 , 2001
huleida04
Traffic grooming, routing, and wavelength assignment in optical WDM
mesh networks
Hu, J.Q. & Leida, B.
Proceedings of IEEE INFOCOM 2004 , 2004
Hu_2003
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
Huang, L.
2000
Huard
Resolution of mathematical programming with nonlinear constraints by
the methods of centers
Huard, P.
pp. 209-222 , 1967
ha
Growth dynamics of the World-Wide Web
Huberman, B. & Adamic, L.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
huygens04
Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
Huygens, D.; Mahjoub, A. & Pesneau, P.
SIAM Journal on Discrete Mathematics , Vol. 18 , pp. 287-312 , 2004
HR92
Steiner tree problems
Hwang, F. & Richards, D.
Networks , Vol. 22 , pp. 55-89 , 1992
Hwang92a
Steiner Tree Problems
Hwang, F. & Richards, D.
Networks , Vol. 22 , pp. 55-89 , 1992
Hwang92b
The Steiner Tree Problem
Hwang, F.; Richards, D. & Winter, P.
Elsevier , 1992
HRW92
The Steiner tree problem
Hwang, F.; Richards, D. & Winter, P.
North-Holland , 1992
HwangEuclidean
A linear time algorithm for full Steiner trees
Hwang, F.K.
Operations Research Letters , Vol. 4 , pp. 235-237 , 1986
Hwa79a
An $O(n log n)$ algorithm for rectilinear minimal spanning trees
Hwang, F.K.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
subexponential time
Hwang, R.Z.; Chang, R.C. & Lee, R.C.T.
Algorithmica , Vol. 9 , pp. 398-423 , 1993
Hwang99
Adaptive multicast routing in multirate loss networks
Hwang, R.
Telecommunication Systems , Vol. 12 , pp. 283-313 , 1999
hyy98
Wavelength Assignment and Routing in WDM Networks
url
29.03.2006
JabRef Output
Ibarra:Kim
Fast Approximation Algorithms for the Knapsack and Sum of Subset
Problems
Ibarra, O. & Kim, C.
Journal of the Association for Computing Machinery , Vol. 22 , pp. 463-468 , 1975
IBM05
Reliable Multicast Messaging
IBM
2005
ESSL
Engineering and Scientific Subroutine Library Guide and Reference
IBM
Kingston, NY , 1988
Ichimori
A shortest path approach to a multifacility minimax location problem with
rectilinear distances
Ichimori, T.
Journal of the Operations Research Society of Japan , Vol. 28 , pp. 269-284 , 1985
Ihler93
The rectilinear class Steiner tree problem for intervals on two parallel
lines
Ihler, E.
1993
IhlerLines
The rectilinear class Steiner tree problem for intervals on two parallel
lines
Ihler, E.
1993
Ihler91
29.03.2006
JabRef Output
url
2001
illes2
Polynomial Affine-Scaling Algorithms for $P_*()$ Linear
Complementarity Problems
url
29.03.2006
JabRef Output
1998
illes1
Polynomial Affine-Scaling Algorithms for $P_*()$ Linear
Complementarity Problems
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
1999
istrail1
Statistical Mechanics, Three-Dimensionality and NP-completeness.
url
I. Universality of Intractability for the Partition Function of the Ising
Model Across Non-Planar Lattices
Istrail, S.
2000
Itai84
A golden ratio control policy for a multiple-access channel
Itai, A. & Rosberg, Z.
IEEE Transactions on Automatic Control , Vol. AC-29 , pp. 712-718 , 1984
iusem1
On dual convergence of the generalized proximal point method
with Bregman distances
url
29.03.2006
JabRef Output
Iwashita95
Design of highly reliable optical fiber cable network in access networks
Iwashita, M.; Oikawa, H.; Imanaka, H. & Toyoshima, R.
IEICE Transactions on Communications , Vol. E78-B , pp. 1033-42 , 1995
iyengar1
Cutting planes for mixed 0-1 semidefinite programming
Iyengar, G. & Cezik, M.T.
8th International Conference on Integer Programming and Combinatorial
Optimization (IPCO) , 2001
cullum1
The minimization of certain nondifferentiable sums of eigenvalues of
symmetric matrices
J. Cullum, W.D. & Wolfe, P.
Mathematical Programming Study , Vol. 3 , pp. 35-55 , 1975
dessd84
Routing with Time Windows by Column Generation
J. Desrosiers, F.S. & Desrochers, M.
Networks , pp. 545-565 , 1984
junger13
Box-inequalities for quadratic assignment polytopes
Jnger, M. & Kaibel, V.
Mathematical Programming , Vol. 91 , pp. 175-197 , 2001
junger7
On the SQAP-polytope
url
url
29.03.2006
JabRef Output
url
url
url
29.03.2006
JabRef Output
junger6
The design of the branch-and-cut system ABACUS
url
url
Jdice, J.J.; Patrcio, J.M.; Portugal, L.F.; Resende, M.G.C. & Veiga, G.
Computational Optimization and Applications , Vol. 24 , pp. 5-35 , 2003
judice2
A truncated interior point method for the solution of minimum cost flow
problems on an undirected multicommodity network
Jdice, J.J.; Portugal, L.F.; Resende, M.G.C. & Veiga, G.
Proceedings of the First Portuguese National Telecommunications Conference , pp.
381-384 , 1997
Jaeger:Tipper
Prioritized traffic restoration in connection oriented QoS based networks
Jger, B. & Tipper, D.
Computer Communications , Vol. 26 , pp. 2025-2036 , 2003
99jmk
Optical Cross Connects for Optical Networking
29.03.2006
JabRef Output
29.03.2006
JabRef Output
JagotaA96
Approximately solving maximum clique using neural networks and
related heuristics
Jagota, A.; Sanchis, L. & Ganesan, R.
Vol. 26 , pp. 169-204 , 1996
jaillet1
A priori solution of a traveling salesman problem in which a random
subset of the customers are visited
Jaillet, P.
Operations Research , Vol. 36 , pp. 929-936 , 1988
Jaillet:Song:Yu
Airline network design and hub location problems
Jaillet, P.; Song, G. & Yu, G.
Location Science , Vol. 4 , pp. 195-211 , 1996
Ja89
Probabilistic Analysis of an LP Relaxation Bound for the Steiner Problem
in Networks
Jain, A.
Networks , Vol. 19 , pp. 793-801 , 1989
Jain88
Algorithms for clustering data
Jain, A.K. & Dubes, R.C.
Prentice-Hall , 1988
jameson1
Finding an appropriate order for a hierarchy based on probabilistic
dominance
Jameson, K.A.; Appleby, M.C. & Freeman, L.C.
Animal Behaviour , Vol. 57 , pp. 991-998 , 1999
Jan93b
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
url
Jarre, F.
2003
29.03.2006
JabRef Output
jarre8
Comparing two interior point approaches for semi-infinite
programs
url
Jarre, F.
1999
jarre6
A QQP-Minimization Method for Semidefinite and Smooth
Nonconvex Programs
url
Jarre, F.
1998
jarre3
A New Line-Search Step Based On The Weierstrass S-C-Function For
Minimizing A Class Of Logarithmic Barrier Functions
Jarre, F.
Numerische Mathematik , Vol. 68 , pp. 81-94 , 1994
Jarre
On the convergence of the method of analytic centers when applied to
convex quadratic programs
Jarre, F.
Mathematical Programming , Vol. 49(3) , pp. 341-358 , 1990/1991
jarre7
Optimal truss design by interior point methods
url
29.03.2006
JabRef Output
url
jau03a
Routing and Wavelength Assignment in Single Hop All Optical Networks
with Minimum Blocking
Jaumard, B. & Hemazro, T.
JaMaMe99
Mathematical models and exact methods for channel assignment in
cellular networks
Jaumard, B.; Marcotte, O. & Meyer, C.
in B. Sans and P. Soriano, editors, Telecommunications Network Planning, Norwell,
MA: Kluwer , pp. 239-256 , 1999
29.03.2006
JabRef Output
JaMaMeVo02
Comparison of column generation models for channel assignment in
cellular networks
Jaumard, B.; Marcotte, O.; Meyer, C. & Vovor, T.
Discrete Applied Mathematics , Vol. 118 , pp. 299-322 , 2002
jau05
On Column Generation Formulations for the RWA Problem
Jaumard, B.; Meyer, C. & Thiongane, B.
INOC - International Network Optimization Conference , pp. B1.52-B1.59 , 2005
jau04b
ILP Formulations for the RWA Problem for Symmetrical Systems
Jaumard, B.; Meyer, C. & Thiongane, B.
2004
jau04c
Comparison of ILP Formulations for the RWA Problem
Jaumard, B.; Meyer, C. & Thiongane, B.
2004
jau04d
Decomposition Methods for the RWA Problem
Jaumard, B.; Meyer, C. & Thiongane, B.
2004
jau04a
ilp Formulations and Optimal Solutions for the RWA Problem
Jaumard, B.; Meyer, C.; Thiongane, B. & Yu, X.
IEEE GLOBECOM , Vol. 3 , pp. 1918-1924 , 2004
jau04
Routing and Wavelength Assignment with Full/Partial Conversion and
Regeneration
29.03.2006
JabRef Output
jeffcoat1
Simulated annealing for resource-constrained scheduling
Jeffcoat, D.E. & Bulfin, R.L.
European J. Oper. Res , Vol. 70 , pp. 43-51 , 1993
Jendrol01
Local structures in plane maps and distance colorings
Jendrol', S. & Skupie, Z.
Discrete Mathematics , Vol. 236 , pp. 167-177 , 2001
JeongLeeParkPark02
A branch-and-price algorithm for the Steiner tree packing problem
Jeong, G.; Lee, K.; Park, S. & Park, K.
Computers & Operations Research , Vol. 29 , pp. 221-241 , 2002
jmbo
Lethality and certainty in protein networks
Jeong, H.; Mason, S.; Barabsi, A. & Oltvai, Z.N.
Nature , Vol. 411 , pp. 41-42 , 2001
jtaob
The large-scale organization of metabolic networks
Jeong, H.; Tombor, B.; Albert, R.; Oltvai, Z.N. & Barabsi, A.
Nature , Vol. 407 , pp. 651-654 , 2000
ji1
Tapia indicators and finite termination of infeasible-interior-point
methods for degenerate LCP
Ji, J. & Potra, F.A.
1995
ji2
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
JinGalHab00a
Mtaheuristiques pour l'optimisation combinatoire et l'affectation sous
contraintes
Jin-Kao, H.; Galinier, P. & Habib, M.
Revue d'Intelligence Artificielle , Vol. 13 , pp. 283-324 , 2000
JL1999
A Peer-to-Peer zone-based two-level link state routing for mobile Ad Hoc
Networks
Joa-Ng, M. & Lu, I.
IEEE Journal on Selected Areas in Communications , Vol. 17 , pp. 1415-1425 , 1999
JLHMD99
Scenario-based performance analysis of routing protocols for mobile ad
hoc networks
Johansson, P.; Larsson, T.; Hedman, N.; Mielczarek, B. & Degermark, M.
Proceedings of IEEE MOBICOM , pp. 195-206 , 1999
Johari04
Efficiency Loss in Network Resource Allocation Game
Johari, R. & Tsitsiklis, J.N.
Mathematics of Operations Research , Vol. 29 , pp. 407-435 , 2004
John1
Extremum problems with inequalities as subsidiary conditions
John, F.
pp. 187-204 , 1948
cajohnson1
A Primal-Dual Method for Large-Scale Image Reconstruction in
Emission Tomography
url
29.03.2006
JabRef Output
crjohnson1
An interior-point method for approximate positive semidefinite
completions
url
url
Johnson, D.S.; Gutin, G.; McGeoch, L.A.; Yeo, A.; Zhang, W. & Zverovich,
A.
pp. 445-487 , 2002
dsjohnson1
Experimental Analysis of Heuristics for the STSP
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Johnson_1989
Modeling and strong linear programs for mixed integer programming
Johnson, E.
pp. 1-41 , 1989
Johnson:Nemhauser:Savelsbergh
Progress in linear programming-based algorithms for integer
programming: an exposition
Johnson, E.; Nemhauser, G. & Savelsbergh, M.
INFORMS Journal on Computing , Vol. 12 , pp. 2-23 , Winter 2000
Joal93
Multicommodity Network Flows~: The Impact of Formulation on
Decomposition
Jones, K.L.; Lustig, I.J.; Farvolden, J.M. & Powell, W.B.
Mathematical Programming , Vol. 62 , pp. 95-117 , 1993
jones1
Multicommodity Network Flows --- The Impact Of Formulation On
Decomposition
Jones, K.L.; Lustig, I.J.; Farvolden, J.M. & Powell, W.B.
Mathematical Programming , Vol. 62 , pp. 95-117 , 1993
JUNOSroute
JUNOS Internet Software Configuration Guide: Routing and
Routing Protocols, Release 4.3
url
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
kall1
SLP-IOR: An interactive model management system for stochastic linear
programs
Kall, P. & Mayer, J.
Mathematical Programming , Vol. 75 , pp. 221-240 , 1996
kawa94
Stochastic programming
Kall, P. & S.~Wallace
John Wiley and Sons , 1994
kall2
Stochastic Programming
url
url
url
Kalvelagen, E.
2001
kalvenes05
Hierarchical Cellular Network Design with Channel Allocation
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
url
Karisch, S.E.
1997
karisch1
Semidefinite Programming and Graph Equipartition
url
29.03.2006
JabRef Output
qzhao1
Semidefinite programming relaxations for the quadratic
assignment problem
url
url
url
Karloff, H.
SIAM Journal on Computing , Vol. 29(1) , pp. 336-350 , 1999
Ka96
29.03.2006
JabRef Output
29.03.2006
JabRef Output
1987
KRR2
An interior point algorithm to solve computationally difficult set covering
problems
Karmarkar, N.K.; Resende, M.G.C. & Ramakrishnan, K.G.
Mathematical Programming , Vol. 52 , pp. 597-618 , 1991
KRR89
An interior-point approach to the maximum independent set problem in
dense random graphs
Karmarkar, N.K.; Resende, M.G.C. & Ramakrishnan, K.G.
Proceedings of the XV Latin American Conference on Informatics , pp. 241-260 , 1989
Kar72
Reducibility among combinatorial problems. Complexity of computer
computations
Karp, R.
Plenum Press, New York , pp. 85-104 , 1972
Karp
On the computational complexity of combinatorial problems
Karp, R.M.
Networks , Vol. 5 , pp. 45-68 , 1975
karp1
Reducibility among combinatorial problems
Karp, R.M.
pp. 85-103 , 1972
Karp89
Monte-Carlo approximation algorithms for enumeration problems
Karp, R.; Luby, M. & Madras, N.
Journal of Algorithms , Vol. 10 , pp. 429-48 , 1989
29.03.2006
JabRef Output
KarpinskiZelikovsky97
New Approximation Algorithms for the Steiner Tree Problems
Karpinski, M. & Zelikovsky, A.
Journal of Combinatorial Optimization , Vol. 1 , pp. 47-65 , 1997
KZ95
New approximation algorithms for the Steiner tree problems
Karpinski, M. & Zelikovsky, A.
Journal of Combinatorial Optimization , Vol. 1 , pp. 47-65 , 1997
KarpinskiEtAl05
Improved Approximation Algorithms for the Quality of Service Multicast
Tree Problem
Karpinski, M.; andoiu, I.M.; Olshevsky, A. & Zelikovsky, A.
Algorithmica , Vol. 42 , pp. 109-120 , 2005
KarpinskiEtAl03
Improved Approximation Algorithms for the Quality of Service Steiner
Tree Problem
Karpinski, M.; andoiu, I.M.; Olshevsky, A. & Zelikovsky, A.
pp. 401-411 , 2003
Karpunin04
Universal Boundary Sets in the Generalized Steiner Problem
Karpunin, G.A.
Journal of Mathematical Sciences , Vol. 119 , pp. 86-92 , 2004
Karsten99
Cost and price calculation for Internet integrated services
Karsten, M.; Schmitt, J.; Wolf, L. & Steinmetz, R.
Proceedings of Kommunikation in Verteilten Systemen (KiVS'99) , 1999
karta00
Introduction to DWDM Technology
29.03.2006
JabRef Output
Kartalopoulos, S.
IEEE Press , 2000
Kar01
Fault Detectability in DWDM: Toward Higher Signal Quality and System
Reliability
Kartalopoulos, S.
IEEE PRESS , 2001
KaCa97
SONET Ring Sizing with Genetic Algorithms
Karunanithi, N. & Carpenter, T.
Computers and Operations Research , Vol. 24 , pp. 581-591 , 1997
Ksh1
Minima of Functions of Several Variables with Inequalities as Side
Constraints
Karush, W.
Department of Mathematics, University of Chicago , 1939
karypis2
Multilevel algorithms for multi-constraint hypergraph partitioning
url
Karypis, G.
1999
karypis1
Multilevel $k$-way hypergraph partitioning
url
url
29.03.2006
JabRef Output
Journal of Parallel and Distributed Computing , Vol. 48(1) , pp. 71-95 , 1998
Kaski04
Packing Steiner trees with identical terminal sets
Kaski, P.
Information Processing Letters , Vol. 91 , pp. 1-5 , 2004
kat04
Simulated Annealing Routing and Wavelength Lower Bounds Estimation
on wavelength-division multiplexing Optical Multistage Networks
Katangur, A.; Pan, Y. & Fraser, M.
Optical Engineering , Vol. 43 , pp. 1080-1091 , 2004
ospfte:02
Traffic Engineering Extensions to OSPF
Katz, D.; Yeung, D. & Kompella, K.
Katz:Sadrian:Tendick
Telephone companies analyze price quotations with Bellcore's PDSS
software
Katz, P.; Sadrian, A. & Tendick, P.
Interfaces , Vol. 24 , pp. 50-63 , 1994
katzela96channel
Channel Assignment Schemes for Cellular Mobile Telecommunications: A
Comprehensive Survey
Katzela, I. & Naghshineh, M.
IEEE Personal Communications , pp. 10-31 , 1996
Kauffman01
Economics and electronic commerce: Survey and directions for research
Kauffman, R.J. & Walden, E.A.
International Journal of Electronic Commerce , Vol. 5 , pp. 5-116 , 2001
KaufmannGaoThulasiraman
29.03.2006
JabRef Output
On Steiner minimal trees in grid graphs and its application to VLSI layout
Kaufmann, M.; Gao, S. & Thulasiraman, K.
Vol. 834 , pp. 351-359 , 1994
Kawatra
A multiperiod degree constrained minimal spanning tree problem
Kawatra, R.
European Journal of Operational Research , Vol. 143 , pp. 43-53 , 2002
Kawatra:Bricker_2004
Design of a degree-constrained minimal spanning tree with unreliable
links and node outage costs
Kawatra, R. & Bricker, D.
European Journal of Operational Research , Vol. 156 , pp. 73-82 , 2004
KawatraBricker04
Design of a degree-constrained minimal spanning tree with unreliable
links and node outage costs
Kawatra, R. & Bricker, D.
European Journal of Operational Research , Vol. 156 , pp. 73-82 , 2004
Kawatra:Bricker_2000
A multiperiod planning model for the capacitated minimal spanning tree
problem
Kawatra, R. & Bricker, D.
European Journal of Operational Research , Vol. 121 , pp. 412-419 , 2000
Kawatra:Dutta:Bricker
A Lagrangian based heuristic for the design of multipoint linkages in a
communication network with unreliable links and node outage costs
Kawatra, R.; Dutta, A. & Bricker, D.
Opsearch , Vol. 36 , pp. 218-230 , 1999
Ke97
Reliability evaluation for distributed computing networks with imperfect
29.03.2006
JabRef Output
nodes
Ke, W. & Wang, S.
IEEE Transactions on Reliability , Vol. 46 , pp. 342-9 , 1997
KeCoDwZw
TreadMarks: Distributed memory on standard workstations and operating
systems
Keleher, P.; Cox, A.; Dwarkadas, S. & Zwaenepoel, W.
Proceedings of the 1994 Winter Usenix Conference , pp. 115-131 , 1994
kellerer1
Selecting portfolios with fixed costs and minimum transaction lots
Kellerer, H.; Mansini, R. & Speranza, M.G.
Annals of Operations Research , Vol. 99 , pp. 287-304 , 2000
Kellerer-etal-2004
Knapsack Problems
Kellerer, H.; Pferchy, U. & Pirsinger, D.
Springer Verlag , 2004
kel60
The Cutting-Plane Method for Solving Convex Programs
Kelley, J.E.
J. Soc. Indus. Appl. Math. , Vol. VIII , pp. 703-712 , 1960
kelley1
The cutting plane method for solving convex programs
Kelley, J.E.
Journal of the SIAM , Vol. 8 , pp. 703-712 , 1960
KeKh82
Capacitated Warehouse Location with Concave Costs
Kelly, D. & Khumawala, B.
Journal of the Operational Research Society , Vol. 33 , pp. 817-826 , 1982
29.03.2006
JabRef Output
Kelly97
Charging and accounting for bursty connections
Kelly, F.K.
pp. 253-278 , 1997
Kelly98
Rate Control in Communication Networks: Shadow Prices, Proportional
Fairness and Stability
Kelly, F.P.; Maullo, A.K. & Tang, D.K.H.
Journal of the Operational Research Society , Vol. 49 , pp. 237-252 , 1998
Kel97
Charging and rate control for elastic traffic
Kelly, F.
European Transactions on Telecommunications , Vol. 8 , pp. 33-37 , 1997
Kel96
Notes on Effective Bandwidths
Kelly, F.
pp. 141-168 , 1996
Ke88
Routing in circuit-switched networks: Optimization, shadow prices and
decentralization
Kelly, F.
Adv. Appli. Prob. , Vol. 20 , pp. 112-144 , 1988
kelly1
EPM: An Exterior Point Method for Linear Programming
url
29.03.2006
JabRef Output
nonlinear programming
Kelly, T.K. & Kupferschmid, M.
SIAM Review , Vol. 40 , pp. 310-314 , 1998
Kelso-Crawford-1982
Job Matching, Coalition formation and Gross Substitutes
Kelso, A.S. & Crawford, V.P.
Econometrica , Vol. 50 , pp. 1483-1504 , 1982
Kemperman68
The general moment problem: A geometric approach
Kemperman, J.H.B.
Annals of Mathematical Statistics , Vol. 39 , pp. 93-122 , 1968
Kenningion:Olinick:Lewis:Ortynski:Spiride
Robust solutions for the DWDM routing and provisioning problem:
models and algorithms
Kenningion, J.; Olinick, E.; Lewis, K.; Ortynski, A. & Spiride, G.
Optical Networks Magazine , Vol. 4 , pp. 74-84 , 2003
ken78
Multicommodity flows: a state-of-the art survey of linear models and
solution techniques
Kennington, J.
Opns. Res. , Vol. 26 , pp. 209-236 , 1978
KenHel80
Algorithms for Network Programming
Kennington, J. & Helgason, R.
John Wiley and Sons, Inc. , 1980
keningtpath01
The Path Restoration Version of the Spare Capacity Allocation Problem
with Modularity Restrictions: Models, Algorithms, and an Empirical
Analysis
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Keon:Anandalingam
Optimal pricing for multiple services in telecommunications networks
offering quality-of-service guarantees
Keon, N. & Anandalingam, G.
IEEE/ACM Transactions on Networking , Vol. 11 , pp. 66-80 , 2003
kerivin1
A scheme for exact separation of extended cover inequalities and
application to multidimensional knapsack problems
Kerivin, H. & Mahjoub, A.R.
Operations Research Letters , Vol. 30 , pp. 252-264 , 2002
kerivin02
Separation of the partition inequalities for the (1,2)-survivable network
design problem
Kerivin, H. & Mahjoub, A.
Operations Research Letters , Vol. 30 , pp. 265-268 , 2002
Kerivin:Mahjoub
Separation of partition inequalities for the (1,2)-survivable network
design problem
Kerivin, H. & Mahjoub, A.
Operations Research Letters , Vol. 30 , pp. 265-268 , 2002
kernacpha03
Models for the capacitated survivable network design problem
Kerivin, H.; Nace, D. & Pham, T.
Proc. Int. Network Optimization Conf. (INOC'03) , 2003
Kernighan1
An efficient heuristic procedure for partitioning graphs
Kernighan, B.W. & Lin, S.
Bell System Technical Journal , Vol. 49 , pp. 291-307 , 1970
kerlin70
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Khachiyan3
Rounding of polytopes in the real number model of computation
Khachiyan, L.G.
Mathematics of Operations Research , Vol. 21 , pp. 307-320 , 1996
Kha
A polynomial algorithm in linear programming
Khachiyan, L.G.
Doklady Akademiia Nauk SSSR , Vol. 224 , pp. 1093-1096 , 1979
Khachiyan2
On the complexity of approximating the maximal inscribed ellipsoid for a
polytope
Khachiyan, L.G. & Todd, M.J.
1990
khanna:89
The Revised ARPANET routing metric
Khanna, A. & Zinky, J.
Proc. ACM SIGCOMM , pp. 45-56 , 1989
KSF01
Efficient Setup for Multicast Connections Using Tree-Caching
Kheong, C.; Siew, D. & Feng, G.
Proceedings IEEE INFOCOM 2001 , pp. 249-258 , 2001
KhouryPardalosDu93
A Test Problem Generator for the Steiner Problem in Graphs
Khoury, B.N.; Pardalos, P.M. & Du, D.Z.
ACM Transactions on Mathematical Software , Vol. 19 , pp. 509-522 , 1993
KhouryPardalos96
A heuristic for the Steiner problem in graphs
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Khumawala, B.
Management Science , Vol. 18 , pp. 718-731 , 1972
kilakos1
Fractional and integer colourings
Kilakos, K. & Marcotte, O.
Mathematical Programming , Vol. 76 , pp. 333-347 , 1997
Kil99
Differentiated services for the Internet
Kilkki, K.
Macmillan technical publishing , 1999
dkim1
Multimodal express package delivery: a service network design application
Kim, D.; Barnhart, C.; Ware, K. & Reinhardt, G.
Transportation Science , Vol. 33(4) , pp. 391-407 , 1999
hkim1
A strong cutting plane algorithm for the robotic assembly line balancing
problem
Kim, H. & Park, S.
International Journal of Production Research , Vol. 33 , pp. 2311-2323 , 1995
Kim:Chung:Tcha
Optimal design of the two-level distributed network with dual homing local
connections
Kim, H.; Chung, S. & Tcha, D.
IIE Transactions , Vol. 27 , pp. 555-563 , 1995
KCCJ02
A Polynomial Time Approximation Scheme for the Grade of Service
Steiner Minimum Tree Problem
Kim, J.; Cardei, M.; Cardei, I. & Jia, X.
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
2002
skim1
Second Order Cone Programming Relaxation of Nonconvex
Quadratic Optimization Problems
url
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Kiwiel, K.C.
Mathematical Programming , Vol. 74 , pp. 47-54 , 1996
kiwiel8
The efficiency of subgradient projection methods for convex optimization.
Part I: general level methods. Part II: implementations and extensions
Kiwiel, K.C.
SIAM Journal on Control and Optimization , Vol. 34(2) , pp. 660-697 , 1996
kiwiel1
Proximal level bundle methods for convex nondifferentiable optimization,
saddle-point problems and variational inequalities
Kiwiel, K.C.
Mathematical Programming , Vol. 69 , pp. 89-109 , 1995
kiwiel9
Proximity control in bundle methods for convex nondifferentiable
minimization
Kiwiel, K.C.
Mathematical Programming , Vol. 46 , pp. 105-122 , 1990
kiwiel10
Methods of Descent of Nondifferentiable Optimization
Kiwiel, K.C.
Springer , 1985
kiwiel12
An aggregate subgradient method for nonsmooth convex minimization
Kiwiel, K.C.
Mathematical Programming , Vol. 27 , pp. 320-341 , 1983
kiwiel5
The efficiency of ballstep subgradient level methods for convex
optimization
Kiwiel, K.C.; Larsson, T. & Lindberg, P.O.
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
Klein, M.
Management Science , Vol. 14 , pp. 205-220 , 1967
klepst94
Faster approximation algorithms for the unit capacity concurrent flow
problem with applications to routing and finding sparse cuts
Klein, P.; Plotkin, S.; Stein, C. & Tardos, E.
SIAM Journal on Computing , Vol. 23 , pp. 466-487 , 1994
KleinRavi
A nearly best-possible approximation algorithm for node-weighted Steiner
trees
Klein, P. & Ravi, R.
Journal of Algorithms , Vol. 19 , pp. 104-115 , 1995
Klein97
Introduction to electronic auctions
Klein, S.
Electronic Markets , Vol. 7 , pp. 3-7 , 1997
kleinberg2
Authoratitive sources in a hyperlinked environment
Kleinberg, J.
J. of the ACM , Vol. 48 , pp. 604-632 , 1999
kleinberg
Authoritative sources in a hyperlinked environment
Kleinberg, J.
Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms ,
1998
klei96
Approximation algorithms for disjoint path problems
J. Kleinberg
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
deklerk12
Aspects of Semidefinite Programming: Interior Point Algorithms
and Selected Applications
url
de Klerk, E.
Kluwer Academic Publishers , 2002
deklerk5
Interior point methods for semidefinite programming
E. de Klerk
ITS/TWI/SSOR, Technical University of Delft , 1997
deklerk6
Relaxations of the Satisfiability Problem using Semidefinite
programming
url
url
url
url
29.03.2006
JabRef Output
deklerk7
A scaled Gauss-Newton Primal-Dual Search Direction for
Semidefinite Optimization
url
url
url
url
29.03.2006
JabRef Output
Kle74
An algorithm for nonlinear multicommodity flow problems
Klessig, R.
Networks , Vol. 4 , pp. 343-355 , 1974
Klincewicz1998
Hub location in backbone/tributary network design: A review
Klincewicz, J.G.
Location Science , Vol. 6 , pp. 307-335 , 1998
KlincewiczLuss1986
A Lagrangian relaxation heuristic for capacitated facility location with
single-source constraints
Klincewicz, J.G. & Luss, H.
Journal of the Operational Research Society , Vol. 37 , pp. 495-500 , 1986
KlincewiczLussYan1998
Designing tributary networks with multiple ring families
Klincewicz, J.G.; Luss, H. & Yan, D.C.K.
Computers and Operations Research , Vol. 25 , pp. 1145-1157 , 1998
Kli02a
Enumeration and search procedures for a hub location
url
url
29.03.2006
JabRef Output
url
problem
Klincewicz, J. & Rajan, A.
Naval Research Logistics , Vol. 41 , pp. 893-912 , 1994
KlincewiczSchmittWong2002
Incorporating QoS into IP Enterprise Network Design
Klincewicz, J.; Schmitt, J. & Wong, R.
Telecommunications Systems , Vol. 20 , pp. 81-106 , 2002
klingman1
Netgen: A program for generating large scale capacitated assignment,
transportation, and minimum cost network flow problems
Klingman, D.; Napier, A. & Stutz, J.
Management Science , Vol. 20 , pp. 814-821 , 1974
KNEPLEY
29.03.2006
JabRef Output
url
url
Knuth, D.E.
Electronic Journal of Combinatorics , Vol. 1 , pp. A1 , 1994
knuth1
The sandwich theorem
Knuth, D.E.
1993
knu73
Sorting and Searching
Knuth, D.E.
Addison-Wesley Publishing Company , 1973
29.03.2006
JabRef Output
Kno69
Graphentheoretische Methoden und ihre Anwendungen
Kndel, W.
Springer-Verlag , pp. 55-59 , 1969
des89-6
Heuristics methods for designing highly survivable
communication networks
Ko, C. & Monma, C.
1989
Kocan03
Capitalizing on the Growing Presence of IP Networks in the Telecom Space
Kocan, K.
Bell Labs Technical Journal , Vol. 8 , pp. 1-3 , 2003
KM98
Solving Steiner tree problems in graphs to optimality
Koch, T. & Martin, A.
Networks , Vol. 32 , pp. 207-232 , 1998
Koch98
Solving Steiner Tree Problems in Graphs to Optimality
Koch, T. & Martin, A.
Networks , Vol. 32 , pp. 207-232 , 1998
KochMartin98
Solving Steiner Tree Problems in Graphs to Optimality
Koch, T. & Martin, A.
Networks , Vol. 32 , pp. 207-232 , 1998
KochMartin
url
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
url
Koh, C. K.
National University of Singapore , 1995
Kohavi04a
Lessons and challenges from mining retail e-commerce data
Kohavi, R.; Mason, L.; Parekh, R. & Zheng, Z.
Machine Learning , Vol. 57 , pp. 83-113 , 2004
kohl1
An optimization algorithm for the vehicle routing problem with time
windows based on Lagrangian relaxation
Kohl, N. & Madsen, O.B.G.
Operations Research , Vol. 45 , pp. 395-406 , 1997
koh95
A Mathematical Theory of Evidence: An Approach to the Dempster-Shafer
Thoery of Evidence
Kohlas, J. & Monney, P.
Springer , 1995
KoSH99
Experiences with fine-grained parallel genetic algorithms
29.03.2006
JabRef Output
url
Kojima, M.
2004
kojima15
A General Framework for Convex Relaxation of Polynomial
Optimization Problems over Cones
url
Kojima, M.
2002
kojima12
Moderate Nonlinearity = Convexity + Quadratic Concavity
url
Kojima, M.
1999
Koj1
Determining basic variables of optimal solutions in Karmarkar's new LP
algorithm
Kojima, M.
Algorithmica , Vol. 1 , pp. 499-515 , 1986
kojima7
Linear algebra for semidefinite programming
url
29.03.2006
JabRef Output
Linear Algebra and its Applications , Vol. 152 , pp. 69-92 , 1991
kojima1
Decomposition in interior-point methods
Kojima, M.; Megiddo, N.; Mizuno, S. & Shindoh, S.
1994
KMN
Limiting behavior of trajectories generated by a continuation method for
monotone complementarity problems
Kojima, M.; Mizuno, S. & Noma, T.
Mathematics of Operations Research , Vol. 15(4) , pp. 662-675 , 1990
KMY1
A primal-dual interior point method for linear programming
Kojima, M.; Mizuno, S. & Yoshise, A.
Progress in Mathematical Programming , pp. 29-47 , 1989
KMY2
A polynomial-time algorithm for a class of linear complementary problems
Kojima, M.; Mizuno, S. & Yoshise, A.
Mathematical Programming , Vol. 44(1) , pp. 1-26 , 1989
kojima3
A Predictor-Corrector Interior-Point Algorithm for the
Semidefinite Linear Complementarity Problem Using the AlizadehHaeberly-Overton Search Direction
url
url
29.03.2006
JabRef Output
kojima6
Search Directions in the SDP and the Monotone SDLCP:
Generalization and Inexact Computation
url
url
url
url
url
29.03.2006
JabRef Output
kojima8
Cones of matrices and successive convex relaxations of nonconvex
sets
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
konno2
Linear multiplicative programming
Konno, H. & Kuno, T.
Mathematical Programming , Vol. 56 , pp. 51-64 , 1992
konno3
Portfolio optimization problem under concave transaction costs and
minimal transaction unit constraints
Konno, H. & Wijayanayake, A.
Mathematical Programming , Vol. 89 , pp. 233-250 , 2001
konno4
Minimal concave cost rebalance of a portfolio to the efficient frontier
Konno, H. & Yamamoto, R.
Mathematical Programming , Vol. 97 , pp. 571-585 , 2003
KonBar95a
A GRASP for the vehicle routing problem with time
url
windows
Kontoravdis, G. & Bard, J.
ORSA Journal on Computing , Vol. 7 , pp. 10-23 , 1995
KooRosChaChu03
Location Discovery in Enterprise-Based Wireless Networks: Case Studies
and Applications
Koo, S.; Rosenberg, C.; Chan, H. & Chung, Y.
Ann. Telecommun. , Vol. 58 , pp. 1-22 , 2003
KoBe57
Assignment Problems and the Location of Economics Activities
Koopmans, T. & Beckmann, M.
Econometrica , Vol. 25 , pp. 53-76 , 1957
29.03.2006
JabRef Output
KopfRuhe87
A computational study of the weighted independent set problem for
general graphs
Kopf, R. & Ruhe, G.
Found. Control Engin. , Vol. 12 , pp. 167-180 , 1987
korf1
Stochastic programming duality: $L^$ multipliers for unbounded
constraints with an application to mathematical finance
Korf, L.A.
Mathematical Programming , Vol. 99 , pp. 241-259 , 2004
KorLazOr
Avoiding the Braess Paradox in Non-Cooperative Networks
Korilis, Y.A.; Lazar, A.A. & Orda, A.
Journal of Applied Probability , Vol. 36 , pp. 211-222 , 1999
Koal97
Optimal Pricing Strategies in Noncooperative Networks
Korilis, Y.; Varvarigou, T. & Ahuja, S.
pp. 110-123 , 1997
Ko99
Avoiding the Braess paradox in non-cooperative networks
Korillis, Y.; Lazar, A. & Orda, A.
Journal of Applied Probability , Vol. 36 , pp. 211-222 , 1999
Ko97
Capacity allocation under non-cooperative routing
Korillis, Y.; Lazar, A. & Orda, A.
IEEE/ACM Transactions on Networking , Vol. 5 , pp. 309-173 , 1997
kortanek7
A Decade of Semi-Infinite Programming: 1962--1972
url
29.03.2006
JabRef Output
Kortanek, K.O.
2000
kortanek6
Observations on Infeasibility Detectors for Classifying Conic
Convex Programs
url
Kortanek, K.O.
1999
Kortanek3
A central cutting plane algorithm for convex semi-infinite programming
problems
Kortanek, K.O. & No, H.
1990
KorPotYe
On some efficient interior point methods for nonlinear convex
programming
Kortanek, K.O.; Potra, F. & Ye, Y.
Linear Algebra and its Applications , Vol. 152 , pp. 169-190 , 1991
KoShi
Convergence results and numerical experiments on a linear programming
hybrid algorithm
Kortanek, K.O. & Shi, M.
European J. Oper. Res , Vol. 32 , pp. 47-61 , 1987
kortanek4
An infeasible interior-point algorithm for solving primal and dual
geometric programs
Kortanek, K.O.; Xu, X. & Ye, Y.
Mathematical Programming , Vol. 76 , pp. 155-181 , 1997
kortanek5
Perfect duality in semi-infinite programming and semidefinite
programming
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Worst-case equilibria
Koutsoupias, E. & Papadimitriou, C.
Proceedings of the 16th Annual Symposium on the Theoretical Aspects of Computer
Science , pp. 404-413 , 1999
KoutPap
Worst-Case Equilibria
Koutsoupias, E. & Papadimitrou, C.H.
Proceedings of the 16th Annual Symposium on the Theoretical Aspects of Computer
Science , pp. 404-413 , 1999
Kouvelis94
Vertex packing problem application to the design of electronic testing
fixtures
Kouvelis, P.
Annals of Operations Research , Vol. 50 , pp. 319-337 , 1994
Kozlowska90
Maximization of computer network reliability with respect to cost
Kozlowska, J.
Systems Science , Vol. 16 , pp. 53-62 , 1990
KrPr83
The Simple Plant Location Problem: Survey and Synthesis
Krarup, J. & Pruzan, P.
European Journal of Operational Research , Vol. 12 , pp. 36-81 , 1983
KraPelRusTer98a
A GRASP approach to the protein structure
prediction problem
1998
krau
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
url
url
url
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
url
Kruk, S.; Muramatsu, M.; Rendl, F.; Vanderbei, R.J. & Wolkowicz, H.
Optimization Methods and Software , Vol. 15 , pp. 1-27 , 2001
kruk4
Convergence of an infeasible short-step path-following algorithm
based on the Gauss-Newton direction
url
29.03.2006
JabRef Output
url
doi
29.03.2006
JabRef Output
Kruskal, J.
Proc. Amer. Math. Soc. , Vol. 7 , pp. 48-50 , 1956
Kuehn:Hamburger
A Heuristic Program for Locating Warehouses
Kuehn, A. & Hamburger, M.
Management Science , Vol. 19 , pp. 643-666 , 1963
KuHa63
A Heuristic Program for Locating Warehouses
Kuehn, A. & Hamburger, M.
Management Science , Vol. 9 , pp. 643-666 , 1963
Kuhn-PSTN
Sources of Failure in Public Switched Telephone Network
Kuhn, D.R.
IEEE Computer , Vol. 30 , pp. 31-36 , 1997
KuhnWattenhofer03
Constant-time distributed dominating set approximation
doi
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
kuo1
Analyzing and modeling the maximum diversity problem by zero-one
programming
Kuo, C.; Glover, F. & Dhir, K.S.
Decision Sciences , Vol. 24(6) , pp. 1171-1185 , 1993
ecker2
A note on the solution of nonlinear programming problems with imprecise
function and gradient values
Kupferschmid, M. & Ecker, J.G.
Mathematical Programming Study , Vol. 31 , pp. 129-138 , 1987
04kuri
Assessing the economic benefit of introducing multi-granularity switching
cross-connects in optical transport networks
Kuri, J.; Puech, N. & Gagnaire, M.
2004
kutten98fast
Fast Distributed Construction of Small k -Dominating Sets and
Applications
Kutten, S. & Peleg, D.
J. Algorithms , Vol. 28 , pp. 40-66 , 1998
coxSanchez01
Cost Savings from Optimized Packing and Grooming of Optical Circuits:
Mesh versus Ring Comparisons
L. A. Cox, J. & Sanchez, J.R.
Optical Networks Magazine , Vol. 2 , pp. 72-90 , 2001
Fral73
The flow deviation method: an approach to store-and-forward
communication network design
L. Fratta, M.G. & Kleinrock, L.
Networks , Vol. 3 , pp. 97-133 , 1973
29.03.2006
JabRef Output
Cox:Kuehner:Parrish:Qiu
Optimal expansion of fiber-optic telecommunications networks in
metropolitan areas
L.A. Cox, J.; Kuehner, W.; Parrish, S. & Qiu, Y.
Interfaces , Vol. 23 , pp. 35-48 , 1993
CoDaLuOrSuSi96
Reducing Costs of Backhaul Networks for PCS Networks Using Genetic
Algorithms
L.A. Cox, J.; Davis, L.; Lu, L.; Orvosh, D.; Sun, X. & Sirovica, D.
Journal of Heuristics , Vol. 2 , pp. 201-216 , 1996
EGM94
A Lagrangian relax and cut approach for the sequential ordering with
precedence constraints
L.~Escudero; M.~Guignard & K.~Malik
Annals of Operations Research , Vol. 50 , pp. 219-237 , 1994
luthi1
The Analytic Center Quadratic Cut Method (ACQCM) for Strongly
Monotone Variational Inequality Problems
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
La89
Planejamento de Redes de Entroncamento em reas Urbanas MultiCentrais
Lage, L.C.M.
DCC/UFMG , 1989
Lagoa00
Decentralized Optimal Traffic Engineering in the Internet
Lagoa, C. & Che, H.
Computer Communications Review , Vol. 30 , pp. 39-47 , 2000
La94
Clustering for the Design of SONET Rings in
Interoffice Telecommunications
Laguna, M.
Management Science , Vol. 40 , pp. 1533-1541 , 1994
Laguna92
Optimal design of SONET rings for interoffice telecommunication
Laguna, M.
1992
LagFeoElr94a
A greedy randomized adaptive search procedure for the
url
two-partition problem
Laguna, M.; Feo, T. & Elrod, H.
Operations Research , Vol. 42 , pp. 677-687 , 1994
LagGlo93a
Bandwidth packing: A tabu search approach
Laguna, M. & Glover, F.
Management Science , Vol. 39 , pp. 492-500 , 1993
29.03.2006
JabRef Output
LagGon91a
A search heuristic for just-in-time scheduling
url
in parallel machines
Laguna, M. & Gonzlez-Velarde, J.
Journal of Intelligent Manufacturing , Vol. 2 , pp. 253-260 , 1991
LagunaMarti01
A GRASP for coloring sparse graphs
Laguna, M. & Mart, R.
Computational Optimization and Applications , Vol. 19 , pp. 165-178 , 2001
LagMar01b
A GRASP for coloring sparse graphs
url
29.03.2006
JabRef Output
url
Lanckriet, G.R.G.; Cristiani, N.; Bartlett, P.; Ghaoui, L.E. & Jordan, M.I.
Journal of Machine Learning Research , Vol. 5 , pp. 27-72 , 2004
lanckriet1
A Robust Minimax Approach to Classification
url
29.03.2006
JabRef Output
Land:Powell
Computer codes for problems of integer programming
Land, A. & Powell, S.
Annals of Discrete Mathematics , Vol. 5 , pp. 221-269 , 1979
Lanning99
Optimal Pricing in Queuing Systems with Quality of Service Constraints
Lanning, S.G.; Massey, W.A.; Rider, B. & Wang, Q.
Proceedings of the 16th International Teletraffic Congress , pp. 747-756 , 1999
Massey99
Optimal Pricing in Queuing Systems with Quality of Service Constraints
Lanning, S.G.; Massey, W.A.; Rider, B. & Wang, Q.
Proceedings of the 16th International Teletraffic Congress-ITC16 , pp. 747-756 , 1999
Massey02
Threshold Pricing for Selling Network Capacities through Forward
Contract
Lanning, S.G.; Massey, W.A. & Wang, Q.
pp. 145-158 , 2002
Lanning00
Optimal Planning for Optical Transport Networks
Lanning, S.G.; Mitra, D.; Wang, Q. & Wright, M.H.
Phil. Transaction of Royal Society, London A. , Vol. 358 , pp. 2183-2196 , 2000
Lanningneuman99
A Taxonomy of Communications Demand
Lanning, S.G.; Neuman, W.R. & O'Donnell, S.
Proceedings of 27th Telecommunications Policy Research Conference , 1999
laporte2
The vehicle routing problem: An overview of exact and approximate
algorithms
29.03.2006
JabRef Output
Laporte, G.
European J. Oper. Res , Vol. 59 , pp. 345-358 , 1992
laporte92
The traveling salesman problem : anoverview of exact and approximate
algorithms
Laporte, G.
European Journal of Operational Research , Vol. 59 , pp. 231-247 , 1992
laporte1
The integer L-shaped method for stochastic integer programs with
complete recourse
Laporte, G. & Louveaux, F.V.
Operations Research Letters , Vol. 13 , pp. 133-142 , 1993
laporte3
A branch-and-cut algorithm for the undirected traveling purchaser
problem
Laporte, G.; Riera-Ledesma, J. & Salazar-Gonzlez, J.
Operations Research , Vol. 51 , pp. 940-951 , 2003
lara1
On the limiting properties of the affine-scaling directions
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
La97
Applications of the simplicial decomposition with nonlinear column
generation to nonlinear network flows
Larsson, T.; Patriksson, M. & Rydergren, C.
Vol. 450 , pp. 346-373 , 1997
La70
Optimization Theory for Large Systems
Lasdon, L.S.
Macmillan , 1970
lasdon1
Survey of Nonlinear programming applications
Lasdon, L.S. & Warren, A.D.
Operations Research , Vol. 28 , pp. 1029-1073 , 1980
las70
Optimization Theory for Large Systems
Lasdon, L.
MacMillan , 1970
lasserre12
A discrete Farkas lemma
Lasserre, J.B.
Discrete Optimization , Vol. 1 , pp. 67-75 , 2004
lasserre9
A moment approach to analyze zeros of triangular polynomial sets
url
Lasserre, J.B.
2004
lasserre11
Generating functions and duality for integer programs
url
Lasserre, J.B.
29.03.2006
JabRef Output
2003
lasserre8
Integer programming, duality, and superadditive functions
url
Lasserre, J.B.
2003
lasserre4
Semidefinite programming vs LP relaxations for polynomial
programming
url
Lasserre, J.B.
Mathematics of Operations Research , Vol. 27 , pp. 347-360 , 2002
lasserre6
An explicit exact SDP relaxation for nonlinear 0-1 programs
Lasserre, J.B.
Vol. 2081 , pp. 293-303 , 2001
lasserre7
Global optimization with polynomials and the problem of moments
Lasserre, J.B.
SIAM Journal on Optimization , Vol. 11 , pp. 796-817 , 2001
lasserre2
Why the logarithmic barrier function in convex and linear programming
Lasserre, J.B.
Operations Research Letters , Vol. 27 , pp. 149-152 , 2000
lasserre5
Optimality conditions and LMI relaxations for 0--1 programs
Lasserre, J.B.
2000
lasserre1
Having homogeneous or quadratic data in Nonlinear
url
29.03.2006
JabRef Output
url
url
Laurent, M.
Mathematics of Operations Research , Vol. 28 , pp. 470-496 , 2003
laurent3
Tighter Linear and Semidefinite Relaxations for Max-Cut Based on
the Lovsz-Schrijver Lift-and-Project Procedure
url
Laurent, M.
SIAM Journal on Optimization , Vol. 12 , pp. 345-375 , 2002
laurent7
Lower bound for the number of iterations in semidefinite
relaxations for the cut polytope
url
Laurent, M.
2002
laurent5
Semidefinite Relaxations for Max-Cut
url
29.03.2006
JabRef Output
Laurent, M.
2001
laurent8
A tour d'horizon on positive semidefinite and Euclidean distance matrix
completion problems
Laurent, M.
Vol. 18 , 1998
laurent9
On a positive semidefinite relaxation of the cut polytope
Laurent, M. & Poljak, S.
Linear Algebra and its Applications , Vol. 223 , pp. 439-461 , 1995
laurent2
Connections between semidefinite relaxations of the max-cut and stable
set problems
Laurent, M.; Poljak, S. & Rendl, F.
Mathematical Programming , Vol. 77 , pp. 225-246 , 1997
laurent6
Semidefinite programming and integer programming
url
29.03.2006
JabRef Output
LaWd
Branch-and-bound methods: a survey
Lawler, E.L. & Wood, D.E.
Operations Research , Vol. 14 , pp. 699-719 , 1966
Lawler79
Fast Approximation Algorithms for the Knapsack Problems
Lawler, E.
Mathematics of Operations Research , Vol. 4 , pp. 339-356 , 1979
Law76
Combinatorial Optimization : Networks and Matroids
Lawler, E.
Holt, Rinehart and Wilson , 1976
lawphongpanich2
A nontangential cutting plane algorithm
Lawphongpanich, S.
Operations Research Letters , Vol. 30 , pp. 49-56 , 2002
lawphongpanich1
Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear
multicommodity network flow problems with side constraints
Lawphongpanich, S.
Operations Research Letters , Vol. 26(1) , pp. 33-41 , 2000
lawrence1
A Computationally Efficient Feasible Sequential Quadratic
Programming Algorithm
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Lee:Hui:Tong:Yum
Network dimensioning in WDM-based all-optical networks
Lee, C.; Hui, C.R.; Tong, F.F. & Yum, P.T.
Photonic Network Communications , Vol. 2 , pp. 215-225 , 2000
LeCh97
Balancing Loads on SONET Rings with Integer Demand Splitting
Lee, C. & Chang, S.
Computers and Operations Research , Vol. 24 , pp. 221-229 , 1997
LeeK00
Cell Planning with Capacity Expansion in Mobile Communications: A Tabu
Search Approach
Lee, C. & Kang, H.
IEEE Trans. on Vehicular Technology , Vol. 49 , pp. 1678-1690 , 2000
Lee:Koh
A design of self-healing ATM networks based on backup virtual paths
Lee, C. & Koh, S.
Computers & Operations Research , Vol. 25 , pp. 595-609 , 1998
Lee97
A design of the minimum cost ring-chain network with dual-homing
survivability: a tabu search approach
Lee, C. & Koh, S.
Computers & Operations Research , Vol. 24 , pp. 883-97 , 1997
LeKo97
A Design of the Minimum Cost Ring-Chain Network with Dual-Homing
Survivability: A Tabu Search Approach
Lee, C. & Koh, S.
Computers and Operations Research , Vol. 24 , pp. 883-897 , 1997
Lee:Sung_2003
29.03.2006
JabRef Output
url
Lee, E.K.
2000
eva4
On facets of knapsack equality problems
Lee, E.K.
Journal of Optimization Theory and Applications , Vol. 94 , pp. 223-239 , 1997
Lee_MIPSOL
Computational Experience of a General Purpose Mixed 0/1 Integer
Programming Solver (MIPSOL)
url
Lee, E.K.
1997
Lee_radiation
A Branch-and-Cut Approach to Treatment Plan Optimization for
Permanent Prostate Implants
url
Lee, E.K.
1997
Sarcoma
Automated Tumor Volume Contouring in Soft-Tissue Sarcoma
Adjuvant Brachytherapy Treatment
url
url
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
eva6
Branch-and-bound methods for integer programming
url
url
29.03.2006
JabRef Output
1-9 , 1997
Lee:Mitchell:2
Computational Experience of an Interior-Point SQP Algorithm in a Parallel
Branch-and-Bound Framework
Lee, E. & Mitchell, J.
Proceedings of High Performance Optimization Techniques 1997 , 1997
Lee:Mitchell
Computational Experience in Nonlinear Mixed Integer Programming
Lee, E. & Mitchell, J.
The Operations Research Proceedings 1996 , pp. 95-100 , 1996
Lee:Nazem:Shi
Designing rural area telecommunication networks via hub cities
Lee, H.; Nazem, S. & Shi, Y.
Omega , Vol. 22 , pp. 305-314 , 1994
lee7
Constrained maximum-entropy sampling
Lee, J.
Operations Research , Vol. 46 , pp. 655-664 , 1998
lee5
Hoffman's circle untangled
Lee, J.
SIAM Review , Vol. 39 , pp. 98-105 , 1997
Lee
Characterizations of the dimension for classes of concordant polytopes
Lee, J.
Mathematics of Operations Research , Vol. 15(1) , pp. 139-154 , 1990
Lee2
29.03.2006
JabRef Output
29.03.2006
JabRef Output
LeeBoseHwang
Use of Steiner's problem in suboptimal routing in rectilinear metric
Lee, J.H.; Bose, N.K. & Hwang, F.K.
IEEE Transactions on Circuits and Systems , pp. 470-476 , 1976
Lee05a
Price-based Distributed Algorithm for Optimal Rate-Reliability Tradeoff
in Network Utility Maximization
Lee, J.W.; Chiang, M. & Calderbank, R.A.
preprint , 2005
lee98
Routing and Capacity Assignment Models and Algorithms for the Design
of Telecommunication Networks
K. Lee
KAIST, Daejeon, Korea , 1998
lee02
An Optimization Approach to Routing and Wavelength Assignment in
WDM All-Optical Mesh Networks without Wavelength Conversion
Lee, K.; Kang, K.; Lee, T. & Park, S.
ETRI Journal , Vol. 24 , pp. 131-141 , 2002
Lee:Park:Park:Lee
Economic spare capacity planning for DCS mesh-restorable networks
Lee, K.; Park, K.; Park, S. & Lee, H.
European Journal of Operational Research , Vol. 110 , pp. 63-75 , 1998
00kwa
Single- and multi-path logical topology design and traffic grooming
algorithm in IP over WDM networks
Lee, K. & Shayman, M.
ICCCN 2003 , pp. 59 - 64 , 2003
LeeKD
29.03.2006
JabRef Output
29.03.2006
JabRef Output
System
Lee, S.; Ho, H. & Mai, W.
The Journal of Supercomputing , Vol. 28 , pp. 27-41 , 2004
LeeHoMai04
An Efficient Scheduling Algorithm for Information Delivery on VoD
System
Lee, S.; Ho, H. & Mai, W.
The Journal of Supercomputing , Vol. 28 , pp. 27-41 , 2004
Lee05b
The impact of partnership attributes on EDI implementation success
Lee, S. & Lim, G.G.
Information & Management , Vol. 42 , pp. 503-516 , 2005
lee00
Optimal Routing and Wavelength Assignment in WDM Ring Networks
Lee, T.; Lee, K. & Park, S.
IEEE Journal on Selected Areas in Communications , Vol. 18 , pp. 2146-2154 , 2000
Lee:Lee:Park
Optimal routing and wavelength assignment in WDM ring networks
Lee, T.; Lee, K. & Park, S.
IEEE Journal on Selected Areas in Communications , Vol. 18 , pp. 2146-2154 , 2000
Lee:Park
An integer programming approach to the time slot assignment problem in
SS/TDMA systems with intersatellite links
Lee, T. & Park, S.
European Journal of Operational Research , Vol. 135 , pp. 57-66 , 2001
ylee1
A branch and cut algorithm for a Steiner tree-star problem
Lee, Y.; Chiu, S.Y. & Ryan, J.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
LeShHaKi00
A Branch-and-Cut Algorithm for Solving an Intraring Synchronous Optical
Network Design Problem
Lee, Y.; Sherali, H.; Han, J. & Kim, S.
Networks , Vol. 35 , pp. 223-232 , 2000
LeeAtiquzzaman05
Least cost heuristic for the delay-constrained capacitated minimum
spanning tree problem
Lee, Y. & Atiquzzaman, M.
Computer Communications , pp. 1-9 , 2005
LeHu02
Methods and Algorithms for Radio Channel Assignment
Leese, R. & Hurley, S.
Oxford University Press , 2002
Lehmann-etal-2005
The Winner Determination Problem
Lehmann, D.; Mller, R. & Sandholm, T.
2005
Lehmann-etal-2003
Combinatorial auctions with decreasing marginal utilities
Lehmann, D.; Lehmann, B. & Nisan, N.
Games and Economic Behavior , 2003
Lehmann-etal-2002
Truth revelation in approximately efficient combinatorial auctions
Lehmann, D. & Shoham, Y.
Journal of the ACM , Vol. 49(5) , pp. 577-602 , 2002
leimpstt95
Fast approximation algorithms for multicommodity flow problems
Leighton, F.T.; Makedon, F.; Plotkin, S.; Stein, C.; Tardos, E. & Tragoudas,
29.03.2006
JabRef Output
S.
Journal of Computer and System Sciences , Vol. 50 , pp. 228-243 , 1995
leir88
An approximate max-flow-min-cut theorem for uniform multicommodity
flow problems with application to approximation algorithms
Leighton, F.T. & Rao, S.
Proc. 29th Ann. IEEE Symp. on Foundations of Computer Science , 1988
leiner:97
The Past and Future History of the Internet
Leiner, B.M.; Cerf, V.G.; Clark, D.D.; Kahn, R.E.; Kleinrock, L.; Lynch,
D.C.; Postel, J.; Roberts, L.G. & Wolff, S.S.
Communications of the ACM , Vol. 40 , pp. 102-108 , 1997
Lema2001
Lagrangian relaxation
Lemarchal, C.
pp. 115-160 , 2001
lemarechal6
Lagrangian relaxation
url
Lemarchal, C.
2001
Lemar
Nondifferentiable Optimization
Lemarchal, C.
pp. 529-572 , 1989
lemarechal2
New variants of bundle methods
Lemarchal, C.; Nemirovskii, A. & Nesterov, Y.
Mathematical Programming , Vol. 69 , pp. 111-147 , 1995
29.03.2006
JabRef Output
lemarechal4
Semidefinite relaxations and Lagrangian duality with application
to combinatorial optimization
url
29.03.2006
JabRef Output
Lenstra, H.W.
Mathematics of Operations Research , pp. 538-548 , 1983
LST87
Approximation algorithms for scheduling unrelated parallel machines
Lenstra, J.; Shmoys, D. & Tardos, E.
Proc. 28th IEEE FOCS , 1987
leo00
Algorithms for the Logical Topology Design in WDM All-Optical Networks
Leonardi, E.; Mellia, M. & Marsan, M.
Optical Networks Magazine , Vol. 1 , pp. 35-46 , 2000
letchford1
Separating a superclass of combs inequalities in planar graphs
Letchford, A.
Mathematics of Operations Research , Vol. 25 , pp. 443-454 , 2000
letchford3
Totally tight Chvtal-Gomory cuts
url
Letchford, A.N.
Operations Research Letters , Vol. 30 , pp. 71-73 , 2002
letchford2
Multistars, partial multistars, and the capacitated vehicle routing problem
Letchford, A.N.; Eglese, R.W. & Lysgaard, J.
Mathematical Programming , Vol. 94 , pp. 21-40 , 2002
letchford4
Strengthening Chvtal-Gomory cuts and Gomory fractional cuts
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Leurent, F.
Proceedings of the Euro Working Group on Urban Traffic and Transportation , 1993
Lev73
A column generation algorithm for optimal traffic assignment
Leventhal, T.; Nemhauser, G. & Trotter~Jr., L.
Transportation Science , Vol. 7 , pp. 168-176 , 1973
LeviErsoy1994
Discrete link capacity assignment in prioritized computer networks: Two
approaches
Levi, A. & Ersoy, C.
Proceedings of the Ninth International Symposium on Computer and Information
Sciences , pp. 408-415 , 1994
Levin04
A better approximation algorithm for the budget prize collecting tree
problem
Levin, A.
Operations Research Letters , Vol. 32 , pp. 316-319 , 2004
LG98
A Comparison of Reliable Multicast Protocols
Levine, B. & Garcia-Luna-Aceves, J.
Multimedia Systems , Vol. 6 , pp. 334-348 , 1998
Levis:Wang:Yamamura:Reilly:Gonsalvez
The role of service areas in the optimization of FSS orbital and frequency
assignments
Levis, C.; Wang, C.; Yamamura, Y.; Reilly, C. & Gonsalvez, D.
IEEE Transactions on Electromagnetic Compatibility , Vol. 30 , pp. 371-379 , 1988
Lev66
Constrained minimization methods
Levitin, E. & Polyak, B.
29.03.2006
JabRef Output
USSR Computational Mathematics and Mathematical Physics , Vol. 6 , pp. 1-50 , 1966
Levy98
Stochastic Dominance: Investment Decision Making Under Uncertainty
Levy, H.
Kluwer Academic Publishers , 1998
lewandowski96experiments
Experiments with parallel graph coloring heuristics and applications of
graph coloring
Lewandowski, G. & Condon, A.
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge,
1993 , Vol. 26 , pp. 309-334 , 1996
adlewis1
Configuration controllability of simple mechanical control systems
Lewis, A.D. & Murray, R.M.
SIAM Review , Vol. 41(3) , pp. 555-574 , 1999
lewis4
Active sets, nonsmoothness, and sensitivity
Lewis, A.S.
SIAM Journal on Optimization , Vol. 13 , pp. 702-725 , 2003
lewis5
The mathematics of eigenvalue optimization
Lewis, A.S.
Mathematical Programming , Vol. 97 , pp. 155-176 , 2003
lewis3
Ill-conditioned convex processes and conic linear systems
Lewis, A.S.
Mathematics of Operations Research , Vol. 24(4) , pp. 829-834 , 2000
lewis2
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
url
Leyffer, S.
2002
leyffer1
Integrating SQP and branch-and-bound for mixed integer
nonlinear programming
url
Leyffer, S.
Computational Optimization and Applications , Vol. 18 , pp. 295-309 , 2001
Leyton-Brown-Shoham-2005
A Test-Suite for Combinatorial Auctions
Leyton-Brown, K. & Shoham, Y.
2005
LiCheYin00a
Server replication and its placement for reliable
multicast
Li, B.; Chen, F. & Yin, L.
Proceedings of the IEEE ICCCN-00 , pp. 396-401 , 2000
LMS92
The point-to-point delivery and connection problems: Complexity and
algorithms
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
lin_c4
A dual affine scaling based algorithm for solving linear semi-infinite
programming problems
Lin, C.; Fang, S. & Wu, S.
pp. 217-234 , 1994
lin_c3
Newton's method for large bound-constrained optimization
problems
url
url
url
url
29.03.2006
JabRef Output
LinXue02
On the terminal Steiner tree problem
Lin, G. & Xue, G.
Information Processing Letters , Vol. 84 , pp. 102-107 , 2002
LinDowWang03
A Distributed Virtual Backbone Development Scheme for Ad-Hoc Wireless
Networks
Lin, J.; Dow, C. & Wang, S.
Wireless Personal Communications , Vol. 27 , pp. 215-233 , 2003
Lin1
Computer solutions to the traveling salesman problem
Lin, S.
Bell System Technical Journal , Vol. 44(10) , pp. 2245-2269 , 1965
LinKer
An effective heuristic for the traveling salesman problem
Lin, S. & Kernighan, B.W.
Operations Research , Vol. 21 , pp. 498-516 , 1973
Lin:Kernighan
An Effective Heuristic Algorithm for the Traveling Salesman Problem
Lin, S. & Kernighan, B.
Operations Research , Vol. 21 , pp. 498-516 , 1973
linderoth3
Decomposition Algorithms for Stochastic Programming on a
computational grid
url
url
29.03.2006
JabRef Output
Linderoth, J.T.
2004
linderoth2
A parallel, linear programming-based heuristic for large-scale set
partitioning problems
Linderoth, J.T.; Lee, E.K. & Savelsbergh, M.W.P.
INFORMS Journal on Computing , Vol. 13 , pp. 191-209 , 2001
linderoth1
A computational study of strategies for mixed integer programming
Linderoth, J.T. & Savelsbergh, M.W.P.
INFORMS Journal on Computing , Vol. 11 , pp. 173-187 , 1999
linderoth4
The Empirical Behavior of Sampling Methods for Stochastic
Programming
url
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
lissarvia2
Mid-range planning of survivable telecommunications networks: joint
optimal synthesis of base and spare network capacities
Lisser, A.; Sarkissian, R. & Vial, J.
1998
gliu1
Design Issues in Algorithms for Large Scale Nonlinear
Programming
url
G. Liu
IEMS Department, Northwestern University , 1999
liutob04
A Novel Efficient Technique for Traffic Grooming in WDM SONET with
Multiple Line Speeds
Liu, H. & Tobagi, F.
ICC '04 , 2004
liu3
The evolution of the minimum degree ordering algorithm
Liu, J.
SIAM Review , Vol. 31 , pp. 1-19 , 1989
liu2
The role of elimination trees in sparse factorization
Liu, J.W.H.
SIAM Journal on Matrix Analysis and Applications , Vol. 11 , pp. 134-172 , 1990
liu1
On finding supernodes for sparse matrix computations
Liu, J.W.H.; Ng, E.G. & Peyton, B.W.
SIAM Journal on Matrix Analysis and Applications , Vol. 14 , pp. 242-252 , 1993
LiuParRajRes00a
A GRASP for frequency assignment in mobile radio networks
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
lobo1
Applications of second-order cone programming
url
29.03.2006
JabRef Output
2001
Lorie:Savage
Three Problems in Capital Rationing
Lorie, J. & Savage, L.
J. Business , pp. 229-239 , 1955
LotarevSuprunUzdemir04
Local Optimization in the Steiner Problem on the Euclidean Plane
Lotarev, D.; Suprun, A. & Uzdemir, A.
Automation and Remote Control , Vol. 65 , pp. 1089-1098 , 2004
lougeeheimer1
A note on coefficient adjustment using SOS constraints
Lougee-Heimer, R.
Operations Research , Vol. 49 , pp. 175-177 , 2001
LouSer98a
Adaptive approach heuristics for the generalized
assignment problem
Loureno, H.R. & Serra, D.
1998
LouPaiPor98a
Metaheuristics for the bus-driver scheduling problem
1998
LouPaiPor01a
Multiobjective metaheuristics for the bus-driver
url
scheduling problem
29.03.2006
JabRef Output
Lovasz75
Three Short Proofs in Graph Theory
Lovsz, L.
J. Combin. Th. Ser. B , Vol. 19 , pp. 111-113 , 1975
lovasz4
Hit-and-run mixes fast
Lovsz, L.
Mathematical Programming , Vol. 86(3) , pp. 443-461 , 1999
lovasz2
On the Shannon capacity of a graph
Lovsz, L.
IEEE Transactions on Information Theory , Vol. 25 , pp. 1-7 , 1979
LovPlm
Matching Theory
Lovsz, L. & Plummer, M.D.
Akadmiai Kiad , 1986
lovasz3
Cones of matrices and set-functions and 0-1 optimization
Lovsz, L. & Schrijver, A.
SIAM Journal on Optimization , Vol. 1 , pp. 166-190 , 1991
LoveWesolowskyKraemer
A multifacility minimax location method for Euclidean distances
Love, R.F.; Wesolowsky, G.O. & Kraemer, S.A.
International Journal of Production Research , Vol. 11 , pp. 37-45 , 1973
LoSc90
The generalized basis reduction algorithm
Lovsz, L. & Scarf, H.
29.03.2006
JabRef Output
1990
Low98
Loop-free multicast routing with end-to-end delay constraint
Low, C.
Computer Communications , Vol. 22 , pp. 181-192 , 1998
Low03
A Duality Model of TCP and Queue Management Algorithm
Low, S.H.
IEEE/ACM Transactions on Networking , Vol. 11 , pp. 525-536 , 2003
Low02
Understanding TCP Vegas: Theory and Practice
Low, S.H.; Peterson, L. & Wang, L.
Journal of ACM , Vol. 49 , pp. 207-235 , 2002
Low93
A New Approach to Service Provisioning in ATM Networks
Low, S.H. & Varaiya, P.P.
IEEE/ACM Transactions on Networking , Vol. 1 , pp. 547-553 , 1993
00low
An optical transport platform
Lowe, E. & Hawker, I.
IEE Colloquium on WDM Technology and Applications (Digest No. 1997/036) , pp. 7/1
- 7/5 , 1997
lowe.private
Lowe, T.
1993
LuRuan00
Polynomial Time Approximation Scheme for the Rectilinear Steiner
Arborescence Problem
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
LucenaBeasley
A branch and cut algorithm for the Steiner problem in graphs
Lucena, A. & Beasley, J.
Networks , Vol. 31 , pp. 39-59 , 1998
LuBe91
A Cutting Planes Approach to the Steiner Problem in Graphs
Lucena, A. & Beasley, J.
1991
LucRes04
Strong lower bounds for the prize collecting Steiner problem in graphs
Lucena, A. & Resende, M.G.C.
Discrete Applied Mathematics , Vol. 141 , pp. 277-294 , 2004
lucidi1
Objective-Derivative-Free Methods for Constrained Optimization
url
url
Luenberger, D.G.
29.03.2006
JabRef Output
luksan1
A bundle-Newton method for nonsmooth unconstrained minimization
Luksan, L. & Vlcek, J.
Mathematical Programming , Vol. 83 , pp. 373-391 , 1998
LunRatnakarKoetterMedardAhmedLee05
Achieving Minimum-Cost Multicast: A Decentralized Approach Based on
Network Coding
Lun, D.; Ratnakar, N.; Koetter, R.; Medard, M.; Ahmed, E. & Lee, H.
2004
Lu95
Sistemas de Apoio Dec iso
29.03.2006
JabRef Output
Luna, H.P.L.
pp. 83-100 , 1995
Lu88
Modelos para Levantamento e Previso de Trfego Telefnico
Luna, H.P.L.
Pesquisa Operacional , Vol. 8 , pp. 34-46 , 1988
Lu84
A Survey on Informational Decentralization and Mathematical
Programming Decomposition
Luna, H.P.L.
pp. 249-270 , 1984
Lu79a
Economical Interpretation of Benders Decomposition Technique Applied
to Location Problems
Luna, H.P.L.
pp. 367-372 , 1979
Lu79b
Note on Price-unicity in Economic Equilibrium Models
Luna, H.P.L.
Socio-Economic Planning Sciences , Vol. 13 , pp. 223-225 , 1979
Lu86
Um Modelo de Controle timo de Abastecimento em Plano de
Estabilizao Econmica
Luna, H.
SBA: Controle e Automao , Vol. 1 , pp. 72-81 , 1986
LuMa00
Bounds for Global Optimization of Capacity Expansion and Flow
Assignment Problems
Luna, H. & Mahey, P.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Luo:Ansari
Restoration with wavelength conversion in WDM networks
Luo, Y. & Ansari, N.
Electronics Letters , Vol. 38 , pp. 900-901 , 2002
luo17
Applications of convex optimization in signal processing and digital
communication
Luo, Z.
Mathematical Programming , Vol. 97 , pp. 177-207 , 2003
luo15
New error bounds and their applications to convergence analysis of
iterative algorithms
Luo, Z.
Mathematical Programming , Vol. 88 , pp. 341-355 , 2000
luo2
Analysis of a cutting plane method that uses weighted analytic center and
multiple cuts
Luo, Z.
SIAM Journal on Optimization , Vol. 7 , pp. 697-716 , 1997
luo16
On blind source separation using mutual information criterion
Luo, Z. & Lu, J.
Mathematical Programming , Vol. 97 , pp. 587-603 , 2003
luo14
Preface: Error bounds in mathematical programming
Luo, Z. & Pang, J.
Mathematical Programming , Vol. 88 , pp. 221-222 , 2000
luo7
url
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
1997
Luss1982
Operations research and capacity expansion problems: A survey
Luss, H.
Operations Research , Vol. 30 , pp. 907-947 , 1982
LussVakhutinsky2001
A resource allocation approach for the generation of service-dependent
demand matrices for communications networks
Luss, H. & Vakhutinsky, A.
Telecommunications Systems , Vol. 17 , pp. 411-433 , 2001
Lustig:Marsten:Shanno
On Implementing Mehrotra's Predictor-Corrector Interior Point Method
for Linear Programming
Lustig, I.; Marsten, R. & Shanno, D.
SIAM Journal on Optimization , Vol. 2 , pp. 435-449 , 1992
Lus1
Feasibility issues in a primal-dual interior point method for linear
programming
Lustig, I.J.
Mathematical Programming , Vol. 49(2) , pp. 145-162 , 1990/1991
Lus3
The influence of computer language on computational comparisons: An
example from network optimization
Lustig, I.J.
ORSA Journal on Computing , Vol. 2(2) , pp. 152-161 , 1990
Lus2
An analysis of an available set of linear programming test problems
Lustig, I.J.
Computers and Operations Research , Vol. 16 , pp. 173-184 , 1989
29.03.2006
JabRef Output
LMS6
Interior Point Methods for Linear Programming: Computational State of
the Art
Lustig, I.J.; Marsten, R.E. & Shanno, D.F.
ORSA Journal on Computing , Vol. 6(1) , pp. 1-14 , 1994
LMS7
The last word on Interior Point Methods for Linear Programming --- for
now
Lustig, I.J.; Marsten, R.E. & Shanno, D.F.
ORSA Journal on Computing , Vol. 6(1) , pp. 1-14 , 1994
LMS2690
On implementing Mehrotra's predictor-corrector interior point method
for linear programming
Lustig, I.J.; Marsten, R.E. & Shanno, D.F.
SIAM Journal on Optimization , Vol. 2 , pp. 435-449 , 1992
LMS9210
Computational Experience with a Globally Convergent Primal-Dual
Predictor-Corrector Algorithm for Linear Programming
Lustig, I.J.; Marsten, R.E. & Shanno, D.F.
1992
LMS8917
Computational experience with a primal-dual interior point method for
linear programming
Lustig, I.J.; Marsten, R.E. & Shanno, D.F.
Linear Algebra and its Applications , Vol. 152 , pp. 191-222 , 1991
lustig9
Program does not equal program: constraint programming and its
relationship to mathematical programming
Lustig, I.J. & Puget, J.
Interfaces , Vol. 31 , pp. 29-53 , 2001
29.03.2006
JabRef Output
lustig8
Gigaflops in linear programming
Lustig, I.J. & Rothberg, E.
1995
lyle
Local minima of the trust region problem
Lyle, S. & Szularz, M.
Journal of Optimization Theory and Applications , Vol. 80 , pp. 117-134 , 1994
SchFis04
A taxonomy of autonomy in multiagent organization
M., S. & K., F.
Lecture Notes in Computer Science , Vol. 2969 , pp. 68-82 , 2004
F81
The Lagrangian relaxation method for solving integer programming
problems
M.L.~Fisher
Management Science , Vol. 27 , pp. 1-18 , 1981
HWC74
Validation of subgradient optimization
M.~Held; P.~Wolfe & H.P.~Crowder
Mathematical Programming , Vol. 6 , pp. 62-88 , 1974
HFK98
A Lagrangian relaxation approach to the edge-weighted clique problem
M.~Hunting; U.~Faigle & W.~Kern
European Journal of Operational Research , Vol. 131 , pp. 119-131 , 2001
PR1991
A branch-and-cut algorithm for the resolution of large-scale symmetric
traveling salesman problems
29.03.2006
JabRef Output
url
Mszros, C.
Operations Research Letters , Vol. 25 , pp. 39-45 , 1999
meszaros8
The BPMPD interior solver for convex quadratic problems
Mszros, C.
Optimization Methods and Software , Vol. 11 , pp. 431-449 , 1999
meszaros5
On a property of the Cholesky factorization and its consequences in
interior point methods
url
Mszros, C.
1998
29.03.2006
JabRef Output
meszaros6
The separable and non-separable formulations of convex quadratic
problems in interior point methods
url
Mszros, C.
1998
meszaros7
On the sparsity issues of interior point methods for quadratic
programming
url
Mszros, C.
1998
meszaros9
Addendum to ``Presolve analysis of linear programs prior to applying an
interior point method''
Mszros, C. & Gondzio, J.
INFORMS Journal on Computing , Vol. 13 , pp. 169-170 , 2001
MA
Quality-of-Service Routing in Integrated Services Networks
Q. Ma
Computer Science Department, Carnegie Mellon University , 1998
maaren1
Inverse barriers and CES-functions in linear programming
van Maaren, H. & Terlaky, T.
Operations Research Letters , Vol. 20 , pp. 15-20 , 1997
maatman1
Modeling farmers' repsonse to uncertain rainfall in Burkina Faso: a
stochastic programming approach
Maatman, A.; Schweigman, C.; Ruijs, A. & van der Vleck, M.H.
Operations Research , Vol. 50 , pp. 399-414 , 2002
Mabert03
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Maculan87
The Steiner Problem in Graphs
Maculan, N.
Annals of Discrete Mathematics , Vol. 31 , pp. 185-212 , 1987
Ma86
A New Linear Programming Formulation for the Shortest $s$-directed
Spanning Tree Problem
Maculan, N.
Journal of Combinatorics, Information & Systems Sciences , Vol. 11 , pp. 53-56 , 1986
MaArNg88
Le Problme de Steiner sur un Graphe Orient: Formulations et
Relaxations
Maculan, N.; Arpin, D. & Nguyen, S.
Matemtica Aplicada e Computacional , Vol. 7 , pp. 109-118 , 1988
MaCaLo84
Relaxaco Lagrangeana em Programaco Inteira
Maculan, N.; Campello, R. & Lopes, L.
1984
Maculan:DeMendoncaPassini:DeMouraBrito:Loiseau
Column-generation in integer linear programming
Maculan, N.; Passini, M.D.M.; Brito, J.d.M. & Loiseau, I.
RAIRO-Operations Research , Vol. 37 , pp. 67-83 , 2003
MaculanEtAl03
Integer linear models with a polynomial number of variables and
constraints for some classical combinatorial optimization problems
Maculan, N.; Plateau, G. & Lisser, A.
Pesquisa Operacional , Vol. 23 , pp. 161-168 , 2003
Maal91
An Approach for the Steiner Problem in Directed Graphs
29.03.2006
JabRef Output
29.03.2006
JabRef Output
magnanti1
Facets and reformulations for solving production planning with
changeover costs
Magnanti, T.L. & Sastry, T.
Operations Research , Vol. 50 , pp. 708-719 , 2002
Magnanti:Mirchandani
Shortest paths, single origin-destination network design, and associated
polyhedra
Magnanti, T. & Mirchandani, P.
Networks , Vol. 23 , pp. 103-121 , 1993
Magnanti:Mirchandani:Vachani
Modeling and solving the two-facility capacitated network loading
problem
Magnanti, T.; Mirchandani, P. & Vachani, R.
Operations Research , Vol. 43 , pp. 142-157 , 1995
Maal93
The Convex Hull of Two Core Capacitated Network Design Problems
Magnanti, T.; Mirchandani, P. & Vachani, R.
Mathematical Programming , Vol. 60 , pp. 233-250 , 1993
MaMiVa93
The Convex Hull of Two Core Capacitated Network Design Problems
Magnanti, T.; Mirchandani, P. & Vachani, R.
Mathematical Programming , Vol. 60 , pp. 233-250 , 1993
Maal86
Tailoring Benders Decomposition for Uncapacitated Network Design
Magnanti, T.; Mirchandani, P. & Wong, R.
Mathematical Programming Study , Vol. 26 , pp. 112-154 , 1986
MaMiWo86
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Ma92
A discrete equal-capacity p-median problem
Marathe, V.
Department of Industrial and Systems Engineering,
Virginia Polytechnic Institute and State University
, 1992
marazzi1
Feasibility Control in Nonlinear Optimization
url
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
Mart, R.
IIE Transactions , Vol. 33 , pp. 913-919 , 2001
MarEst01a
Incremental bipartite drawing problem
url
29.03.2006
JabRef Output
Wiley , 1990
marti1
Differentiation formulas for probability functions: The transformation
methods
Marti, K.
Mathematical Programming , Vol. 75 , pp. 201-220 , 1996
martin1
Integer programs with block structure
url
Martin, A.
1998
Martin1999
Large scale linear and integer optimization: A unified approach
Martin, R.K.
Kluwer Academic Publishers , 1999
Martin1987
Generating alternative mixed-integer programming models using variable
redefinition
Martin, R.K.
Operations Research , Vol. 35 , pp. 820-831 , 1987
martino1
Technological forecasting for decision making
Martino, J.
Elsevier Science Publishing Company , 1983
mar00
A new Implementation of Yen's Ranking Loopless Paths Algorithm
Martins, E. & Pascoal, M.
2000
Mar99a
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
Ma86b
Algoritmo Exato e Heuri sticas para o Problema de Loca-li-zaco
G.R. Mateus
COPPE/UFRJ , 1986
Maal96
Model, Algorithm and Interface for the Terminal Section Design System
Mateus, G.; Barbosa, L.H.R. & Luna, H.
pp. 129-139 , 1996
MaBo91
Dominance Criteria for the Capacitated Warehouse Location Problem
Mateus, G. & Bornstein, C.
Journal of the Operational Research Society , Vol. 42 , pp. 145-149 , 1991
MaCa92
O Problema de Localizaco No Capacitado: Modelos e Algoritmos
Mateus, G. & Carvalho, J.
Investigacin Operativa , Vol. 2 , pp. 297-317 , 1992
MaCoLu92
An Efficient Heuristic for the Exchange Location Problem
Mateus, G.; Costa, R. & Luna, H.
1992
MaCrLu94
Algorithm for Hierarchical Network Design
Mateus, G.; Cruz, F. & Luna, H.
Location Science , Vol. 2 , pp. 149-164 , 1994
MaFr00
Model and Heuristic for a Generalized Access Network Design Problem
Mateus, G. & Franqueira, R.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Mazur1999
Integer programming approaches to a multi-facility location problem
D. Mazur
Johns Hopkins University , 1999
MaMaSm03
Lagrangean based methods for solving large-scale cellular network design
problems
Mazzini, F.; Mateus, G. & Smith, J.
Wireless Networks , Vol. 9 , pp. 659-672 , 2003
Mazzini:Mateus:Smith
Lagrangean based methods for solving large-scale cellular networks design
problems
Mazzini, F.; Mateus, G. & Smith, J.
Wireless Networks , Vol. 9 , pp. 659-672 , 2003
McAfee87
Auctions and bidding
McAfee, R. & McMillan, J.
Journal of Economic Literature , Vol. 25 , pp. 699-738 , 1987
mcbride1
Progress made in solving the multicommodity flow problem
McBride, R.D.
SIAM Journal on Optimization , Vol. 8 , pp. 947-955 , 1998
Mc82
The gradient projection method under mild differentiability conditions
McCormick, C. & Tapia, R.
SIAM Journal on Control , Vol. 10 , pp. 93-98 , 1982
mccormick1
The superlinear convergence of a nonlinear primal-dual algorithm
29.03.2006
JabRef Output
McCormick, G.P.
1991
McC
The projective SUMT method for convex programming
McCormick, G.P.
Mathematics of Operations Research , Vol. 14(2) , pp. 203-223 , 1989
McCbook
Nonlinear Programming: Theory, Algorithms and Applications
McCormick, G.P.
John Wiley , 1983
McC(T)
Making sparse matrices sparser: computational results
McCormick, S.T.
Mathematical Programming , Vol. 49(1) , pp. 91-111 , 1990/1991
McCormick83
Optimal approximation of sparse Hessians and its equivalence to a graph
coloring problem
McCormick, S.T.
Mathematical Programming , Vol. 26 , pp. 153-171 , 1983
mccormick3
Easy and difficult objective functions for max cut
McCormick, S.T.; Rao, M.R. & Rinaldi, G.
Mathematical Programming , Vol. 94 , pp. 459-466 , 2002
McD
On the improvement per iteration in Karmarkar's algorithm for linear
programming
McDiarmid, C.
Mathematical Programming , Vol. 46(3) , pp. 299-320 , 1990
29.03.2006
JabRef Output
mcgarvey1
A global optimal approach to facility location in the presence of forbidden
regions
McGarvey, R.G. & Cavalier, T.M.
Computers and Industrial Engineering , Vol. 45 , pp. 1-15 , 2003
mcgeoch1
Towards an experimental method for algorithm simulation
McGeoch, C.C.
INFORMS Journal of Computing , Vol. 8 , pp. 1-15 , 1996
McSh77
Network design: an algorithm for the access facility location problem
McGregor, P. & Shen, D.
IEEE Transactions on Communications , Vol. 25 , pp. 61-73 , 1977
mckinnon1
Convergence of the Nelder-Mead simplex method to a nonstationary point
McKinnon, K.I.M.
SIAM Journal on Optimization , Vol. 9 , pp. 148-158 , 1999
Lee95
An introduction to Internet economics
McKnight, L.W. & Bailey, J.P.
1995
McQUILLAN
The New Routing Algorithm for the ARPANET
McQuillan, J.; Richter, I. & Rosen, E.
IEEE Transactions on Communications , Vol. 28 , pp. 711-719 , 1980
mcshane4
On the superlinear convergence of an $O(n^3L)$ interior point algorithm
for monotone LCP
29.03.2006
JabRef Output
McShane, K.A.
SIAM Journal on Optimization , Vol. 6 , pp. 978-993 , 1996
mcshane3
Superlinearly Convergent $O(nL)$-Iteration Interior-Point Algorithms For
Linear Programming And The Monotone Linear Complementarity
Problem
McShane, K.A.
SIAM Journal on Optimization , Vol. 4 , pp. 247-261 , 1994
MMS
An implementation of a primal-dual interior point method for linear
programming
McShane, K.A.; Monma, C.L. & Shanno, D.
ORSA Journal on Computing , Vol. 1(2) , pp. 70-83 , 1989
MedResVei01a
Piecewise linear time series estimation with GRASP
url
url
analysis
Medeiros, M.; Veiga, A. & Resende, M.
Journal of Computational and Graphical Statistics , Vol. 11 , pp. 236-258 , 2002
MedVeiRes99a
A combinatorial approach to piecewise linear time series analysis
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
Megiddo, N.
ORSA Journal on Computing , Vol. 3 , pp. 63-65 , 1991
Meg1
Pathways to the optimal set in linear programming
Megiddo, N.
pp. 131-158 , 1989
MeSh1
Boundary behaviour of interior point algorithms in linear programming
Megiddo, N. & Shub, M.
Mathematics of Operations Research , Vol. 14(1) , pp. 97-146 , 1989
Mehlhorn
A faster approximation algorithm for the Steiner problem in graphs
Mehlhorn, K.
Information Processing Letters , Vol. 27 , pp. 125-128 , 1988
meh92
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Meh1
On finding a vertex solution using interior point methods
Mehrotra, S.
Linear Algebra and its Applications , Vol. 152 , pp. 233-254 , 1991
MehSun8811
On computing the center of a convex quadratically constrained set
Mehrotra, S. & Sun, J.
Mathematical Programming , Vol. 50(1) , pp. 81-89 , 1991
MehSun1
An algorithm for convex quadratic programming that requires $O(n^3L)$
arithmetic operations
Mehrotra, S. & Sun, J.
Mathematics of Operations Research , Vol. 15(2) , pp. 342-363 , 1990
MehSun8801
A method of analytic centers for quadratically constrained convex
quadratic programs
Mehrotra, S. & Sun, J.
1988
MehSun8808
An algorithm for solving smooth convex programs based on Newton's
method
Mehrotra, S. & Sun, J.
1988
mehrotra3
Conjugate Gradient Based Implementation of Interior Point Methods for
Network Flow Problems
Mehrotra, S. & Wang, J.
pp. 124-142 , 1996
Mei72
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
Melzak
On the problem of Steiner
Melzak, Z.A.
Canadian Mathematics Bulletin , Vol. 4 , pp. 143-149 , 1961
Mend85
Pricing Computer Services: Queuing Effects
Mendelson, H.
Communications of ACM , Vol. 28 , pp. 312-321 , 1985
mmm
Querying the World Wide Web
Mendelzon, A.; Mihaila, G. & Milo, T.
Journal of Digital Libraries , Vol. 1 , pp. 68-88 , 1997
mw
Finding regular simple paths in graph databases
Mendelzon, A. & Wood, P.
SIAM J. Computing , Vol. 24 , pp. 1235-1258 , 1995
MOP04b
A Branch-and-Cut to the Point-to-Point Connection Problem on
Multicast Networks
29.03.2006
JabRef Output
MenPLS98
Third Generation Mobile Systems Planning Issues
Menolascino, R.; Pizarroso, M.; Lepschy, C. & Salas, B.
Proceedings of IEEE VTC 98 , pp. 830-834 , 1998
Merchant:Sengupta
Assignment of cells to switches in PCS networks
Merchant, A. & Sengupta, B.
IEEE/ACM Transactions on Networking , Vol. 3 , pp. 521-526 , 1995
dumerle3
An interior point algorithm for minimum sum-of-squares
clustering
url
29.03.2006
JabRef Output
url
Meszaros, C.
Optimization Methods and Software , Vol. 9 , pp. 121-139 , 1998
meszaros1
The ``inexact'' minimum local fill-in ordering algorithm
Meszaros, C.
1995
meszaros2
The augmented system variant of IPMs in two--stage stochastic linear
programming computation
Meszaros, C.
1995
Me70
Spectrum management technique
Metzger, B.
1970
29.03.2006
JabRef Output
mey97
On Tuy's 1964 Cone Splitting Algorithm for Concave Minimization
Meyer, C.
1997
Mey74
Accelerated Frank-Wolfe algorithms
Meyer, G.
SIAM J. Control , Vol. 12 , pp. 655-663 , 1974
michelon1
Lagrangean decomposition for integer nonlinear programming with linear
constraints
Michelon, P. & Maculan, N.
Mathematical Programming , Vol. 52 , pp. 303-313 , 1991
middleton1
Critical slowing down in polynomial time algorithms
url
Middleton, A.A.
Physical Review Letters , Vol. 88 , 2002
mifflin1
Quasi-Newton bundle-type methods for nondifferentiable convex
optimization
Mifflin, R.; Sun, D. & Li, Q.
SIAM Journal on Optimization , Vol. 8 , pp. 583-603 , 1998
Mi04
Cyclic linearization and decomposition of team game models
Migdalas, A.
pp. 333-348 , 2004
Mi95
Bilevel programming in traffic planning: Models, methods and challenge
29.03.2006
JabRef Output
Migdalas, A.
Journal of Global Optimization , Vol. 7 , pp. 381-405 , 1995
Mi94
A regularization of the Frank-Wolfe method and unification of certain
nonlinear programming methods
Migdalas, A.
Mathematical Programming , Vol. 65 , pp. 331-345 , 1994
miguel2
An interior-point method for MPECs based on strictly feasible
relaxations
url
url
29.03.2006
JabRef Output
2001
mil78
Using Cutting Planes to Solve the Symmetric Traveling Salesman Problem
Miliotis, P.
Mathematical Programming , Vol. 15 , pp. 177-188 , 1978
miller2
A multi-item production planning model with setup times: algorithms,
reformulations, and polyhedral characterizations for a special case
Miller, A.J.; Nemhauser, G.L. & Savelsbergh, M.W.P.
Mathematical Programming , Vol. 95 , pp. 71-90 , 2003
miller1
On the polyhedral structure of a multi-item production planning model
with setup times
Miller, A.J.; Nemhauser, G.L. & Savelsbergh, M.W.P.
Mathematical Programming , Vol. 94 , pp. 375-405 , 2002
miller3
Tight MIP formulations for multi-item discrete lot-sizing problems
Miller, A.J. & Wolsey, L.A.
Operations Research , Vol. 51 , pp. 557-565 , 2003
Mi63
The Simplex Method for Local Separable Programming
Miller, C.
Recent Advances in Mathematical Programming , pp. 89-100 , 1963
MPPS05
The Sequential Sum Problem and Performance Bounds on the Greedy
Algorithm for the On-line Steiner Problem
Miller, Z.; Pritikin, D.; Perkel, M. & Sudborough, I.H.
Networks , Vol. 45 , pp. 143-164 , 2005
29.03.2006
JabRef Output
MillerPritikinPerkelSudborough05
The Sequential Sum Problem and Performance Bounds on the Greedy
Algorithm for the On-line Steiner Problem
Miller, Z.; Pritikin, D.; Perkel, M. & Sudborough, I.
Networks , 2005
Min:Tcha
On stacking bi-directional self-healing-rings on a conduit ring
Min, B. & Tcha, D.
Computers and Industrial Engineering , Vol. 45 , pp. 127-139 , 2003
Min04
A Reliable Virtual Backbone Scheme in Mobile Ad-Hoc Networks
Min, M.; Wang, F.; Du, D. & Pardalos, P.
Proceedings of the IEEE International Conference on Mobile Ad Hoc and Sensor
Systems , pp. 60-69 , 2004
mingozzi1
Dynamic programming strategies for the traveling salesman problem with
time window and precedence constraints
Mingozzi, A.; Bianco, L. & Ricciardelli, S.
Operations Research , Vol. 45 , pp. 365-377 , 1997
Mingzhou01
Supply chain coordination in electronic markets: and contracting
mechanisms
Mingzhou, J. & Wu, D.
2001
Minn00
Dynamic assignment of orthogonal variable spreading factor codes in WCDMA
Minn, T. & Siu, K.
IEEE Journal on Selected Areas in Communications , Vol. 18 , pp. 1429-1440 , 2000
MinS00
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
mirchandani1
Shortest distance and reliability of probabilistic networks
Mirchandani, P.
Computers and Operations Research , Vol. 3 , pp. 347-355 , 1976
MiFr90
Discrete Location Theory
Mirchandani, P. & Francis, R.
John Wiley & Sons , 1990
Vahab04
A simple polynomial time framework for reduced-path decomposition in
multi-path routing
Mirrokni, V.; Thottan, M.; Uzunalioglu, H. & Paul, S.
IEEE INFOCOM 2004, The Conference on Computer Communications , Vol. 23 , pp.
739-749 , 2004
Mi85
Lagrangian Relaxation for the Star-Star Concentrator Location Problem:
Approximation Algorithm and Bounds
Mirzaian, A.
Networks , Vol. 15 , pp. 1-20 , 1985
04mis
Next generation access systems: progress in operations and planning
capabilities
Misra, R. & McKee, S.
Discovering a New World of Communications , Vol. 4 , pp. 1869 - 1873 , 1992
MPR
Interior point methods for combinatorial optimization
Mitchell, J.; Pardalos, P. & Resende, M.
Vol. 1 , pp. 189-298 , 1998
JEM_logvolcuts
url
29.03.2006
JabRef Output
url
Mitchell, J.E.
Naval Research Logistics , Vol. 50 , pp. 683-701 , 2003
JEM_hao
Branch-and-cut algorithms for combinatorial optimization
problems
url
Mitchell, J.E.
pp. 65-77 , 2002
JEM_eoo_b_c
Branch-and-cut algorithms for integer programming
url
Mitchell, J.E.
2001
JEM_eoo_cut
Cutting plane algorithms for integer programming
url
Mitchell, J.E.
2001
JEM_kway
Branch-and-cut for the $k$-way equipartition problem
url
Mitchell, J.E.
2001
JEM_SDPbranch
Restarting after branching in the SDP approach to MAX-CUT and
similar combinatorial optimization problems
url
Mitchell, J.E.
29.03.2006
JabRef Output
url
Mitchell, J.E.
SIAM Journal on Optimization , Vol. 10 , pp. 1212-1227 , 2000
JEM_SOR97
An interior point cutting plane algorithm for Isingspin glass
problems
url
Mitchell, J.E.
Operations Research Proceedings, SOR 1997, Jena, Germany , pp. 114-119 , 1998
JEM216
Fixing variables and generating classical cutting planes when using an
interior point branch and cut method to solve integer programming
problems
Mitchell, J.E.
European J. Oper. Res , Vol. 97 , pp. 139-148 , 1997
JEM_SOR97old
An interior point cutting plane algorithm for Ising spin glass
problems
url
Mitchell, J.E.
1997
JEM214
Interior Point Algorithms for Integer Programming
Mitchell, J.E.
pp. 223-248 , 1996
JEM217
Interior Point Methods for Combinatorial Optimization
url
Mitchell, J.E.
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
JEMlord
Solving real-world linear ordering problems using a primal-dual interior
point cutting plane method
Mitchell, J.E. & Borchers, B.
Annals of Operations Research , Vol. 62 , pp. 253-276 , 1996
JEM204
A primal-dual interior point cutting plane method for the linear ordering
problem
Mitchell, J.E. & Borchers, B.
COAL Bulletin , Vol. 21 , pp. 13-18 , 1992
JEM_transcosts
Rebalancing an Investment Portfolio in the Presence of
Transaction Costs
url
url
url
url
29.03.2006
JabRef Output
url
MT2
A variant of Karmarkar's linear programming algorithm for problems with
some unrestricted variables
Mitchell, J.E. & Todd, M.J.
SIAM Journal on Matrix Analysis and Applications , Vol. 10(1) , pp. 30-38 , 1989
MT4
Solving combinatorial optimization problems using Karmarkar's
algorithm: Part~I: Theory
Mitchell, J.E. & Todd, M.J.
1989
MT5
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
1998
mittelmann3
An Independent Benchmarking of SDP and SOCP Solvers
url
Mittelmann, H.D.
Mathematical Programming , Vol. 95 , pp. 407-430 , 2003
MiNo92
An Insert/Delete Heuristic for the Traveling Salesman Subset-Tour
Problem with One Additional Constraint
Mittenthal, J. & Noon, C.
Journal of the Operational Research Society , Vol. 43 , pp. 277-283 , 1992
MiyaoSaito98
Optimal Design and Evaluation of Survivable WDM Transport Networks
Miyao, Y. & Saito, H.
IEEE Journal on Selected Areas in Communications , Vol. 16 , pp. 1190-1198 , 1998
mizuno11
A superlinearly convergent infeasible-interior-point algorithm for
geometrical LCPs without a strictly complementary condition
Mizuno, S.
Mathematics of Operations Research , Vol. 21 , pp. 382-400 , 1996
mizuno9
A predictor-corrector infeasible-interior-point algorithm for linear
programming
Mizuno, S.
Operations Research Letters , Vol. 16 , pp. 61-66 , 1994
mizuno2
A new polynomial time method for a linear complementarity problem
Mizuno, S.
Mathematical Programming , Vol. 56 , pp. 31-44 , 1992
29.03.2006
JabRef Output
Mizuno1
$O(n^L)$-iteration and $O(n^3L)$-operation potential reduction
algorithms for linear programming
Mizuno, S.
Linear Algebra and its Applications , Vol. 152 , pp. 155-168 , 1991
Mizuno_jorsj_90
An $O(n^3L)$ algorithm using a sequence for linear complementarity
problems
Mizuno, S.
Journal of the Operations Research Society of Japan , Vol. 33 , pp. 66-75 , 1990
mizuno10
Global and Polynomial-Time Convergence of an Infeasible-InteriorPoint Algorithm Using Inexact Computation
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
url
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
MoMo
Computational experience with a dual affine variant of Karmarkar's
method for linear programming
Monma, C.L. & Morton, A.J.
Operations Research Letters , Vol. 6(6) , pp. 261-267 , 1987
des90-1
Minimum-weight two-connected spanning networks
Monma, C.; Munson, B. & Pulleyblank, W.
Mathematical Programming , Vol. 46 , pp. 153-171 , 1990
MonmaSchrijverToddWei1990
Convex resource allocation problems on directed acyclic graphs: Duality,
complexity, special cases and extensions
Monma, C.; Schrijver, A.; Todd, M. & Wei, V.
Mathematics of Operations Research , Vol. 15 , pp. 736-748 , 1990
des89-1
Methods for designing communications networks with
certain two-connected survivability constraints
Monma, C. & Shallcross, D.
Operations Research , Vol. 37 , pp. 531-541 , 1989
Monma89
Methods for designing communications networks with certain twoconnected survivability constraints
Monma, C. & Shallcross, D.
Operations Research , Vol. 37 , pp. 531-41 , 1989
MoSh89
Methods for Designing Communications Networks with Certain TwoConnected Survivability Constraints
Monma, C. & Shallcross, D.
Operations Research , Vol. 37 , pp. 531-541 , 1989
29.03.2006
JabRef Output
MonmaSheng1986
Backbone Network Design and Performance Analysis: A methodology for
packet switching networks
Monma, C. & Sheng, D.
IEEE Journal on Selected Areas in Communications , Vol. SAC-4 , pp. 946-965 , 1986
Monnot01
The maximum f-depth spanning tree problem
Monnot, J.
Information Processing Letters , Vol. 80 , pp. 179-187 , 2001
monteiro20
First- and second-order methods for semidefinite programming
url
Monteiro, R.D.C.
Mathematical Programming , Vol. 97 , pp. 209-244 , 2003
monteiro11
Polynomial Convergence of Primal-Dual Algorithms for
url
Semidefinite Programming Based on Monteiro and Zhang Family of
Directions
Monteiro, R.D.C.
SIAM Journal on Optimization , Vol. 8 , pp. 797-812 , 1998
monteiro6b
Primal-Dual Path Following Algorithms for Semidefinite Programming
Monteiro, R.D.C.
SIAM Journal on Optimization , Vol. 7 , pp. 663-678 , 1997
monteiro7
On Two Interior-Point Mappings for Nonlinear Semidefinite
Complementarity Problems
url
Monteiro, R.D.C.
1996
MAd3
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
url
url
url
url
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
url
Mor, J.J.
2001
29.03.2006
JabRef Output
more1
Distance geometry optimization for protein structures
url
url
url
Morales, J.L.; Nocedal, J.; Waltz, R.; Liu, G. & Goux, J.P.
2001
MorettiEtAl01
Connection problems in mountains and monotonic allocation schemes
Moretti, S.; Norde, H.; Do, K. & Tijs, S.
2001
morin1
Complexity of gravitational method for linear programming
Morin, T.L.; Prabhu, N. & Zhang, Z.
1995
MoGr99
Current Approaches in the Design of Ring-Based Optical Networks
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
tour problem
Motta, L.; Ochi, L. & Martinhon, C.
Proceedings of MIC'2001 , pp. 387-391 , 2001
MotzkinStraus65
Maxima for graphs and a new proof of a theorem of Turn
Motzkin, T.S. & Straus, E.G.
Canad. J. Math. , Vol. 17 , pp. 533-540 , 1965
moy:98
OSPF: Anatomy of an Internet Routing Protocol
Moy, J.
Addison-Wesley , 1998
OSPF
OSPF Version 2
Moy, J.
RFC 2328 , 1998
rfc2328
OSPF Version 2
url
Moy, J.
1998
RCF1583
OSPF Version 2, RFC 1583 -- IETF Network Working Group
Moy, J.
1994
RCF1584
Multicast Extensions to OSPF, RFC 1584 -- IETF Network Working Group
Moy, J.
1994
29.03.2006
JabRef Output
M98
OSPF -- Anatomy of an Internet routing protocol
Moy, J.
Addison Wesley , 1998
MukBanSah03
Location Management and Routing in Mobile Wireless Networks
Mukherjee, A.; Bandyopadhyay, S. & Saha, D.
Artech House Mobile Communications Library , 2003
97muk
Optical Communication Networks
Mukherjee, B.
McGraw-Hill , 1997
Muk92a
WDM--based local lightwave networks part I: Single--hop systems
Mukherjee, B.
IEEE Network Magazine , Vol. 6 , pp. 12-27 , 1992
muk92mh
WDM-based local lightwave networks. II. Multi-hop systems
Mukherjee, B.
Networks , Vol. 6 , pp. 20-32 , 1992
muk92sh
WDM-based local lightwave networks. I. Single-hop systems
Mukherjee, B.
Networks , Vol. 6 , pp. 12-27 , 1992
muk96
Some Principles For Designing a Wide-Area WDM Optical Network
Mukherjee, B.; Banerjee, D.; Ramamurthy, S. & Mukherjee, A.
29.03.2006
JabRef Output
url
Mukherjee, S.
2003
Mulvey:Crowder
Cluster Analysis: An Application of Lagrangian Relaxation
Mulvey, J. & Crowder, H.
Management Science , Vol. 25 , pp. 329-340 , 1979
mulvey4
Introduction to financial optimization: Mathematical Programming
special issue
Mulvey, J.M.
Mathematical Programming , Vol. 89 , pp. 205-216 , 2001
mulvey2
Linking strategic and tactical planning systems for asset and liability
management
Mulvey, J.M.; Madsen, C. & Morin, F.
Annals of Operations Research , Vol. 84 , pp. 281-298 , 1998
mulvey6
Rebalancing strategies for long-term investors
url
29.03.2006
JabRef Output
Murakami96
Virtual path routing for survivable ATM networks
Murakami, K. & Kim, H.
IEEE-ACM transactions on Networking , Vol. 4 , pp. 22-39 , 1996
muramatsu5
A pivotting procedure for a class of second-order cone
programming
url
29.03.2006
JabRef Output
Muramatsu, M.
2003
muramatsu3
On Commutative Class of Search Directions for Linear
Programming over Symmetric Cones
url
Muramatsu, M.
2000
muramatsu1
Affine scaling algorithm fails for semidefinite programming
url
Muramatsu, M.
Mathematical Programming , Vol. 83 , pp. 393-406 , 1998
muramatsu4
A New Second-Order Cone Programming Relaxation for MAX-CUT
problems
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
murtagh3
MINOS 5.5 User's Guide
Murtagh, B.A. & Saunders, M.A.
Vol. 14 , 1978
mur02
WDM Optical Networks. Concepts, Design and Algorithms
Murthy, C. & Gurusamy, M.
Prentice Hall , 2002
MurGur02
WDM Optical Networks: Concepts, Design, and Algorithms
Murthy, C. & Gurusamy, M.
Prentice-Hall PTR , 2002
murty2
The gravitational method for linear programming
Murty, K.G.
OPSEARCH , Vol. 23 , pp. 206-214 , 1986
Mur
Linear Programming
Murty, K.G.
John Wiley , 1983
Myerson-1979
Incentive compatibility and the bargaining problem
Myerson, R.
Econometrica , Vol. 47 , pp. 61-74 , 1979
Myerson-1981
Optimal Auction Design
Myerson, R.B.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
2005
MuellerHannemannPeyer03
Approximation of Rectilinear Steiner Trees with Length Restrictions on
Obstacles
Mller-Hannemann, M. & Peyer, S.
pp. 207-218 , 2003
megiddo3
A Modified Layered-Step Interior-Point Algorithm for Linear
Programming
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
NagCruz
International Financial Networks with Intermediation: Modeling,
Analysis, and Computations
Nagurney, A. & Cruz, J.
Computational Management Science , Vol. 1 , pp. 31-58 , 2003
Nagurney05
Supply chain networks, electronic commerce and supply side and demand
side risk
Nagurney, A.; Cruz, J.; Dong, J. & Zhang, D.
European Journal of Operational Research , Vol. 164 , pp. 120-142 , 2005
NagCruzMat
Dynamics of Global Supply Chain Supernetworks
Nagurney, A.; Cruz, J. & Matsypura, D.
Mathematical and Computer Modelling , Vol. 37 , pp. 963-983 , 2003
NagDong3
Management of Knowledge Intensive Systems as Supernetworks:
Modeling, Analysis, Computations, and Applications
Nagurney, A. & Dong, J.
Mathematical and Computer Modelling , 2003
NagDong1
A Multiclass, Multicriteria Traffic Network Equilibrium Model with Elastic
Demand
Nagurney, A. & Dong, J.
Transportation Research B , Vol. 36 , pp. 445-469 , 2002
NagDong2
Supernetworks: Decision-Making for the Information Age
Nagurney, A. & Dong, J.
Edward Elgar Publishing , 2002
nagurney2
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
url
url
Nash, S.G.
Optimization Methods and Software , Vol. 14 , pp. 99-116 , 2000
nash4
A Multigrid Approach to Discretized Optimization Problems
url
Nash, S.G.
1999
nash5
SUMT (revisited)
Nash, S.G.
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
Nazareth, J.L.
Computatioanl Decision Support Systems (CDSS) , 1998
nazareth2
Deriving potential functions via a symmetry principle for nonlinear
equations
Nazareth, J.L.
1994
nazareth3
A concise introduction to interior methods for linear programming
Nazareth, J.L.
1994
Naz
Pricing criteria in linear programming
Nazareth, J.L.
pp. 105-130 , 1989
nazareth5
Gilding the lily: a variant of the Nelder-Mead algorithm
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
url
Nesterov, Y.E.
Kluwer Academic Publishers , 2003
nesterov10
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
url
url
url
29.03.2006
JabRef Output
url
Neuman1992
A system for priority routing and capacity assignment in packet switched
networks
Neuman, I.
Annals of Operations Research , Vol. 36 , pp. 225-246 , 1992
hnewton1
Constructing railroad blocking plans to minimize handling costs
Newton, H.N.; Barnhart, C. & Vance, P.H.
Transportation Science , Vol. 32(4) , pp. 330-345 , 1998
NgRaghavanThompson
A language for describing rectilinear Steiner tree configurations
Ng, A.; Raghavan, P. & Thompson, C.D.
Proceedings of the Twenty-third Design Automation Conference , pp. 574-580 , 1986
NgTri03a
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Nobili1
Facets and lifting procedures for the set covering polytope
Nobili, P. & Sassano, A.
Mathematical Programming , Vol. 45 , pp. 111-137 , 1989
nocedal2
On the Behavior of the Gradient Norm in the Steepest Descent
Method
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
Nunez, M.A.
Mathematical Programming , Vol. 91 , pp. 375-390 , 2002
nunez3
Condition-Measure Bounds on the Behavior of the Central
Trajectory of a Semi-Definite Program
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
dumerle1
On the Comparative Behavior of Kelley's Cutting Plane Method and
the Analytic Center Cutting Plane Method
url
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
OliGom99a
Two metaheuristics for channel allocation in mobile
telephony
Oliveira, C. & Gomes, F.
1999
Oliveira03
A Survey of Combinatorial Optimization Problems in Multicast Routing
Oliveira, C. & Pardalos, P.
Computers & Operations Research , Vol. 32 , pp. 1953-1981 , 2005
OP04d
Construction Algorithms and Approximation Bounds for the Streaming
Cache Placement Problems in Multicast Networks
Oliveira, C. & Pardalos, P.
Cybernetics and systems Analysis , Vol. 41 , 2005
OliveiraPardalos03
A Survey of Combinatorial Optimization Problems in Multicast Routing
Oliveira, C. & Pardalos, P.
2003
OPPR03
Streaming Cache Placement Problems: Complexity and Algorithms
Oliveira, C.; Pardalos, P.; Prokopyev, O. & Resende, M.
2003
proliveira1
Using analytic center and cutting planes methods for nonsmooth convex
programming
Oliveira, P.R. & Santos, M.A.d.
1999
29.03.2006
JabRef Output
olsen1
Multistage stochastic programming with recourse: the equivalent
deterministic problem
Olsen, P.
SIAM Journal on Control and Optimization , Vol. 14 , pp. 495-517 , 1976
olson1
A likelihood-MPEC approach to target classification
Olson, T.; Pang, J. & Priebe, C.
Mathematical Programming , Vol. 96 , pp. 1-31 , 2003
onak71
On feasibility conditions on multicommodity flows in networks
Onaga, K. & Kakusho, O.
IEEE Trans. Circuit Theory , Vol. CT-18 , pp. 425-429 , 1971
OommenRoberts2002
Discretized learning automata solutions to the capacity assignment
problem for prioritized networks
Oommen, B. & Roberts, T.
IEEE Transactions on Systems, Man and Cybernetics -- Part B: Cybernetics , Vol. 32 ,
pp. 821-831 , 2002
OommenRoberts2000
Continuous learning automata solutions to the capacity assignment
problem
Oommen, B. & Roberts, T.
IEEE Transactions on Computers , Vol. 49 , pp. 608-620 , 2000
oosten1
The facial structure of the clique partitioning polytope
url
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
optimization problems
Osborne, M.
2003
oskoorouchi2
The analytic center cutting plane method with semidefinite cuts
M. R. Oskoorouchi
Faculty of Management, McGill University , 2002
oskoorouchi4
A matrix generation approach for eigenvalue optimization
url
url
url
29.03.2006
JabRef Output
2000
OsmHasAbd02a
Linear programming based meta-heuristics for the weighted
url
29.03.2006
JabRef Output
url
Oustry, F.
Mathematical Programming , Vol. 89 , pp. 1-33 , 2000
oustry2
Semidefinite relaxations and Lagrangian duality with applications to
combinatorial optimization
Oustry, F. & Lemarechal, C.
1999
outrata1
On optimization problems with variational inequality constraints
Outrata, J.V.
SIAM Journal on Optimization , Vol. 4 , pp. 340-357 , 1994
outrata2
A numerical approach to optimization problems with variational
inequality constraints
Outrata, J.V. & Zowe, J.
Mathematical Programming , Vol. 68 , pp. 105-130 , 1995
Ovalle03
The effectiveness of using e-collaboration tools in the supply chain: An
assessment study with system dynamics
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
gra82-1
Odd minimum cut-sets and $b$-matchings
Padberg, M. & Rao, M.
Mathematics of Operations Research , Vol. 7 , pp. 67-80 , 1982
des85-1
Valid Linear Inequalities for Fixed Charge
Problems
Padberg, M.; Van Roy, T. & Wolsey, L.
Operations Research , Vol. 33 , pp. 842-861 , 1985
PaVaWo85
Valid linear inequalities for fixed charge problems
Padberg, M.; Roy, T.V. & Wolsey, L.
Operations Research , Vol. 33 , pp. 842-861 , 1985
Page91
A note on computing environments and network reliability
Page, L. & Perry, J.
Microelectronics and Reliability , Vol. 31 , pp. 185-6 , 1991
Pal84a
Shortest Path Methods: Complexity, Interrelations and
New Propositions
Pallottino, S.
Networks , Vol. 14 , pp. 257-267 , 1984
PalScu91a
Strongly polynomial Auction Algorithms for shortest path
Pallottino, S. & Scutell, M.
Ricerca Operativa , Vol. 21 , pp. 60-72 , 1991
29.03.2006
JabRef Output
PalScu98a
Shortest path algorithms in transportation models:classical and
innovative aspects
Pallottino, S. & Scutella, M.G.
pp. 245-281 , 1998
MLP99
A relax and cut algorithm for quadratic knapsack problem
Palmeira, M.d.M.; A.~Lucena & O.~Porto
1999
palmer1
Ground states for large samples of two-dimensional Ising spin glasses
Palmer, R.G. & Adler, J.
International Journal of Modern Physics C , Vol. 10 , pp. 667-675 , 1999
palubeckis1
A branch-and-bound approach using polyhedral results for a clustering
problem
Palubeckis, G.
INFORMS Journal on Computing , Vol. 9 , pp. 30-42 , 1997
PalTom02a
GRASP implementations for the unconstrained binary
url
29.03.2006
JabRef Output
pang1
Newton's method for $B$-differentiable equations
Pang, J.
Mathematics of Operations Research , Vol. 15(2) , pp. 311-331 , 1990
pang2
On the global minimization of the Value-at-Risk
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
solution of
sparse quadratic assignment problems using GRASP
Pardalos, P.; Pitsoulis, L. & Resende, M.
ACM Transactions on Mathematical Software , Vol. 23 , pp. 196-208 , 1997
ParPitRes96a
A parallel GRASP for MAX-SAT problems
url
url
29.03.2006
JabRef Output
Zero-One Programming
Pardalos, P. & Rodgers, G.
Computing , Vol. 45 , pp. 131-144 , 1990
parr86
Methods for Global Concave Minimization: A Bibliographic Survey
Pardalos, P.M. & Rosen, J.B.
SIAM Review , Vol. 28 , pp. 367-379 , 1986
par92
Dveloppement d'un algorithme exact pour la programmation non linaire
en variables 0-1 sans contraintes
Parenteau, P.
1992
PP97
Development of a Multi-user & Multimedia Game Engine Based on TCP/IP
Park, J. & Park, C.
Proceedings of IEEE Pacific Rim Conference on Communications Computers and
Signal Processing , pp. 101-104 , 1997
park1
An integer programming approach to the bandwidth packing problem
Park, K.; Kang, S. & Park, S.
Management Science , Vol. 42 , pp. 1277-1291 , 1996
Park:Kang:Park
An integer programming approach to the bandwidth packing problem
Park, K.; Kang, S. & Park, S.
Management Science , Vol. 42 , pp. 1277-1291 , 1996
Park:Lee:Park:Lee
Telecommunication node clustering with node compatibility and network
survivability requirements
29.03.2006
JabRef Output
29.03.2006
JabRef Output
parillo2
Semidefinite programming relaxations for semialgebraic problems
url
Parrilo, P.A.
Mathematical Programming , Vol. 96 , pp. 293-320 , 2003
parillo1
Structured semidefinite programs and semialgebraic geometry
methods in robustness and optimization
url
P. A. Parrilo
California Institute of Technology , 2000
parillo3
Minimizing Polynomial Functions
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
I: necessary and sufficient conditions for nice cones, and core separation
Pataki, G.
2003
pataki2
A Simple Derivation of a Facial Reduction Algorithm, and Extended
Dual Systems
url
Pataki, G.
2000
pataki9
The Geometry of Semidefinite Programming
Pataki, G.
pp. 29-65 , 2000
pataki7
The geometry of cone LP's
url
Pataki, G.
1999
pataki1
On the rank of extreme matrices in semidefinite programs and the
multiplicity of optimal eigenvalues
Pataki, G.
Mathematics of Operations Research , Vol. 23 , pp. 339-358 , 1998
pataki6
Cone-LP's and Semidefinite Programs: Geometry and a Simplex-type
Method
Pataki, G.
Proceedings of the Fifth IPCO Conference , Vol. 1084 , 1996
pataki5
Computing with lift-and-project: A user's guide
url
29.03.2006
JabRef Output
url
url
Patrcio, J.; Portugal, L.F.; Resende, M.G.C.; Veiga, G. & Jdice, J.J.
2004
Patte2
Parallel cost approximation algorithms for differentiable optimization
Patriksson, M.
pp. 295-341 , 1997
Pa94
The Traffic Assignment Problem: Models and Methods
Patriksson, M.
Topics in Transportation, VSP , 1994
29.03.2006
JabRef Output
Patte
The traffic assignment problem: Models and methods
Patriksson, M.
VSP , 1994
05pam
A Lagrangian-based heuristic for traffic grooming in WDM optical
networks
Patrocinio, Z. & Mateus, G.
Proceedings IEEE Global Telecommunications Conference (GLOBECOM 2003) , Vol.
5 , pp. 2767 - 2771 , 2003
Patteli02
A domain area report on business models, the eBusiness center
Patteli, A.
2002
PattersonRolland2002
Hybrid fiber coaxial network design
Patterson, R.A. & Rolland, E.
Operations Research , Vol. 50 , pp. 538-551 , 2002
PatRol02
Hybrid Fiber Coaxial Network Design
Patterson, R. & Rolland, E.
Operations Research , Vol. 50 , pp. 538-551 , 2002
PR02
Survey of Multicast Routing Algorithms and Protocols
Paul, P. & Raghavan, S.
Proceedings of the Fifteenth International Conference on Computer Communication
(ICCC 2002) , pp. 902-926 , 2002
PaullUnger59
Minimizing the number of states in incompletely specified sequential
29.03.2006
JabRef Output
switching functions
Paull, M.C. & Unger, S.H.
IRE Transactions Electr. Comput. , Vol. EC-8 , pp. 356-367 , 1959
PF95
Wide-Area Traffic: The Failure of Poisson Modeling
Paxson, V. & Floyd, S.
IEEE/ACM Transactions on Networking , Vol. 3 , pp. 226-244 , 1995
Pearl
Heuristics: Intelligent Search Techniques for Computer Problem Solving
Pearl, J.
Addison-Wesley , 1984
PGC00
Fisheye state routing: a routing scheme for ad hoc wireless networks
Pei, G.; Gerla, M. & Chen, T.
IEEE International Conference on Communications, ICC 2000 , Vol. 1 , pp. 70-74 ,
2000
pena6
A characterization of the distance to infeasibility under blockstructured perturbations
url
Pena, J.
Linear Algebra and its Applications , Vol. 370 , pp. 193-216 , 2003
pena5
Two properties of condition numbers for convex programs via implicitly
defined barrier functions
Pena, J.
Mathematical Programming , Vol. 93 , pp. 55-75 , 2002
pena4
Computing approximate solutions for convex conic systems of equations
29.03.2006
JabRef Output
Pena, J.
Mathematical Programming , Vol. 87(3) , pp. 351-383 , 2000
pena3
Computing the distance to infeasibility: theoretical and practical
issues
url
Pena, J.
1997
pena1
Understanding the geometry of infeasible perturbations of a conic
linear system
url
url
url
url
29.03.2006
JabRef Output
Optimization
Peng, J.; Roos, C. & Terlaky, T.
2001
peng5
Self-Regular Proximities and New Search Directions for Linear and
Semidefinite Optimization
url
url
url
url
url
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
perold1
Large-scale portfolio optimization
Perold, A.F.
Management Science , Vol. 30 , pp. 1143-1160 , 1984
Peters_1990
The network simplex method on a multiprocessor
Peters, J.
Networks , Vol. 20 , pp. 845-859 , 1990
Pet75
A primal-dual traffic assignment algorithm
Petersen, E.
Management Science , Vol. 22 , pp. 87-95 , 1975
petrovic1
Economic and environmental power dispatch
Petrovic, R. & Kralj, B.
European J. Oper. Res , Vol. 64 , pp. 2-11 , 1993
PeyerZachariasenJorgensen
Delay-related secondary objectives for rectilinear Steiner minimum trees
Peyer, S.; Zachariasen, M. & Jorgensen, D.
Discrete Applied Mathematics , Vol. 136 , pp. 271-298 , 2004
pflug2
Scenario tree generation for multiperiod financial optimization by optimal
discretization
Pflug, G.C.
Mathematical Programming , Vol. 89 , pp. 251-271 , 2001
pflug1
Stochastic programs and statistical data
29.03.2006
JabRef Output
Pflug, G.C.
Annals of Operations Research , Vol. 84 , pp. 59-78 , 1998
philpott1
Continuous-time flows in networks
Philpott, A.
Mathematics of Operations Research , Vol. 15 , pp. 640-661 , 1990
PhilpottMasonDavenport2003
`FIDO': Telecom's best friend
Philpott, A.; Mason, A. & Davenport, J.
OR/MS Today , Vol. 30 , pp. 36-41 , 2003
pidd1
Just modeling through: a rough guide to modeling
Pidd, M.
Interfaces , Vol. 29 , pp. 118-132 , 1999
SPRINGER
Level3 MPLS Protocol Architecture
Pierantozzi, C. & Springer, V.
2000
Pierre97
A tabu-search approach for designing computer-network topologies with
unreliable components
Pierre, S. & Elgibaoui, A.
IEEE Transactions on Reliability , Vol. 46 , pp. 350-9 , 1997
PierreElgibaoui1997
A tabu-search approach for designing computer-network topologies with
unreliable components
Pierre, S. & Elgibaoui, A.
IEEE Transactions on Reliability , Vol. 46 , pp. 350-359 , 1997
29.03.2006
JabRef Output
PierreHoueto02
Assigning Cells to Switches in Cellular Mobile Networks Using Taboo
Search
Pierre, S. & Houto, F.
IEEE Transactions on Systems, Man, and Cybernetics - Part B: Cybernetics , Vol. 32 ,
pp. 351-356 , 2002
PierreLegault1998
A genetic algorithm for designing distributed computer network
technologies
Pierre, S. & Legault, G.
IEEE Transactions on Systems, Man and Cybernetics -- Part B: Cybernetics , Vol. 28 ,
pp. 249-258 , 1998
Pie67a
The tri-substitution method for the three-multidimensional assignment
problem
Pierskalla, W.
CORS J. , Vol. 5 , pp. 71-81 , 1967
Pig
The Economics of Welfare
Pigou, A.C.
Macmillan , 1920
pinar2
Robust profit opportunities in risky financial portfolios
url
29.03.2006
JabRef Output
pinzen92
Parallel decomposition of multicommodity network flows using a linear
quadratic penalty algorithm
Pinar, M. & Zenios, S.
ORSA Journal on Computing , Vol. 4 , pp. 235-249 , 1992
JP
Global optimization: software, test problems, and applications
Pintr, J.D.
Vol. 2 , pp. 515-569 , 2002
pinter1
Global Optimization in Action, Continuous and Lipschitz Optimization:
Algorithms, Implementations and Applications
Pinter, J.
Kluwer Academic Publishers , 1996
piomed04
Routing, Flow and Capacity Design in Communication and Computer
Networks
Pioro, M. & Medhi, D.
Elsevier , pp. 765 , 2004
pioro:00
On OSPF Related Network Optimisation Problems
Pioro, M.; Szentesi, A.; Harmatos, J.; Juttner, A.; Gajowniczek, P. &
Kozdrowski, S.
Proc. IFIP ATM IP , 2000
Pirkul1987
Efficient algorithms for the capacitated concentrator location problem
Pirkul, H.
Computers and Operations Research , Vol. 14 , pp. 197-208 , 1987
PirkulNarasimhan1992
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
url
minimization
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Polzin03
Algorithms for the Steiner Problem in Networks
T. Polzin
Universitt des Saarlandes , 2003
PolzinDaneshmand03
On Steiner trees and minimum spanning trees in hypergraphs
Polzin, T. & Daneshmand, S.V.
Operations Research Letters , Vol. 31 , pp. 12-20 , 2003
PolzinVahdati02
Using (sub)graphs of small width for solving the Steiner problem
Polzin, T. & Daneshmand, S.V.
2002
PolzinDaneshmand01a
A comparison of Steiner tree relaxations
Polzin, T. & Daneshmand, S.V.
Discrete Applied Mathematics , Vol. 112 , pp. 241-261 , 2001
PolzinDaneshmand01b
Improved algorithms for the Steiner problem in networks
Polzin, T. & Daneshmand, S.V.
Discrete Applied Mathematics , Vol. 112 , pp. 263-300 , 2001
PolzinVahdati01
Partitioning techniques for the Steiner problem
Polzin, T. & Daneshmand, S.V.
2001
PolzinDiplom
Algorithmen fr das Steiner-Problem
Polzin, T. and Daneshmand, S. Vahdati
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
method
Portugal, L.; Resende, M.; Veiga, G. & Jdice, J.
Networks , Vol. 35 , pp. 91-108 , 2000
potra9
Q-superlinear convergence of the iterates in primal-dual interiorpoint methods
url
Potra, F.
Mathematical Programming , Vol. 91 , pp. 99-115 , 2001
potra10
The Mizuno-Todd-Ye algorithm in a larger neighborhood of the
central path
url
Potra, F.
2000
potra6
Predictor-corrector algorithm for solving $P_*()$-matrix LCP from
arbitrary positive starting points
Potra, F.A. & Sheng, R.
Mathematical Programming , Vol. 76 , pp. 223-244 , 1997
potra8
A large-step infeasible-interior-point method for the $P_*$-matrix LCP
Potra, F.A. & Sheng, R.
SIAM Journal on Optimization , Vol. 7 , pp. 318-335 , 1997
potra3
On Homogeneous Interior-Point Algorithms for Semidefinite
Programming
Potra, F. & Sheng, R.
Optimization Methods and Software , Vol. 9 , pp. 161-184 , 1998
potra4
Superlinear Convergence of Interior-Point Algorithms for
url
29.03.2006
JabRef Output
Semidefinite Programming
Potra, F. & Sheng, R.
1996
potra5
Superlinear convergence of a predictor-corrector method for
url
semidefinite programming without shrinking central path neighborhood
Potra, F. & Sheng, R.
1996
potra2
A superlinearly convergent primal-dual infeasible-interior-point algorithm
for semidefinite programming
Potra, F. & Sheng, R.
1995
potra7
SDPHA -- a MATLAB implementation of Homogeneous InteriorPoint Algorithms for Semidefinite Programming
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
M. Prais
Department of Computer Science, Catholic University of
Rio de Janeiro
, 2000
PraRib00a
Reactive GRASP: An application to a matrix
decomposition problem in TDMA traffic assignment
Prais, M. & Ribeiro, C.
INFORMS Journal on Computing , Vol. 12 , pp. 164-176 , 2000
PraRib00b
Parameter variation in GRASP procedures
Prais, M. & Ribeiro, C.
Investigacin Operativa , Vol. 9 , pp. 1-20 , 2000
PraRib99b
Parameter variation in GRASP implementations
Prais, M. & Ribeiro, C.
Extended Abstracts of the Third Metaheuristics International Conference , pp. 375380 , 1999
00pra
An algorithm for traffic grooming in WDM optical mesh networks with
multiple objectives
Prathombutr, P.; Stach, J. & Park, E.
ICCCN 2003 , pp. 405 - 411 , 2003
prathom05
An Algorithm for Traffic Grooming in WDM Optical Mesh Networks with
Multiple Objectives.
Prathombutr, P.; Stach, J. & Park, E.K.
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
Provan, J.S.
1983
Provan86
Bounds on the reliability of networks
Provan, J.
IEEE Transactions on Reliability , Vol. R-35 , pp. 260-8 , 1986
Provan84
Computing network reliability in time polynomial in the number of cuts
Provan, J. & Ball, M.
Operations Research , Vol. 32 , pp. 516-26 , 1984
pruesse1
Generating linear extensions fast
url
29.03.2006
JabRef Output
PF02a
Dimensioning multicast-enabled communications networks
Prytz, M. & Forsgren, A.
Networks , Vol. 39 , pp. 216-231 , 2002
PF02b
Dimensioning of a multicast network that uses shortest path routing
distribution trees
Prytz, M. & Forsgren, A.
2002
Prytz:Forsgren
Dimensioning multicast-enabled communications networks
Prytz, M. & Forsgren, A.
Networks , Vol. 39 , pp. 216-231 , 2002
prytz1
Dimensioning Multicast-Enabled Communications Networks
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
url
Quist, A.J.; van Gemeert, R.; Hoogenboom, J.E.; lles, T.; de Klerk, E.;
Roos, C. & Terlaky, T.
1998
29.03.2006
JabRef Output
quist3
Application of nonlinear optimization to reactor core fuel
reloading
url
Quist, A.J.; van Gemeert, R.; Hoogenboom, J.E.; lles, T.; Roos, C. &
Terlaky, T.
Annals of Nuclear Energy , Vol. 26 , pp. 423-448 , 1998
quist1
Copositive relaxations for general quadratic programming
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Rai86
Computing terminal reliability of computer network
Rai, S.; Kumar, A. & Prasad, E.
Reliability Engineering , Vol. 16 , pp. 109-19 , 1986
Rai95
A survey of efficient reliability computation using disjoint products
approach
Rai, S.; Veeraraghavan, M. & Trivedi, K.
Networks , Vol. 25 , pp. 147-63 , 1995
RajHan03
An Efficient Heuristic for Solving an Extended Capacitated Concentrator
Location Problem
Raja, V. & Han, B.
Telecommunication Systems , Vol. 23 , pp. 171-199 , 2003
RaAt02
Survivable Network Design: Routing of Flows and Slacks
Rajan, D. & Atamturk, A.
pp. 65-82 , 2002
ralph2
Some Properties of Regularization and Penalization Schemes for
MPECs
url
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
url
doi
Ramanathan, S.
Wireless Networks , Vol. 5 , pp. 81-94 , 1999
R96
Multicast tree generation in networks with asymmetric links
Ramanathan, S.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
srini2
On updating the analytic center after the addition of multiple cuts
Ramaswamy, S. & Mitchell, J.E.
1994
01ram
Grooming in SDH/WDM mesh networks for different traffic granularities
Ramdani, I.; Prat, J. & Comellas, J.
Transparent Optical Networks, 2003 , Vol. 1 , pp. 95 - 98 , 2003
RanBoyce
Modeling Dynamic Transportation Networks
Ran, B. & Boyce, D.E.
Springer-Verlag , 1996
RanMcmSug02
A simulated annealing approach to communication network design
Randall, M.; McMahon, G. & Sugden, S.
J. of Combinatorial Optimization , Vol. 6 , pp. 55-65 , 2002
RaLu01a
A Comparison of Optimal Methods for Local Access Uncapacitated
Network Design
Randazzo, C. & Luna, H.
Annals of Operations Research , Vol. 106 , pp. 263-286 , 2001
RaLu01b
Solving Local Access Network Design Problems with Two Technologies
Randazzo, C. & Luna, H.
Investigacin Operacional , Vol. 21 , pp. 115-123 , 2001
RandazzoLuna01
A Comparison of Optimal Methods for Local Access Uncapacitated
Network Design
29.03.2006
JabRef Output
url
initial solutions
Rangel, M.; Abreu, N. & Netto, P.B.
Pesquisa Operacional , Vol. 20 , pp. 45-58 , 2000
RanAbrBoa99a
GRASP in the QAP: An acceptance bound for initial solution
Rangel, M.; Abreu, N. & Boaventura-Netto, P.
Proc. of the Third Metaheuristics International Conference , pp. 381-386 , 1999
RanAbrBoaSil98a
A modified local search for GRASP in the quadratic assignment problem
Rangel, M.; de Abreu, N.; Boa-ven-tura--Netto, P. & Boeres, M.
1998
RaoSadayappanHwangShor
The rectilinear Steiner arborescence problem
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
RaviSinha04
Hedging Uncertainty: Approximation Algorithms for Stochastic
Optimization Problems
Ravi, R. & Sinha, A.
pp. 101-115 , 2004
RayUngPelTraSta03
Robust Location Detection in Emergency Sensor Networks
Ray, S.; Ungrangsi, R.; Pelllegrini, F.F.D.; Trachtenberg, A. & Starobinski,
D.
Proc. IEEE INFOCOM 2003 , Vol. 2 , pp. 1044-1053 , 2003
Ra94
Further results on t-coloring and frequency assignment problems
Raychaudhuri, A.
SIAM Journal on Discrete Mathematics , Vol. 7 , pp. 605-613 , 1994
RSmith83
The computation of nearly minimal Steiner trees in graphs
Rayward-Smith, V.J.
Int. J. Math. Educ. Sci. Technol. , Vol. 14 , pp. 15-23 , 1983
RSmithClare
On finding Steiner vertices
Rayward-Smith, V.J. & Clare, A.
Networks , Vol. 16 , pp. 283-294 , 1986
recht1
Identifying non-active restrictions in convex quadratic
programming
url
Recht, P.
Mathematical Methods of OR , Vol. 54 , pp. 53-61 , 2001
00red
29.03.2006
JabRef Output
29.03.2006
JabRef Output
REGNIER
State-Dependent Dynamic Traffic Management for Telephone Networks
Regnier, J. & Cameron, W.H.
IEEE Communications Magazine , Vol. 28 , pp. 42-53 , 1990
Reijnierse-etal-2002
Verifying gross substitutability
Reijnierse, H.; van Gellekom, A. & Potters, J.
Economic Theory , Vol. 20 , pp. 767-776 , 2002
Reilly
Satellite system synthesis model for orbital arc allotment optimization
Reilly, C.
IEEE Transactions on Communications , Vol. 36 , pp. 845-849 , 1988
reinelt2
Reinelt, G.
1995
reinelt3
The Traveling Salesman: Computational Solutions for TSP Applications
Reinelt, G.
Springer , 1994
Reinelt91
TSPLIB - A Traveling Salesman Problem Library
Reinelt, G.
ORSA Journal on Computing , Vol. 3 , pp. 376-384 , 1991
Rei1
The Linear Ordering Problem: Algorithms and Applications
Reinelt, G.
Heldermann , 1985
29.03.2006
JabRef Output
99rein
Telcordia's SONET Design Tool
Reingold, N.
1999
ReiICK99
Multi-stage optimization for mobile radio network planning
Reininger, P.; Iksal, S.; Caminada, A. & Korczak, J.
Proceedings of the IEEE VTC 99 , pp. 2034-2038 , 1999
KeiICK99
Mulri-stage Optimization for Mobile Radio Network Planning
Reininger, P.; Iksal, S.; Caminada, A. & Korczak, J.
Proceedings of IEEE VTC 99 , pp. 2034-2038 , 1999
BGP
A Border Gateway Protocol 4 (BGP-4)
Rekhter, Y. & Li, T.
1995
RenEtAl05
Modelling and stability analysis of binary ABR flow control in ATM
network
Ren, F.; Lin, C. & Wei, W.
IEICE Transactions on Communications , Vol. E88-B , pp. 210-218 , 2005
ren1
Improving the optimization and numerics in Laue diffraction analysis
Ren, Z.; Sheng, R. & Wright, S.J.
SIAG/OPT Views-and-News , Vol. 10(1) , pp. 8-12 , 1999
rendl2
Semidefinite programming and combinatorial optimization
29.03.2006
JabRef Output
Rendl, F.
Applied Numerical Mathematics , Vol. 29 , pp. 255-281 , 1999
rendl1
A semidefinite framework for trust region subproblems with applications
to large scale minimization
Rendl, F. & Wolkowicz, H.
Mathematical Programming , Vol. 77 , pp. 273-299 , 1997
renegar6
Hyperbolic Programs, and Their Derivative Relaxations
url
Renegar, J.
2004
renegar5
A Mathematical View of Interior-Point Methods in Convex Optimization
Renegar, J.
SIAM , 2001
renegar4
Condition numbers, the barrier method, and the conjugate-gradient
method
Renegar, J.
SIAM Journal on Optimization , Vol. 6 , pp. 879-912 , 1996
renegar2
Incorporating condition measures into the complexity theory of linear
programming
Renegar, J.
SIAM Journal on Optimization , Vol. 5 , pp. 506-524 , 1995
renegar3
Linear programming, complexity theory and elementary functional
analysis
Renegar, J.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
url
url
url
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
using GRASP
Resende, M.
Journal of Heuristics , Vol. 4 , pp. 161-171 , 1998
Res98b
Greedy randomized adaptive search procedures (GRASP)
Resende, M.
1998
Resende86
A program for reliability evaluation of undirected networks via polygon-tochain reductions
Resende, M.
IEEE Transactions on Reliability , Vol. R-35 , pp. 24-9 , 1986
ResFeo96a
A GRASP for Satisfiability
Resende, M. & Feo, T.
Vol. 26 , pp. 499-520 , 1996
ResFeoSmi98a
Algorithm 787: Fortran subroutines for approximate solution of maximum
independent set problems using GRASP
Resende, M.; Feo, T. & Smith, S.
ACM Trans. Math. Software , Vol. 24 , pp. 386-394 , 1998
ResParLi96a
Algorithm 754: Fortran subroutines for approximate
url
solution of
dense quadratic assignment problems using GRASP
Resende, M.; Pardalos, P. & Li, Y.
ACM Transactions on Mathematical Software , Vol. 22 , pp. 104-118 , 1996
29.03.2006
JabRef Output
ResPitPar00a
Fortran subroutines for computing approximate solutions of MAX-SAT
problems using GRASP
Resende, M.; Pitsoulis, L. & Pardalos, P.
Discrete Applied Mathematics , Vol. 100 , pp. 95-113 , 2000
ResPitPar97a
Approximate solution of weighted MAX-SAT problems using
GRASP
Resende, M.; Pitsoulis, L. & Pardalos, P.
Vol. 35 , pp. 393-405 , 1997
ResRamDre95
Computing lower bounds for the quadratic assignment problem
with an interior point algorithm for linear programming
url
29.03.2006
JabRef Output
ResRib03c
A GRASP with path-relinking for private virtual circuit routing
Resende, M. & Ribeiro, C.
Networks , Vol. 41 , pp. 104-114 , 2003
ResRib97a
A GRASP for graph planarization
Resende, M. & Ribeiro, C.
Networks , Vol. 29 , pp. 173-189 , 1997
ResUlu97a
SMART: A tool for AT&T Worldnet access design -- Location of Cascade
9000 concentrators
Resende, M. & Ulular, O.
1997
ResWer02b
A hybrid heuristic for the p-median problem
Resende, M. & Werneck, R.
Journal of Heuristics , Vol. 10 , pp. 59-88 , 2004
ResWer03c
A hybrid multistart heuristic for the uncapacitated facility location
problem
Resende, M. & Werneck, R.
2003
ResWer02a
A GRASP with path-relinking for the p-median problem
Resende, M. & Werneck, R.
2002
rexford:02
BGP Routing Stability of Popular Destinations
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
1991
RichardsSalowe
A linear-time algorithm to construct a rectilinear Steiner minimal tree for
$k$-extremal point sets
Richards, D.S. & Salowe, J.S.
Algorithmica , Vol. 7 , pp. 247-276 , 1992
RichardsSaloweFulltree
A simple proof of Hwang's theorem for rectilinear Steiner minimal trees
Richards, D.S. & Salowe, J.S.
Annals of Operations Research , Vol. 33 , pp. 549-556 , 1991
Ric89
Fast heuristic algorithms for rectilinear Steiner trees
Richards, D.
Algorithmica , Vol. 4 , pp. 191-207 , 1989
Ric00
UMTS overview
Richardson, K.
Electronics & Communication Engineering Journal , Vol. 12 , pp. 93-100 , 2000
RicheyParker86
On Multiple Steiner Subgraph Problems
Richey, M.B. & Parker, R.G.
Networks , Vol. 16 , pp. 423-438 , 1986
riedl03
Optimized routing adaptation in IP networks utilizing OSPF and MPLS
Riedl, A.
ICC 2003 - IEEE International Conference on Communications , Vol. 26 , pp. 17541758 , 2003
rieger1
29.03.2006
JabRef Output
url
The critical exponents of the two-dimensional Ising spin glass
revisited: Exact ground state calculations and Monte Carlo simulations
Rieger, H.; Santen, L.; Blasum, U.; Diehl, M.; Jnger, M. & Rinaldi, G.
Journal of Physics A: Mathematical and General , Vol. 29 , pp. 3939-3950 , 1996
Riis:Andersen
Capacitated network design with uncertain demand
Riis, M. & Andersen, K.
INFORMS Journal on Computing , Vol. 14 , pp. 247-260 , 2002
Riis:Lodahl
A bicriteria stochastic programming model for capacity expansion in
telecommunications
Riis, M. & Lodahl, J.
Mathematical Methods of Operations Research , Vol. 56 , pp. 83-100 , 2002
Riley81
Optimal auctions
Riley, J.G. & Samuelson, W.F.
The American Economic Review , Vol. 71 , pp. 381-392 , 1981
rinaldi1
The mathematics of playing golf, or: a new class of difficult non-linear
mixed integer programs
Rinaldi, G.; Voigt, U. & Woeginger, G.J.
Mathematical Programming , Vol. 93 , pp. 77-86 , 2002
RivFPF98
Impact of the Multiple Access Scheme on Optimal Site
Positioning
Riva, G.; Frullone, M.; Passerini, C. & Falciasecca, G.
Proceedings of IEEE ICUPC 98 , pp. 547-551 , 1998
Riv98a
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
rochat1
Probabilistic diversification and intensification in local search for vehicle
routing
Rochat, Y. & Taillard, E.
Journal of Heuristics , Vol. 1 , pp. 147-167 , 1995
rockafellar2
Duality and optimality in multistage stochastic programming
Rockafellar, R.T.
Annals of Operations Research , Vol. 84 , pp. 1-20 , 1998
roc70
Convex Analysis
Rockafellar, R.T.
Princeton University Press , 1970
rockafellar3
Scenarios and Policy Aggregation in Optimization Under Uncertainty
Rockafellar, R.T. & Wets, R.J.
Mathematics of Operations Research , Vol. 16 , pp. 119-147 , 1991
Ro93
Sistemas Integrados de Configuraco de Rede Telefnica
Rodrigues, M.M.R.
DCC/UFMG , 1993
Rohlfs74
A Theory of Interdependent Demand for a Communications Service
Rohlfs, J.
Bell Journals of Economics , Vol. 5 , pp. 16-37 , 1974
RojBarRed03a
Algorithms for parallel machine scheduling: A case study of the tracking
and data relay satellite system
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
rosas1
Using ACCPM in a simplicial decomposition algorithm for the
traffic assignment problem
url
29.03.2006
JabRef Output
Ro60
The gradient projection method for nonlinear programming. Part I:
Linear constraints
Rosen, J.
SIAM Journal on Applied Mathematics , Vol. 8 , pp. 181-217 , 1960
Rosenberg02
Capacity requirements for node and arc survivable networks
Rosenberg, E.
Telecommunication Systems - Modeling, Analysis, Design and Management , Vol. 20 ,
pp. 107-31 , 2002
Ros01
Dual Ascent for Uncapacitated Telecommunications Network Design With
Access, Backbone and Switch Costs
Rosenberg, E.
Telecommunication Systems , Vol. 16 , pp. 423-435 , 2001
Rosenberg2001
Dual ascent for uncapacitated telecommunications network design with
access, backbone and switch Costs
Rosenberg, E.
Telecommunication Systems , Vol. 16 , pp. 423-435 , 2001
Ro87
A Nonlinear Programming Heuristic for Computing Optimal Link
Capacities in a Multi-hour Alternate Routing Communications Network
Rosenberg, E.
Operations Research , Vol. 35 , pp. 354-363 , 1987
Rosenkrantz:Stearns:Lewis
An Analysis of Several Heuristics for the Traveling Salesman Problem
Rosenkrantz, D.; Stearns, R. & Lewis, P.
SIAM Journal on Computing , Vol. 6 , pp. 563-581 , 1977
29.03.2006
JabRef Output
rel77-1
Computing the Reliability of Complex Networks
Rosenthal, A.
SIAM J. Appl. Math. , Vol. 32 , 1977
des77-1
Smallest augmentation to biconnect a graph
Rosenthal, A. & Goldner, A.
SIAM Journal on Computing , Vol. 6 , pp. 55-66 , 1977
Rosenwein:Wong
A constrained Steiner tree problem
Rosenwein, M. & Wong, R.
European Journal of Operational Research , Vol. 81 , pp. 430-439 , 1995
Ross:Soland
A Branch and Bound Algorithm for the Generalized Assignment Problem
Ross, G. & Soland, R.
Mathematical Programming , Vol. 8 , pp. 91-103 , 1975
Ross83
Introduction to Stochastic Dynamic Programming
Ross, S.
Academic Press, New York , 1983
Ros03a
Heursticas para o problema de sntese de redes
a 2-caminhos
I. Rosseti
Department of Computer Science, Catholic University of
Rio de Janeiro
, 2003
29.03.2006
JabRef Output
Rossetietal03
New benchmark instances for the Steiner problem in graphs
Rosseti, I.; de Aragao, M.P.; Ribeiro, C.; Uchoa, E. & Werneck, R.
pp. 601-614 , 2003
ArRo00
An optimization problem arising in the design of multiring systems
Rossi, F. & Arbib, C.
European Journal of Operational Research , Vol. 124 , pp. 63-76 , 2000
rossi1
A branch-and-cut algorithm for the maximum cardinality stable set
problem
Rossi, F. & Smriglio, S.
Operations Research Letters , Vol. 28 , pp. 63-74 , 2001
rothberg1
Sparse Matrix Ordering Methods for Interior Point Linear
Programming
url
29.03.2006
JabRef Output
T. Roughgarden
Department of Computer Science, Cornell University , 2002
Rough02a
How bad is selfish routing?
Roughgarden, T. & Tardos, E.
Journal of the ACM , Vol. 49 , pp. 239-259 , 2002
RoughTar
How Bad is Selfish Routing?
Roughgarden, T. & Tardos, E.
Journal of the ACM , Vol. 49 , pp. 236-259 , 2002
RB96
Multicast routing with end-to-end delay and delay variation constraints
Rouskas, G. & Baldine, I.
IEEE INFOCOM'96 , pp. 353-360 , 1996
RoyDas04
QM$^2$RP: A QoS-Based Mobile Multicast Routing Protocol Using MultiObjective Genetic Algorithm
Roy, A. & Das, S.
Wireless Networks , Vol. 10 , pp. 271-286 , 2004
Va86
A Cross Decomposition Algorithm for the Capacitated Facility Location
Roy, T.V.
Operations Research , Vol. 34 , pp. 145-163 , 1986
Royer99
A Review of Current Routing Protocols for Ad Hoc Mobile Wireless
Networks
Royer, E. & Toh, C.
IEEE Personal Communications Magazines , pp. 46-55 , 1999
29.03.2006
JabRef Output
RubinsteinEtAl02
Minimum Networks for Four Points in Space
Rubinstein, J.; Thomas, D. & Weng, J.
Geometriae Dedicata , Vol. 53 , pp. 57-70 , 2002
rugenstein1
Active set strategies in an ellipsoid algorithm for nonlinear programming
Rugenstein, E.K. & Kupferschmid, M.
Computers and Operations Research , Vol. 31 , pp. 941-962 , 2004
Rump98
Stability and Chaos in Input Pricing for a Service Facility with Adaptive
Customer Response to Congestion
Rump, C.M. & Stidham, S.
Management Science , Vol. 44 , pp. 246-261 , 1998
bobrush.thesis
Decision-constrained stochastic programming for asset-liability
management
R. Rush
Rensselaer Polytechnic Institute , 1998
rush1
Stratified filtered sampling in stochastic optimization
Rush, R.; Mitchell, J.E.; Mulvey, J.M. & Willemain, T.R.
1997
mulvey3
Stratified filtered sampling in stochastic optimization
url
29.03.2006
JabRef Output
covering problem
Rushmeier, R.A. & Nemhauser, G.L.
Operations Research Letters , Vol. 13(5) , pp. 277-285 , 1993
russell1
Hybrid heuristics for the vehicle routing problem with time windows
Russell, R.A.
Transportation Science , Vol. 29 , pp. 156-166 , 1995
rustem1
Robust portfolio analysis
url
url
29.03.2006
JabRef Output
SS
Extremal of functions on graphs with applications to graphs and
hypergraphs
Ss, V.T. & Straus, E.G.
J. Combin. Theory B , Vol. 32 , pp. 246-257 , 1982
Sa69
Branch-and-Bound and Approximate Solutions to the Capacitated Plant
Location Problem
Sa, G.
Operations Research , Vol. 17 , pp. 1005-1016 , 1969
saa02
A Lagrangean Decomposition Approach for the Routing and Wavelength
Assignment in Multifiber WDM Networks
Saad, M. & Luo, Z.
GLOBECOM , pp. 2818-2822 , 2002
SP85
Video conferencing systems
Sabri, S. & Prasada, B.
Proc. of the IEEE , Vol. 73 , pp. 671-688 , 1985
Sack04
New techniques for $p$-Cycle Network Design
Sack, A.
University of Alberta , 2004
GroverIEEENetwork2004
Hamiltonian p-Cycles for Fiber-Level
Protection in Homogeneous and Semi-Homogeneous Optical Networks
Sack, A. & Grover, W.
IEEE Networks , Vol. 18 , pp. 49-56 , 2004
29.03.2006
JabRef Output
SaGr04
Hamiltonian $p$-Cycles for Fiber-Level Protection in Homogeneous and
Semi-Homogeneous Optical Networks
Sack, A. & Grover, W.D.
IEEE Network, Special Issue on Protection, Restoration, and Disaster Recovery , Vol.
18 , pp. 49-56 , 2004
SahMuk99
Light-Trees: Optical Multicasting for Improved Performance in
Wavelength-Routed Networks
Sahasrabuddhe, L. & Mukherjee, B.
IEEE Communication Magazine , Vol. 37 , pp. 67-73 , 1999
sahinidis1
BARON: A general purpose global optimization software package
Sahinidis, N.
Journal of Global Optimization , Vol. 8 , pp. 201-205 , 1996
sahinidis2
Applications of Global Optimization to Process and Molecular Design
Sahinidis, N.V. & Tawarmalani, M.
Computers and Chemical Engineering , Vol. 24 , pp. 2157-2169 , 2000
Sahni
Approximate Algorithms for the 0-1 Knapsack Problem
Sahni, S.
Journal of Association for Computing Machinery , Vol. 22 , pp. 115-124 , 1975
sah74
Computationally related problems
Sahni, S.
SIAM Journal on Computing , Vol. 3 , pp. 262-279 , 1974
saigal4
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
SaloweWarme
35-point rectilinear Steiner minimal trees in a day
Salowe, J.S. & Warme, D.M.
Networks , Vol. 25 , pp. 69-87 , 1995
SaloweWarmeConf
An exact rectilinear Steiner tree algorithm
Salowe, J.S. & Warme, D.M.
Proceedings of the International Conference on Computer Design , pp. 472-475 , 1993
saltzman1
Optimal realignments of the teams in the National Football League
Saltzman, R. & Bradford, R.M.
European J. Oper. Res , Vol. 93 , pp. 469-475 , 1996
sm98
A graph-theoretic algorithm for comparative modeling of protein structure
Samudrala, R. & Moult, J.
J. Mol. Biol. , Vol. 279 , pp. 287-302 , 1988
Sam
Spatial Price Equilibrium and Linear Programming
Samuelson, P.A.
American Economic Review , Vol. 42 , pp. 283-303 , 1952
Sa52
Spatial price equilibrium and linear programming
Samuelson, P.
Amer. Econ. Rev. , Vol. 42 , pp. 284-303 , 1952
Sam98
UMTS universal mobile telecommunications system: Development of
standards for the third generation
Samukic, A.
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
Sanso91a
Communication and transportation network reliability using routing
models
Sanso, B. & Soumis, F.
IEEE Transactions on Reliability , Vol. 40 , pp. 29-38 , 1991
Sanso91
On the evaluation of telecommunications network reliability using routing
models
Sanso, B.; Soumis, F. & Gendreau, M.
IEEE Transactions on Communications , Vol. 39 , pp. 1494-501 , 1991
Santuari03
Steiner Tree NP-completeness Proof
Santuari, A.
2003
sarathy1
A constrained nonlinear 0--1 program for data allocation
Sarathy, R.; Shetty, B. & Sen, A.
European J. Oper. Res , Vol. 102 , pp. 626-647 , 1997
tseng27
Generalized Basis Pursuit
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Satyanarayana83
Network reliability and the factoring theorem
Satyanarayana, A. & Chang, M.
Networks , Vol. 13 , pp. 107-20 , 1983
Satyanarayana79
Comments on 'New topological formula and rapid algorithm for reliability
analysis of complex networks'
Satyanarayana, A. & Prabhakar, A.
IEEE Transactions on Reliability , Vol. R-28 , pp. 264 , 1979
Satyanarayana78
New topological formula and rapid algorithm for reliability analysis of
complex networks
Satyanarayana, A. & Prabhakar, A.
IEEE Transactions on Reliability , Vol. R27 , pp. 82-100 , 1978
Satyanarayana92
A reliability-improving graph transformation with applications to network
reliability
Satyanarayana, A.; Schoppmann, L. & Suffel, C.
Networks , Vol. 22 , pp. 209-16 , 1992
Saunders1
Major Cholesky would feel proud
Saunders, M.A.
ORSA Journal on Computing , Vol. 6(1) , pp. 23-27 , 1994
savelsbergh2
A branch-and-price algorithm for the generalized assignment problem
Savelsbergh, M.W.P.
Operations Research , Vol. 45 , pp. 831-841 , 1997
saveslbergh1
29.03.2006
JabRef Output
29.03.2006
JabRef Output
schaible1
Fractional programming
Schaible, S.
pp. 495-608 , 1994
schaible2
A note on ``Quadratic fractional functionals programming'' by S. P.
Aggarwal
Schaible, S.
Cahiers du Centre dtudes de recherche oprationnelle , Vol. 17 , pp. 95-96 , 1975
schattman1
The investor's reallocation problem under nonconvex transaction
costs and capital gains taxes
url
Schattman, J.
1999
scheel1
Mathematical programs with complementarity constraints: stationarity,
optimality, and sensitivity
Scheel, H. & Scholtes, S.
Mathematics of Operations Research , Vol. 25(1) , pp. 1-22 , 2000
sw
Optimal and near-optimal broadcasting in random graphs
Scheinerman, E. & Wierman, J.
Discrete Applied Mathematics , Vol. 25 , pp. 289-297 , 1989
sch66
On Caratheodory's Theorem
Scherk, P.
Canadian Mathematical Bulletin , Vol. 9(4) , pp. 463-465 , 1966
SchFis03
29.03.2006
JabRef Output
url
Schmieta, S.
2000
schmieta4
Extension of primal-dual interior point algorithms to symmetric cones
Schmieta, S. & Alizadeh, F.
Mathematical Programming , Vol. 96 , pp. 409-438 , 2003
schmieta3
Associative and Jordan Algebras, and Polynomial Time Interior Point
Algorithms for Symmetric Cones
Schmieta, S. & Alizadeh, F.
Mathematics of Operations Research , Vol. 26 , pp. 543-564 , 2001
alizadeh6
Associative Algebras, Symmetric Cones and Polynomial Time
Interior Point Algorithms
url
url
29.03.2006
JabRef Output
url
Scholtes, S.
Operations Research , Vol. 52 , pp. 368-383 , 2004
scholtes2
Convergence Properties of a Regularisation Scheme for
Mathematical Programs with Complementarity Constraints
url
Scholtes, S.
SIAM Journal on Optimization , Vol. 11 , pp. 918-936 , 2001
scholtes4
Active set methods for inverse linear complementarity problems
url
Scholtes, S.
1999
29.03.2006
JabRef Output
scholtes1
How stringent is the linear independence assumption for mathematical
programs with complementarity constraints?
Scholtes, S. & Sthr, M.
Mathematics of Operations Research , Vol. 26 , pp. 851-863 , 2001
schramm1
A version of the bundle idea for minimizing a nonsmooth function:
Conceptual idea, convergence analysis, numerical results
Schramm, H. & Zowe, J.
SIAM Journal on Optimization , Vol. 2 , pp. 121-152 , 1992
Schrijver03
Combinatorial Optimization: Polyhedra and Efficiency
Schrijver, A.
Springer , 2003
schrijver4
On the history of the transportation and maximum flow problems
Schrijver, A.
Mathematical Programming , Vol. 91 , pp. 437-445 , 2002
schrijver2
Polyhedral Combinatorics
Schrijver, A.
Vol. 2 , pp. 1649-1704 , 1995
Sch1
Theory of Linear and Integer Programming
Schrijver, A.
John Wiley , 1986
Schrijver
Theory of Linear and Integer Programming
29.03.2006
JabRef Output
Schrijver, A.
Wiley, New York , 1986
schrijver3
The ring loading problem
Schrijver, A.; Seymour, P. & Winkler, P.
SIAM Review , Vol. 41(4) , pp. 777-791 , 1999
Schu
The Structure and Organization of a Semantic Net for Comprehension and
Inference
Schubert, L.; Goebel, R. & Cercone, N.
1979
schmey91
An interior-point method for block-angular optimization
Schultz, G. & Meyer, R.
SIAM J. Optimization , Vol. 1 , pp. 583-602 , 1991
schultz4
Stochastic programming with integer variables
Schultz, R.
Mathematical Programming , Vol. 97 , pp. 285-309 , 2003
schultz2
Rates of convergence in stochastic programs with integer recourse
Schultz, R.
SIAM Journal on Optimization , Vol. 6 , pp. 1138-1152 , 1996
schultz1
On structure and stability in stochastic programs with random technology
matrix and complete integer recourse
Schultz, R.
Mathematical Programming , Vol. 70 , pp. 73-89 , 1995
29.03.2006
JabRef Output
schultz3
Solving stochastic programs with integer recourse by enumeration: A
framework using Grbner basis reductions
Schultz, R.; Stougie, L. & van der Vlerk, M.H.
Mathematical Programming , Vol. 83 , pp. 229-252 , 1998
Schu04
An ILP for Optimal $p$-Cycle Selection Without Cycle Enumeration
Schupke, D.A.
Proceedings of the 8th IFIP Working Conference on Optical Network Design and
Modelling (ONDM) , pp. 2761-2765 , 2004
ScGr04
Strategies for enhanced dual-failure restorability with static or
reconfigurable $p$-cycle networks
Schupke, D.A.; Grover, W.D. & Clouqueur, M.
Proceedings of IEEE International Conference on Communications (ICC 2004) , 2004
ScAu02
Optimal Configuration of $p$-Cycles in WDM Networks
Schupke, D.A.; Gruber, C.G. & Autenrieth, A.
Proceedings of IEEE International Conference on Communications (ICC 2002) , pp.
2761-2765 , 2002
schurr1
Universal Duality in Conic Convex Optimization
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
1994
SeWi94
Optimal Clustering and Ring Creation in the Network Planning System
PHANET
Semal, P. & Wirl, K.
Proceedings of the 6th International Network Planning Symposium - Networks '94 ,
pp. 303-308 , 1994
SM96
Introduction to IP Multicast Routing
Semeria, C. & Maufer, T.
1996
semet1
Solving real-life vehicle routing problems efficiently using tabu search
Semet, F. & Taillard, E.
Annals of Operations Research , Vol. 41 , pp. 469-488 , 1993
Semret99
Spot and Derivative Markets in Admission Control
Semret, N. & Lazar, A.A.
Proceedings of the 16th International Teletraffic Congress-ITC16 , 1999
Semret00
Peering and Provisioning of Differentiated Internet Services
Semret, N.; Liao, R.; Campbell, A. & Lazar, A.A.
IEEE Infocom 2000 , 2000
Semret-etal-2000
Pricing, Provisioning and Peering: Dynamic Markets for Differentiated
Internet Services and Implications for Network Interconnections
Semret, N.; Liao, R.; Campbell, A. & Lazar, A.
IEEE Journal on Selected Areas in Communication , Vol. 18(12) , pp. 2499-2513 , 2000
29.03.2006
JabRef Output
SenHuson97
A New Model for Scheduling Packet Radio Networks
Sen, A. & Huson, M.L.
Wireless Networks , Vol. 3 , pp. 71-82 , 1997
sen3
Algorithms for stochastic mixed-integer programming models
url
Sen, S.
2003
sen2
Network planning with random demand
Sen, S.; Doverspike, R.D. & Cosares, S.
Telecommunication Systems , Vol. 3 , pp. 11-30 , 1994
sen1
An introductory tutorial on stochastic linear programming models
Sen, S. & Higle, J.L.
Interfaces , Vol. 29 , pp. 33-61 , 1999
sss
Approximate algorithm for solving the maximum independent set problem
Sergienko, I.V.; Shylo, V.P. & Stetsyuk, P.I.
Computer Mathematics, V.M. Glushkov Institute of Cybernetics NAS of Ukraine, Kiev. ,
pp. 4-20 (in Russian) , 2000
SerCol01a
Consumer choice in competitive location models:
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
url
url
Shapiro, A.
expect in 2002
shapiro2
On eigenvalue optimization
Shapiro, A. & Fan, M.K.H.
SIAM Journal on Optimization , Vol. 5 , pp. 552-569 , 1995
shapiro3
On the rate of convergence of optimal solutions of Monte Carlo
approximations of stochastic programs
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Sh95
Local access network design and its extensions
Shaw, D.
1995
Sh93
Limited column generation technique for several telecommunication
network design problems
Shaw, D.
1993
Shaw97
Characteristics of electronics markets
Shaw, M.J. & Strader, M.J.
Decision Support Systems , Vol. 21 , pp. 185-198 , 1997
shectman1
A finite algorithm for global minimization of separable concave programs
Shectman, J.P. & Sahinidis, N.V.
Journal of Global Optimization , Vol. 12 , pp. 1-36 , 1998
Shee00
Modeling the supply-demand interaction in electronic commerce: A bilevel programming approach
Shee, D.; Tang, T. & Gwo-Hshiung~Tzenget, G.
Journal of Electronic Commerce Research , Vol. 1 , pp. 79-93 , 2000
Shef2
Urban Transportation Networks -- Equilibrium Analysis with
Mathematical Programming Methods
Sheffi, Y.
Prentice-Hall , 1985
29.03.2006
JabRef Output
Shef1
Transportation Network Equilibrium with Discrete Choice Models
Y. Sheffi
Civil Engineering Department, Massachusetts Institute of Technology , 1978
ShefDag2
Computation of Equilibrium Over Transportation Networks: The Case of
Disaggregate Demand Models
Sheffi, Y. & Daganzo, C.F.
Transportation Science , Vol. 14 , pp. 155-173 , 1980
ShefDag1
Hypernetworks and Supply -- Demand Equilibrium Obtained with
Disaggregate Demand Models
Sheffi, Y. & Daganzo, C.F.
Transportation Research Record , Vol. 673 , pp. 113-121 , 1978
ShGr03a
Extending the $p$-Cycle Concept to Path Segment Protection for Span and
Node Failure Recovery
Shen, G. & Grover, W.D.
IEEE Journal on Selected Areas in Communications, Optical Communications and
Networking Series , Vol. 21 , pp. 1306-1319 , 2003
ShGr03b
Exploiting forcer structure to serve uncertain demands and minimize
redundancy of $p$-cycle networks
Shen, G. & Grover, W.D.
Proceedings of 4th SPIE Optical Networking and Communications Conference
(OptiComm 2003) , pp. 59-70 , 2003
ShGr04
Design of Protected Working Capacity Envelopes Based on $p$-Cycles: An
Alternative Framework for Survivable Automated Lightpath Provisioning
Shen, G. & Grover, W.
pp. 65-82 , 2004
29.03.2006
JabRef Output
sheng2
A quadratically convergent infeasible-interior-point algorithm for LCP
with polynomial complexity
Sheng, R. & Potra, F.A.
SIAM Journal on Optimization , Vol. 7 , pp. 304-317 , 1997
sheng3
Nonsymmetric search directions for semidefinite programming
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Sherali, H.
Mathematical Programming , pp. 381-396 , 1991
Sherali:Lee:Park
New modeling approaches for the design of local access transport area
networks
Sherali, H.; Lee, Y. & Park, T.
European Journal of Operational Research , Vol. 127 , pp. 94-108 , 2000
ShNo88
A capacitated balanced 2-median problem on a tree network
with a continuum of link demands
Sherali, H. & Nordai, F.
Transportation Science , Vol. 22 , pp. 70-73 , 1988
Sherali:Park
Discrete equal-capacity p-median problem
Sherali, H. & Park, T.
Naval Research Logistics , Vol. 47 , pp. 166-183 , 2000
SPR96
Optimal location of transmitters for micro-cellular radio communication
system design
Sherali, H.; Pendyala, C. & Rappaport, T.
IEEE Journal on Selected Areas in Telecommunications , Vol. 14 , pp. 662-673 , 1996
ShePR96
Optimal Location of Transmitters for Micro-Cellular Radio
Communication System Design
Sherali, H.; Pendyala, M. & Rappaport, T.
IEEE Journal on Selected Areas in Communications , Vol. 14 , pp. 662-673 , 1996
ShRi91
Unbalanced, capacitated p-median problems on a chain graph
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
Shor
Dual quadratic estimates in polynomial and Boolean programming
Shor, N.Z.
Ann. Oper. Res. , Vol. 25 , pp. 163-168 , 1990
Shor2
Quadratic Optimization Problems
Shor, N.Z.
Soviet Journal of Circuits and System Sciences , Vol. 25 , pp. 1-11 , 1987
Shor1
Utilization of the operation of space dilation in the minimization of convex
functions
Shor, N.Z.
Kibernetika , Vol. 1 , pp. 6-12 , 1970
Shore01
Information sharing in global supply chain systems
Shore, B.
Journal of Global Information Technology Management , Vol. 4 , pp. 27-50 , 2001
ShoreFouldsGibbons
An algorithm for the Steiner problem in graphs
Shore, M.L.; Foulds, L.R. & Gibbons, P.B.
Networks , Vol. 12 , pp. 323-333 , 1982
ShVaWaKu91
Multicommodity flows in ring networks
Shulman, A.; Vachani, R.; Ward, J. & Kubat, P.
1991
ShulmanVenkateswaran1999
Resource allocation in tree networks under delay constraints
Shulman, H. & Venkateswaran, V.
29.03.2006
JabRef Output
1999
shylo02
New lower bounds of the size of error-correcting codes for the Z-channel
Shylo, V.
Cybernetics and Systems Analysis , Vol. 38 , pp. 13-16 , 2002
sb02
An algorithm for construction of covering by independent sets
Shylo, V. & Boyarchuk, D.
Computer Mathematics (Publication of Glushkov Institute of Cybernetics, Kiev,
Ukraine) , pp. 151-157 , 2001
ShyWen01a
Optimizing the system of virtual paths by tabu search
Shyur, C. & Wen, U.
European Journal of Operational Research , Vol. 129 , pp. 650-662 , 2001
Sidorenko
On minimal rectilinear Steiner trees
Sidorenko, A.F.
Diskretnaya Matematika , Vol. 1 , pp. 28-37 , 1989
Silva:Abramson
A parallel interior point method and its application to facility location
problems
de Silva, A. & Abramson, D.
Computational Optimization and Applications , Vol. 9 , pp. 249-273 , 1998
SilSer02a
Locating emergency services with priority rules: The priority queuing
covering location problem
Silva, F. & Serra, D.
2002
29.03.2006
JabRef Output
daSilva2002
Uma heuristica lagrangeana para o problema da rvore capacitada de
custo mnimo
Silva, J.B.C.~da
Programa de Engenharia de Sistemas e Computao, COPPE, Universidade Federal do
Rio de Janeiro , 2002
Sil99a
GRASP -- A heuristic for solving combinatorial optimization problems
Silveira, C.
1999
da-Silveira03
Towards a framework for operations management in e-commerce
Silveira, G.J.C.D.
International Journal of Operations and Production Management , Vol. 23 , pp. 200212 , 2003
eva13
Treatment Planning for Permanent Prostate Implants: Genetic Algorithm
versus Integer Programming
Silvern, D.; Lee, E.K.; Gallagher, R.J.; Stabile, L.G.; Ennis, R.D.; Moorthy,
C.R. & Zaider, M.
Medical & Biological Engineering & Computing , Vol. 35 , pp. 850 , 1997
simantiraki1
An infeasible-interior-point method for solving mixed
complementarity problems
url
url
29.03.2006
JabRef Output
sim00
The Partition Coloring Problem and its Application to Wavelength
Assignment in Optical Networks
Simha, R. & Li, G.
First Workshop on Optical Networks, Dallas, TX, 2000 , 2000
desimone3
The cut polytope and the boolean quadric polytope
Simone, C.D.
Discrete Applied Mathematics , Vol. 79 , pp. 71-75 , 1989
Simpson02
The impact of the Internet in banking: Observations and evidence from
developed and emerging markets
Simpson, J.
Telematics and Informatics , Vol. 19 , pp. 315-330 , 2002
singh1
Buffer allocation for an integer nonlinear network design problem
Singh, A. & Smith, J.M.
Computers and Operations Research , Vol. 24 , pp. 453-472 , 1997
Singh94
Network reliability evaluation by decomposition
Singh, B. & Ghosh, S.
Microelectronics and Reliability , Vol. 34 , pp. 925-7 , 1994
singhal1
Fixed order branch-and-bound methods for mixed-integer programming:
The ZOOM system
Singhal, J.; Marsten, R.E. & Morin, T.L.
ORSA Journal on Computing , Vol. 1 , pp. 44-51 , 1989
SinghalMukherjee03
Algorithms for Provisioning Survivable Multicast Sessions against Link
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Smith, M.J.
Transportation Research B , Vol. 13 , pp. 259-304 , 1979
Smith-a
How to find Steiner minimal trees in Euclidean $d$-space
Smith, W.D.
Algorithmica , Vol. 7 , pp. 137-177 , 1992
Sny91
Lower bounds for rectilinear Steiner trees in bounded space
Snyder, T.L.
Information Processing Letters , Vol. 37 , pp. 71-74 , 1991
snyder1
A priori bounds on the Euclidean TSP
Snyder, T.L. & Steele, J.M.
SIAM Journal on Computing , Vol. 24 , pp. 665-671 , 1995
sohraby01
Digicat Container: A Mechanism for Heterogeneous Traffic Transport over
an All-Optical Network
Sohraby, K. & Fatehi, M.T.
Optical Networks Magazine , Vol. 2 , pp. 45-57 , 2001
Soi81
Reliability indices for topological design of computer communication
networks
Soi, I. & Aggarwal, K.
IEEE Transactions on Reliability , Vol. R-30 , pp. 438-43 , 1981
sokkalingam1
Solving inverse spanning tree problems through network flow techniques
Sokkalingam, P.T.; Ahuja, R.K. & Orlin, J.B.
Operations Research , Vol. 47 , pp. 291-298 , 1999
29.03.2006
JabRef Output
So74
Optimal Facility Location with Concave Costs
Soland, R.
Operations Research , Vol. 22 , pp. 373-382 , 1974
SondergeldVoss96
A multi-level star-shaped intensification and diversification approach in
tabu search for the Steiner tree problem in graphs
Sondergeld, L. & Vo, S.
1996
shao99
Le DWDM et les rseaux intgration de l'avenir
Song, S.
IEEE Canada Review - Summer/t 1999 , pp. 1-4 , 1999
Soni99
Survivable network design: the state of the art
Soni, S.; Gupta, R. & Pirkut, H.
Information Systems Frontiers , Vol. 1 , pp. 303-15 , 1999
sonnevend2
New algorithms in convex programming based on a notion of center and
on rational extrapolations
Sonnevend, G.
International Series of Numerical Mathematics , Vol. 84 , pp. 311-327 , 1988
Sonn
An ``analytic center'' for polyhedrons and new classes of global
algorithms for linear (smooth, convex) programming
Sonnevend, G.
Proceedings of the 12th IFIP Conference on Systems Modeling and Optimization,
Budapest, 1985 , Vol. 84 , pp. 866-876 , 1986
sorensen1
29.03.2006
JabRef Output
29.03.2006
JabRef Output
1996
SouDuhRib03
A GRASP with path-relinking heuristic for the capacitated minimum
spanning tree problem
Souza, M.; Duhamel, C. & Ribeiro, C.
pp. 627-658 , 2003
SouDuhRib03a
A GRASP heuristic for the capacitated minimum spanning
url
29.03.2006
JabRef Output
url
problems
Souza, M.; Maculan, N. & Ochi, L.
pp. 659-672 , 2003
souza2
The graph equipartition problem: optimal solutions, extensions
and applications
url
C. C. de Souza
CORE, Universit Catholique de Louvain , 1993
souza1
A new approach to minimising the frontwidth in finite element
calculations
de Souza, C.C.; Keunings, R.; Wolsey, L.A. & Zone, O.
Computer Methods in Applied Mechanics and Engineering , Vol. 111 , pp. 323-334 ,
1994
spall1
Introduction to Stochastic Search and Optimization
Spall, J.C.
Wiley , 2003
spellucci1
An SQP method for general nonlinear programs using only equality
constrained subproblems
Spellucci, P.
Mathematical Programming , Vol. 82 , pp. 413-448 , 1998
Spicer-1996
International Survey of Spectrum Assignment for Cellular and PCS.
Federal Communications Commission.
http://wireless.fcc.gov/auctions/data/papersAndStudies.html
29.03.2006
JabRef Output
Spicer, M.
1996
Spieksma-1999
On the approximability of an interval scheduling problem
Spieksma, F.C.R.
Journal of Scheduling , Vol. 2 , pp. 215-227 , 1999
Spielberg
Algorithms for the Simple Plant Location Problem with some SideConditions
Spielberg, K.
Operations Research , Vol. 17 , pp. 85-111 , 1969
spielman4
Smoothed analysis of termination of linear programming algorithms
Spielman, D.A. & Teng, S.
Mathematical Programming , Vol. 97 , pp. 375-404 , 2003
spielman1
Smoothed analysis: why the simplex algorithm usually takes
polynomial time
url
url
29.03.2006
JabRef Output
sporre1a
Characterization of the limit point of the central path in
semidefinite programming
url
29.03.2006
JabRef Output
sridharan:03
On the Correlation between Route Dynamics and Routing Loops
Sridharan, A.; Moon, S.B. & Diot, C.
Proc. Internet Measurement Conference , 2003
Sridharan:Salapaka:Somani
A practical approach to operating survivable WDM networks
Sridharan, M.; Salapaka, M. & Somani, A.
IEEE Journal on Selected Areas in Communications , Vol. 20 , pp. 34-46 , 2002
SriRamKumAraNaq00a
Optimal design of signaling networks for Internet telephony
Srinivasan, A.; Ramakrishnan, K.; Kumaram, K.; Aravamudam, M. &
Naqvi, S.
IEEE INFOCOM 2000 , 2000
00sri
Analysis of multi-rate traffic in WDM grooming networks
Srinivasan, R. & Somani, A.
Proceedings , pp. 296 - 301 , 2002
05sri
Request-specific routing in WDM grooming networks
Srinivasan, R. & Somani, A.
ICC 2002 , Vol. 5 , pp. 2876 - 2880 , 2002
SriTho73
Benefit-cost analysis of coding techniques for the primal transportation
algorithm
Srinivasan, V. & Thompson, G.
Journal of the Association for Computing Machinery , Vol. 20 , pp. 194-213 , 1973
SMM99
A rearrangeable algorithm for the construction of delay-constrained
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Steele, J.M.
Springer-Verlag , 2000
steele3
Probability theory and combinatorial optimization
Steele, J.M.
SIAM , 1997
Stl2
Probabilistic and worst case analyses of classical problems of
combinatorial optimization in Euclidean space
Steele, J.M.
Mathematics of Operations Research , Vol. 15(4) , pp. 749-770 , 1990
Stl1
Subadditive Euclidean functionals and non-linear growth in geometric
probability
Steele, J.M.
Annals of Probability , Vol. 9 , pp. 365-376 , 1981
Ste74
Optimization of transport networks
Steenbrink, P.
John Wiley and Sons , 1974
JSt
An Extension of Karmarkar's Algorithm for Bounded Linear Programming
Problems
Steger, A. E.
State University of New York at Stony Brook , 1985
des69-1
The design of minimum-cost survivable networks
Steiglitz, K.; Weiner, P. & Kleitman, D.
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
StTh04
Joint Optimization of Working and $p$-cycle Protection Capacity
Stidsen, T. & Thomadsen, T.
2004
still1
Discretization in semi-infinite programming: the rate of convergence
Still, G.
Mathematical Programming , Vol. 91 , pp. 53-69 , 2001
stoer2
Infeasible-interior-point paths for Sufficient Linear Complementarity
Problems and their analyticity
Stoer, J. & Wechs, M.
Mathematical Programming , Vol. 83 , pp. 407-423 , 1998
stoer1
High order infeasible-interior-point methods for Solving Sufficient
Linear Complementarity Problems
url
29.03.2006
JabRef Output
Design
Stoer, M. & Dahl, G.
Numerische Mathematik , Vol. 68 , pp. 149-167 , 1994
Stoer:Dahl
A polyhedral approach to multicommodity survivable network design
Stoer, M. & Dahl, G.
Numerische Mathematik , Vol. 68 , pp. 149-167 , 1994
stojmenovic02dominating
Dominating Sets and Neighbor Elimination-Based Broadcasting
Algorithms in Wireless Networks
Stojmenovic, I.; Seddigh, M. & Zunic, J.
IEEE Transactions on Parallel and Distributed Systems , Vol. 13 , pp. 14-25 , 2002
Stojmenovic01
Dominating Sets and Neighbor Elimination-Based Broadcasting
Algorithms in Wireless Networks
Stojmenovic, I.; Seddigh, M. & Zunic, J.
IEEE Transactions of Parallel and Distributed Systems , Vol. 12 , pp. 14-25 , 2001
Stolyar05
On the Asymptotic Optimality of the Gradient Scheduling Algorithm for
Multiuser Throughput Allocation
Stolyar, A.
Operations Research , Vol. 53 , pp. 12-25 , 2005
StTvy
The simplex and projective scaling algorithms as iteratively rewieghted
least squares methods
Stone, R.E. & Tovey, C.A.
SIAM Review , Vol. 33(2) , pp. 220-237 , 1991
Stoyan84
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
url
Sturm, J.F.
Mathematical Programming , Vol. 95 , pp. 219-247 , 2003
sturm11
Using SeDuMi 1.02, a MATLAB toolbox for optimization over
symmetric cones
url
Sturm, J.F.
Optimization Methods and Software , Vol. 11 , pp. 625-653 , 1999
sturm6
Superlinear convergence of an algorithm for monotone linear
url
complementarity problems, when no strictly complementary solution
exists
Sturm, J.F.
Mathematics of Operations Research , Vol. 24(1) , pp. 72-94 , 1999
sturm9
Primal-Dual Interior Point Approach to Semidefinite Programming
url
J. F. Sturm
Econometric Institute, Erasmus University , 1997
sturm10
On sensitivity of central solutions in semidefinite programming
29.03.2006
JabRef Output
url
url
url
url
29.03.2006
JabRef Output
1996
sturm1
Symmetric primal-dual path following algorithms for semidefinite
programming
url
29.03.2006
JabRef Output
sun5
An analytic center cutting plane method for semidefinite feasibility
problems
url
url
29.03.2006
JabRef Output
2004
SL95
Efficient Multicast Routing for Delay-Sensitive Applications
Sun, Q. & Langendoerfer, H.
Proceedings of the Second Workshop on Protocols for Multimedia Systems
(PROMS'95) , pp. 452-458 , 1995
Sun95
Efficient Multicast Routing for Delay-Sensitive Applications
Sun, Q. & Langendoerfer, H.
Proceedings of the Second Workshop on Protocols for Multimedia Systems
(PROMS'95) , pp. 452-458 , 1995
xlsun1
Asymptotic bounded duality for bounded integer programming: a
logarithmic-exponential dual formulation
Sun, X. & Li, D.
Mathematics of Operations Research , Vol. 25 , pp. 625-644 , 2000
xlsun2
On the relationship between the integer and continuous solutions of
convex programs
Sun, X.L. & Li, D.
Operations Research Letters , Vol. 29 , pp. 87-92 , 2001
Sung:Jin
Dual-based approach for a hub network design problem under nonrestrictive policy
Sung, C. & Jin, H.
European Journal of Operational Research , Vol. 132 , pp. 88-105 , 2001
Sung95
A routing algorithm for virtual circuit data-networking with unreliable
links
Sung, C. & Lee, K.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
pap:suur
A quick method for finding shortest pairs of disjoint paths
Suurballe, J.W. & Tarjan, R.E.
Networks , Vol. 14 , pp. 325-336 , 1984
sp74-1
Disjoint paths in a network
Suurballe, J.
Networks , Vol. 4 , pp. 125-145 , 1974
sp84-1
A quick method for finding shortest pairs of disjoint paths
Suurballe, J. & Tarjan, R.
Networks , Vol. 14 , pp. 325-336 , 1984
swas02
Practical routing and wavelength assignment algorithms for all optical
networks with limited wavelength conversion
Swaminathan, M. & Sivarajan, K.
IEEE International Conference on Communications, 2002. ICC 2002 , Vol. 5 , pp.
2750-2755 , 2002
SwamyKumar04
Primal-Dual Algorithms for Connected Facility Location Problems
Swamy, C. & Kumar, A.
Algorithmica , Vol. 40 , pp. 245-269 , 2004
SwTh
Graphs, Networks and Algorithms
Swamy, M.N.S. & Thulasiraman, K.
Wiley , 1981
szpankowski1
Average case analysis of algorithms
url
29.03.2006
JabRef Output
Szpankowski, W.
pp. 14.1-14.38 , 1998
szwarc1
The transportation problem with stochastic demands
Szwarc, W.
Management Science , Vol. 11 , pp. 33-50 , 1964
Cannon:Hoffman
Large-scale 0/1 linear programming on distributed workstations
T.~L.~Cannon & K.~L.~Hoffman
Annals of Operations Research , Vol. 22 , pp. 181-217 , 1990
tutuncu4
Quadratic convergence of potential-reduction methods for degenerate
problems
Ttnc, R.H.
Mathematical Programming , Vol. 90 , pp. 169-203 , 2001
tutuncu6
Asymptotic behavior of continuous trajectories for primal-dual
potential-reduction methods
url
Ttnc, R.H.
2001
tutuncu3
A primal-dual variant of the Iri-Imai algorithm for Linear Programming
Ttnc, R.H.
Mathematics of Operations Research , Vol. 25(2) , pp. 195-213 , 2000
tutuncu2
An Infeasible-Interior-Point Potential-Reduction Algorithm for
Linear Programming
url
Ttnc, R.H.
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
A new neighborhood structure for the vehicle routing problem with time
windows
Taillard, E.; Badeau, P.; Gendreau, M.; Guertin, F. & Potvin, J.
??
taillard2
Vehicle routing with multiple use of vehicles
Taillard, E.; Laporte, G. & Gendreau, M.
1995
Takagi86
Analysis of Polling Systems
Takagi, H.
MIT Press , 1986
TakMat80
An approximate solution for the Steiner problem in graphs
Takahashi, H. & Matsuyama, A.
Mathematica Japonica , Vol. 24 , pp. 573-577 , 1980
TM80
An approximate solution for the Steiner problem in graphs
Takahashi, H. & Matsuyama, A.
Mathematica Japonica , Vol. 24 , pp. 573-577 , 1980
takada1
Towards the Implementation of Successive Convex Relaxation
Method for Nonconvex Quadratic Optimization Problems
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Tapia2
Extending the Farkas Lemma approach to necessity conditions to infinite
programming
Tapia, R.A. & Trosset, M.W.
1991
TpZh
An optimal-basis identification technique for interior-point linear
programming algorithms
Tapia, R.A. & Zhang, Y.
Linear Algebra and its Applications , Vol. 152 , pp. 343-364 , 1991
Tapscott00
Digital capital: Harnessing the power of business webs
Tapscott, D.; Ticoll, D. & Lowi, A.
Harvard Business School Press , 2000
tarasov1
The method of inscribed ellipsoids
Tarasov, S.P.; Khachiyan, L.G. & Erlikh, I.I.
Soviet Mathematics Doklady , Vol. 37 , pp. 226-230 , 1988
Tardos1
A strongly polynomial algorithm to solve combinatorial linear programs
Tardos, &.
Operations Research , Vol. 34 , pp. 250-256 , 1986
Tar85
A strongly polynomial minimum cost circulation algorithm
Tardos, &.
Combinatorica , Vol. 5 , pp. 247-255 , 1985
Ta83
Data Structures and Network Algorithms
29.03.2006
JabRef Output
Tarjan, R.E.
SIAM , 1983
TarjanTrojanowski77
Finding a maximum independent set
Tarjan, R.E. & Trojanowski, A.E.
SIAM Journal of Computing , Vol. 6 , pp. 537-546 , 1977
Tar85a
Shortest paths
Tarjan, R.
pp. 753-759 , 1985
Tar83a
Data Structures and Network Algorithms
Tarjan, R.
Society for Industrial and Applied Mathematics , 1983
tassiulas92
Stability properties of constrained queueing systems and scheduling
policies for maximum throughput in multihop radio networks
Tassiulas, L. & Ephremides, A.
IEEE Transactions on Automatic Control , Vol. 37 , pp. 1936-1948 , 1992
TaCaMa95
Aided Design and Analysis of Distributed Branch and Bound Algorithms
Tavares, A.; Carvalho, M. & Mateus, G.
pp. 448-458 , 1995
tawarmalani4
Convexification and Global Optimization in Continuous and Mixed-Integer
Nonlinear Programming: Theory, Algorithms, Software, and Applications
Tawarmalani, M. & Sahinidis, N.
Kluwer , 2002
29.03.2006
JabRef Output
tawarmalani2
Convex extensions and envelopes of lower semi-continuous
functions
url
url
url
29.03.2006
JabRef Output
Teich04
Emerging multiple issue e-auctions
Teich, J.E.; Wallenius, H.; Wallenius, J. & Koppius, O.
European Journal of Operational Research , Vol. 159 , pp. 1-16 , 2004
TB68
Heuristic Methods for Estimating the Generalized Vertex Median of a
Weighted Graph
Teitz, M.B. & Bart, P.
Operations Research , Vol. 16 , pp. 955-961 , 1968
TeBa68
Heuristic Methods for Estimating the Generalized Vertex Median of a
Weighted Graph
Teitz, M. & Bart, P.
Operations Research , Vol. 16 , pp. 955-961 , 1968
teixeira:04
Dynamics of Hot-Potato Routing in IP Networks
Teixeira, R.; Shaikh, A.; Griffin, T. & Rexford, J.
Proc. ACM SIGMETRICS , 2004
teixeira:04a
Network Sensitivity to Hot-Potato Disruptions
Teixeira, R.; Shaikh, A.; Griffin, T. & Voelker, G.
Proc. ACM SIGCOMM , 2004
Tel
Telecom~95
1995
Telle94dom-complexity
Complexity of domination-type problems in graphs
Telle, J.A.
29.03.2006
JabRef Output
url
Terlaky, T.
1998
terlaky1
A note on Mascarenhas' counter example about global convergence
of the affine scaling algorithm
url
29.03.2006
JabRef Output
grooming capabilities
Thiagarajan, S. & Somani, A.
ICC 2001 , Vol. 5 , pp. 1592 - 1596 , 2001
abacus
ABACUS 2.0. User's Guide and Reference Manual
Thienel, S.
1997
Abacus97
ABACUS---A Branch-And-Cut System, Version~2.0, User's Guide and
Reference Manual
Thienel, S.
1997
Abacus95
ABACUS---A Branch-And-Cut System
S. Thienel
Universitt zu Kln , 1995
thi95
ABACUS - A Branch-And-CUt System
S. Thienel
Universitt zu Kln , 1995
Thimm03
On the approximability of the Steiner tree problem
Thimm, M.
Theoretical Computer Science , Vol. 295 , pp. 387-402 , 2003
Thimm01
On the Approximability of the Steiner Tree Problem
Thimm, M.
pp. 678-689 , 2001
29.03.2006
JabRef Output
ThTu80
Convergent Algorithm for Minimizing a Concave Function
Thoai, N. & Tuy, H.
Mathematical of the Operational Research , Vol. 5 , pp. 556-566 , 1980
Thomas97
An Approach to Service Provisioning with Quality of Service Requirements
in ATM Networks
Thomas, P. & Teneketzis, D.
Journal of High Speed Networks , Vol. 6 , pp. 263-291 , 1997
Thomas02
A Market-Based Approach to Optimal Resource Allocation in IntegratedServices Connection-Oriented Networks
Thomas, P.; Teneketzis, D. & Mackie-Mason, J.K.
Operations Research , Vol. 50 , pp. 603-616 , 2002
ThomborsonAlpernCarter
Rectilinear Steiner tree minimization on a workstation
Thomborson, C.D.; Alpern, B. & Carter, L.
Vol. 15 , pp. 119-136 , 1994
ThomborsonDeneenShute
Computing a rectilinear Steiner minimal tree in $O(n^O(n))$ time
Thomborson, C.D.; Deneen, L.L. & Shute, G.M.
Vol. 269 , pp. 176-183 , 1987
ThottanEtAl03
SEQUIN: An SNMP-Based MPLS Network Monitoring System
Thottan, M.; Swanson, G.; Cantone, M.; Ho, T.; Ren, J. & Paul, S.
Bell Labs Technical Journal , Vol. 8 , pp. 95-111 , 2003
Timmers00
Electronic commerce -- Marketing strategies and business models
29.03.2006
JabRef Output
Timmers, P.
2000
Timmers98
Business models for electronic markets
Timmers, P.
Electronic Markets , Vol. 8 , pp. 3-8 , 1998
Tinn
Comments on using sparsity techniques for power system problems
Tinney, W.F.
Sparse Matrix Proceedings , pp. 25-34 , 1969
Titchmarsh39
The Theory of Functions
Titchmarsh, E.
Oxford University Press , 1939
tits3
An Interior Point Method for Linear Programming, with an Active
Set Flavor
url
Tits, A.
1999
tits2
A Simple, Quadratically Convergent Interior Point Algorithm for Linear
Programming and Convex Quadratic Programming
Tits, A.L. & Zhou, J.L.
pp. 411-427 , 1993
Todd6
On Anstreicher's combined Phase I-Phase II projective algorithm for linear
programming
Todd, M.J.
29.03.2006
JabRef Output
url
Todd, M.J.
2003
todd20
The many facets of linear programming
url
Todd, M.J.
Mathematical Programming , Vol. 91 , pp. 417-436 , 2002
todd21
Semidefinite Optimization
url
Todd, M.J.
Acta Numerica , Vol. 10 , pp. 515-560 , 2001
todd17
A study of search directions in primal-dual interior-point methods
for semidefinite programming
url
Todd, M.J.
Optimization Methods and Software , Vol. 11 , pp. 1-46 , 1999
todd18
My favorite theorem and open problem
Todd, M.J.
Optima , Vol. 57 , pp. 7-8 , 1998
todd14
Potential-reduction methods in mathematical programming
Todd, M.J.
Mathematical Programming , Vol. 76 , pp. 3-45 , 1997
todd16
29.03.2006
JabRef Output
url
Todd, M.J.
1996
todd11
Interior-point algorithms for semi-infinite programming
Todd, M.J.
Mathematical Programming , Vol. 65 , pp. 217-245 , 1994
Todd9
Theory and practice for interior-point methods
Todd, M.J.
ORSA Journal on Computing , Vol. 6(1) , pp. 28-32 , 1994
Todd10
A lower bound on the number of iterations of primal-dual interior-point
methods for linear programming
Todd, M.J.
1993
Todd7
The affine-scaling direction for linear programming is a limit of projectivescaling directions
Todd, M.J.
Linear Algebra and its Applications , Vol. 152 , pp. 93-106 , 1991
Todd8
Probabilistic Models For Linear Programming
Todd, M.J.
Mathematics Of Operations Research , Vol. 16 , pp. 671-693 , 1991
Todd5
A Dantzig-Wolfe-like variant of Karmarkar's interior-point linear
programming algorithm
29.03.2006
JabRef Output
Todd, M.J.
Operations Research , Vol. 38(6) , pp. 1006-1018 , 1990
Todd1
Polynomial algorithms for linear programming
Todd, M.J.
pp. 49-66 , 1988
Todd2
Improved bounds and containing ellipsoids in Karmarkar's linear
programming algorithm
Todd, M.J.
Mathematics of Operations Research , Vol. 13(4) , pp. 650-659 , 1988
Todd3
Exploiting special structure in Karmarkar's algorithm
Todd, M.J.
Mathematical programming , Vol. 41(1) , pp. 97-113 , 1988
Todd4
Recent developments and new directions in linear programming
Todd, M.J.
1988
TB1
An Extension of Karmarkar's Algorithm for Linear Programming Using
Dual Variables
Todd, M.J. & Burrell, B.P.
Algorithmica , Vol. 1 , pp. 409-424 , 1986
todd15
On the Nesterov-Todd direction in semidefinite programming
url
29.03.2006
JabRef Output
todd19
Characterizations, bounds, and probabilistic analysis of two
complexity measures for linear programming problems
url
url
Toh, K.C.
2002
toh2
Some new search directions for primal-dual interior point
methods in semidefinite programming
url
Toh, K.C.
SIAM Journal on Optimization , Vol. 11 , pp. 223-242 , 2001
29.03.2006
JabRef Output
toh4
Solving some large scale semidefinite programs via the conjugate
residual method
url
url
url
url
url
29.03.2006
JabRef Output
TomitaA88
The worst-time complexity for finding all the cliques
Tomita, E.; Tanaka, A. & Takahashi, H.
1988
Tomlin2
A note on comparing simplex and interior methods for linear
programming
Tomlin, J.A.
pp. 91-104 , 1989
Tomlin1
An Improved Branch and Bound Method for Integer Programming
Tomlin, J.
Operations Research , Vol. 19 , pp. 1070-1075 , 1971
Tone1
An active-set strategy in interior point method for linear programming
Tone, K.
1991
Tong:Yum:Hui
Supervisory management and lightpath restoration for wavelength routing
networks
Tong, F.; Yum, T. & Hui, C.
Journal of Lightwave Technology , Vol. 18 , pp. 1181-1186 , 2000
topaloglu1
An algorithm for approximating piecewise linear concave functions from
sample gradients
Topaloglu, H. & Powell, W.B.
Operations Research Letters , Vol. 31 , pp. 66-76 , 2003
To78
Minimizing a Submodular Function on a Lattice
29.03.2006
JabRef Output
Topkis, D.
Operations Research , Vol. 26 , pp. 305-321 , 1978
torczon1
On the convergence of pattern search algorithms
Torczon, V.
SIAM Journal on Optimization , Vol. 7 , pp. 1-25 , 1997
tor02
WDM Network Optimization by ILP Based on Source Formulation
Tornatore, M.; Maier, G. & Pattavina, A.
IEEE Infocom , Vol. 3 , pp. 1813-1821 , 2002
ToulouseEtAl04
Systemic behavior of cooperative search algorithms
Toulouse, M.; Crainic, T. & Sans, B.
Parallel Computing , Vol. 30 , pp. 57-79 , 2004
tovey1
Tutorial on computational complexity
Tovey, C.A.
Interfaces , Vol. 32 , pp. 30-61 , 2002
UNCTAD04
E-commerce and development report 2004
Trade, U.N.C.o. & (UNCTAD), D.
2004
UNCTAD03
E-commerce and development report 2003
Trade, U.N.C.o. & (UNCTAD), D.
2003
trafalis2
29.03.2006
JabRef Output
url
url
url
29.03.2006
JabRef Output
Trick, M.A.
Vol. 2079 , pp. 242-253 , 2000
Tri1
Solving matching problems with generalized networks
Trick, M.A.
1986
Trigeorgis96
Real options: Managerial flexibility and strategy in resource allocation
Trigeorgis, L.
MIT Press , 1996
TRUITT
Traffic Engineering Techniques for Determining Trunk Requirements in
Alternate Routed Networks
Truitt, C.J.
Bell System Technical Journal , Vol. 31 , pp. 277-304 , 1954
TsaiEtAl04
Efficient coding translation of GSM and G.729 speech coders across mobile
and IP networks
Tsai, S.; Wang, J.; Yang, J. & Wang, J.
IEICE Transactions on Communications , Vol. E87-D , pp. 444-452 , 2004
Tsay99
Modeling supply chain contract: A review
Tsay, A.A.; Nahmias, S. & Agrawal, N.
pp. 229-336 , 1999
tseng14
An epsilon-out-of-kilter method for monotropic programming
url
Tseng, P.
Mathematics of Operations Research , Vol. 26 , pp. 221-233 , 2001
29.03.2006
JabRef Output
tseng29
Further Results on Approximating Nonconvex Quadratic
Optimization by Semidefinite Programming Relaxation
url
Tseng, P.
2001
tseng31
Convergence Properties of Dikin's Affine Scaling Algorithm for
Nonconvex Quadratic Minimization
url
Tseng, P.
2001
tseng32
An Analysis of the EM Algorithm and Entropy-Like Proximal Point
Methods
url
Tseng, P.
2001
tseng33
Further Results on Approximating Nonconvex Quadratic
Optimization by Semidefinite Programming Relaxation
url
Tseng, P.
2001
tseng22
Co-NP-completeness of some matrix classification problems
Tseng, P.
Mathematical Programming , Vol. 88(1) , pp. 183-192 , 2000
tseng23
Convergence of Block Coordinate Descent Method for
Nondifferentiable Minimization
url
Tseng, P.
2000
29.03.2006
JabRef Output
tseng9
Fortified-descent simplicial search method: A general approach
url
Tseng, P.
SIAM Journal on Optimization , Vol. 10(1) , pp. 269-288 , 2000
tseng19
Error bounds and superlinear convergence analysis of some
Newton-type methods in optimization
url
Tseng, P.
1999
tseng20
A convergent infeasible interior-point trust-region method for
constrained minimization
url
Tseng, P.
1999
tseng21
Nearest $q$-flat to $m$ points
url
Tseng, P.
1999
tseng16
A modified forward-backward splitting method for
maximalmonotone mappings
url
Tseng, P.
1998
tseng17
An incremental gradient(-projection) method with momentum term and
adaptive stepsize rule
Tseng, P.
SIAM Journal on Optimization , Vol. 8 , pp. 506-531 , 1998
tseng18
url
29.03.2006
JabRef Output
url
Tseng, P.
Mathematical Programming , Vol. 83 , pp. 159-185 , 1998
tseng4
Search Directions and Convergence Analysis of Some Infeasible
Path-following Methods for the Monotone Semi-Definite LCP
url
Tseng, P.
Optimization Methods and Software , Vol. 9 , pp. 245-268 , 1998
tseng11
Convergence and error bound for perturbation of linear programs
url
Tseng, P.
1997
tseng12
Analysis of a non-interior continuation method based on ChenMangasarian smoothing functions for complementarity problems
url
Tseng, P.
1997
tseng13
Analysis of an infeasible interior path-following method for
complementarity problems
url
Tseng, P.
1997
tseng8
An infeasible path-following method for monotone complementarity
problems
29.03.2006
JabRef Output
Tseng, P.
SIAM Journal on Optimization , Vol. 7 , pp. 386-402 , 1997
tseng2
Search directions and convergence analysis of some infeasible
path-following methods for the monotone semi-definite LCP
url
Tseng, P.
1996
tseng5
Further notes on the existence of search directions in interior-point
methods for the monotone semi-definite LCP
url
Tseng, P.
1996
tseng6
Analysis of infeasible path-following methods using the AlizadehHaeberley-Overton direction for the monotone semi-definite LCP
url
Tseng, P.
1996
Tseng1
Partial affine-scaling for linearly constrained minimization
Tseng, P.
Mathematics of Operations Research , Vol. 20 , pp. 678-694 , 1995
tseng10
Simplified analysis of an $O(nL)$-iteration infeasible predictor-corrector
path-following method for monotone LCP
Tseng, P.
1994
tseng7
AN EPSILON-RELAXATION METHOD FOR SEPARABLE CONVEX
COST GENERALIZED NETWORK FLOW PROBLEMS
url
29.03.2006
JabRef Output
url
url
url
Tsuchiya, T.
Optimization Methods and Software , Vol. 11 , pp. 141-182 , 1999
tsuchiya1
A Polynomial Primal-Dual Path-Following Algorithm for Secondorder Cone Programming
url
Tsuchiya, T.
1997
tsuchiya3
Global convergence of the affine scaling methods for
degenerate linear programming problems
29.03.2006
JabRef Output
Tsuchiya, T.
Mathematical Programming , Vol. 52 , pp. 377-404 , 1991
tuncel12
On the Slater condition for the SDP relaxations of nonconvex sets
url
Tunel, L.
Operations Research Letters , Vol. 29 , pp. 181-186 , 2001
tuncel10
Generalization of primal-dual interior-point methods to convex
optimization problems in conic form
url
Tunel, L.
1999
tuncel11
Complexity Analyses of Discretized Successive Convex Relaxation
Methods
url
Tunel, L.
1999
tuncel7
On the condition numbers for polyhedra in Karmarkar's form
url
Tunel, L.
Operations Research Letters , Vol. 24(4) , pp. 149-155 , 1999
tuncel13
Convex optimization: barrier functions and interior point methods
Tunel, L.
1998
tuncel4
Primal-dual symmetry and scale invariance of interior-point
algorithms for convex optimization
url
Tunel, L.
29.03.2006
JabRef Output
url
Tunel, L.
1998
tuncel2
Constant potential primal-dual algorithms: a framework
Tunel, L.
Mathematical Programming , Vol. 66 , pp. 145-159 , 1994
tuncel1
A pseudo-polynomial complexity analysis for interior-point algorithms
Tunel, L.
1993
tuncel3
On the interplay among entropy, variable metrics and potential functions
in interior-point algorithms
Tunel, L. & Todd, M.J.
1995
tuncel9
On homogeneous convex cones, Caratheodory number, and duality
mapping
url
29.03.2006
JabRef Output
Turner1
Computing directions for the Karmarkar algorithm
Turner, K.
Linear Algebra and its Applications , Vol. 152 , pp. 141-154 , 1991
Tut98
Demand-based radio network planning of cellular
mobile communication systems
Tutschku, K.
Proceedings of the IEEE INFOCOM'98 , Vol. 3 , pp. 1054-1061 , 1998
Tut98b
Interference minimization using automatic design of
cellular communication networks
Tutschku, K.
Proceedings of the VTC'98 , Vol. 1 , pp. 634-638 , 1998
Tut96
An integrated approach to cellular network planning
Tutschku, K.; Gerlich, N. & Tran-Gia, P.
Proceedings of the 7th International Network Planning Symposium - Networks 96 ,
1996
tuy94
Introduction to Global Optimization
Tuy, H.
1994
01hwj
Traffic grooming in WDM networks using genetic algorithm
Tzeng, H.; J, -.C. & Chen, N.
IEEE SMC '99 Conference Proceedings , Vol. 1 , pp. 1003 - 1006 , 1999
29.03.2006
JabRef Output
Uchoa05
Local Search with Perturbations for the Prize-Collecting Steiner Tree
Problem in Graphs
Uchoa, E.
2005
uchoa1
Vertex-disjoint packing of two Steiner trees: polyhedra and branch-andcut
Uchoa, E. & de Arago, M.P.
Mathematical Programming , Vol. 90 , pp. 537-557 , 2001
UchoaAragaoRibeiro02
Preprocessing Steiner Problems from VLSI Layout
Uchoa, E.; de Aragao, M. & Ribeiro, C.
Networks , Vol. 40 , pp. 38-50 , 2002
UeharaEtAl04
A secure and flexible authentication system for digital images
Uehara, T.; Safavi-Naini, R. & Ogunbona, P.
Multimedia Systems , Vol. 9 , pp. 441-456 , 2004
00uem
ATM VP-based economical transport network architecture for multireliability and broadband integrated service infrastructure
Uematsu, Y.; Ohta, H.; Iwase, R.; Watanabe, K.; Matsuda, M.; Hiraki, M. &
Tsuboi, T.
ATM Workshop, 1999. IEEE Proceedings , pp. 331 - 336 , 1999
des88-2
Minimum augmentation of a tree to a
(k)-edge-connected graph
Ueno, S.; Kajitani, Y. & Wada, H.
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
assignment
Valenzuela, C.; Hurley, S. & Smith, D.
Vol. 1498 , pp. 907-916 , 1998
Veldhuizen2000
Multiobjective evolutionary algorithms: Analyzing the state-of-the-art
Van Veldhuizen, D. & Lamont, G.
Evolutionary Computation , Vol. 8 , pp. 125-147 , 2000
VanCaenegem:VanParys:DeTurck:Demeester
Dimensioning of survivable WDM networks
Caenegem, B.V.; Parys, W.V.; Turck, F.D. & Demeester, P.
IEEE Journal on Selected Areas in Communications , Vol. 16 , pp. 1146-1157 , 1998
vance2
Branch-and-price algorithms for the one-dimensional cutting stock
problem
Vance, P.H.
Computational Optimization and Applications , Vol. 9 , pp. 211-228 , 1998
vance1
Airline crew scheduling: A new formulation and decomposition algorithm
Vance, P.H.; Barnhart, C.; Johnson, E.L. & Nemhauser, G.L.
Operations Research , Vol. 45 , pp. 188-200 , 1997
vanbjn94
Solving binary cutting stock problems by column generation and branchand-bound
Vance, P.H.; Barnhart, C.; Johnson, E.L. & Nemhauser, G.L.
Computational Optimization and Applications , Vol. 3 , pp. 111-130 , 1994
vandenberghe4
Applications of semidefinite programming
Vandenberghe, L. & Boyd, S.
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
van96
An exact algorithm for IP column generation
Vanderbeck, F. & Wolsey, L.
Operations Research Letters , Vol. 19 , pp. 151-159 , 1996
vanderbei13
Case Studies in Trajectory Optimization: Trains, Planes, and Other
Pastimes
url
Vanderbei, R.J.
2000
vanderbei12
LOQO user's manual - version 3.10
Vanderbei, R.J.
Optimization Methods and Software , Vol. 11 , pp. 485-514 , 1999
vanderbei5
LOQO: An interior point code for quadratic programming
Vanderbei, R.J.
Optimization Methods and Software , Vol. 11 , pp. 451-484 , 1999
vanderbei8
Linear Programming: Foundations and Extensions
Vanderbei, R.J.
Kluwer Academic Publishers , 1996
vanderbei6
Symmetric quasidefinite matrices
Vanderbei, R.J.
SIAM Journal on Optimization , Vol. 5 , pp. 100-113 , 1995
vanderbei7
The simplest semidefinite programs are trivial
Vanderbei, R.J.
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
programming
Vavasis, S.
1999
vavasis1
Stable numerical algorithms for equilibrium systems
Vavasis, S.
1992
vav91
Nonlinear optimization: complexity issues
Vavasis, S.
Oxford University Press , 1991
vav90
Quadratic programming is in NP
Vavasis, S.
Information Processing Letters , Vol. 36 , pp. 73-77 , 1990
vavasis4
A simplification to ``A primal-dual interior point method whose
running time depends only on the constraint matrix''
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
url
Vial, J.
1996
Vial
Approximate projections in a projective method for the linear feasibility
problem
Vial, J.
pp. 65-78 , 1989
ViaSouMat03a
Using GRASP to solve the unit commitment problem
Viana, A.; de~Sousa, J. & Matos, M.
Annals of Operations Research , Vol. 120 , pp. 117-132 , 2003
vicente1
Bilevel and multilevel programming: a bibliography review
url
29.03.2006
JabRef Output
Vickrey, W.S.
Journal of Finance , Vol. 16 , pp. 8-37 , 1961
VieGon01a
Uma Nova Estratgia para Aplicao do GRASP ao problema de alocao
de canal
Vieira, C. & Gondim, P.
2001
villalobos2
The Sphere of Convergence of Newton's Method on Two Equivalent
Systems from Nonlinear Programming
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Voss88
A survey on some generalizations of Steiner's problem
Vo, S.
pp. 41-51 , 1990
VossDuin
Heuristic methods for the rectilinear Steiner arborescence problem
Vo, S. & Duin, C.
Engineering Optimization , Vol. 21 , pp. 121-145 , 1993
VossGuten
A chunking based genetic algorithm for the Steiner
tree problem in graphs
Vo, S. & Gutenschwager, K.
Vol. 40 , pp. 335-355 , 1998
VogFloLan02a
Initialisation des circuits squentiels avant test
intgr et scan partiel
Vogel, I.; Flottes, M. & Landrault, C.
2002
VogelHerrtwichKalfaWittigWolf1996
QoS-based routing of multimedia streams in computer networks
Vogel, R.; Herrtwich, R.; Kalfa, W.; Wittig, H. & Wolf, L.
IEEE Journal on Selected Areas in Communications , Vol. 14 , pp. 1235-1244 , 1996
VolgenantDuin04
On Steiner Versions of (bi)Connectivity in Network Problems
Volgenant, A. & Duin, C.
Graphs and Combinatorics , Vol. 20 , pp. 263-273 , 2004
29.03.2006
JabRef Output
vonH77
Simplicial decomposition in nonlinear programming algorithms
von~Hohenbalken, B.
Mathematical Programming , Vol. 13 , pp. 49-68 , 1977
Voss1999
The Steiner tree problem with hop constraints
Voss, S.
Annals of Operations Research , Vol. 86 , pp. 271-294 , 1999
Voss98
A Chunking Based Genetic Algorithm for the Steiner Tree Problem in
Graphs
Voss, S. & Gutenschwager, K.
Vol. 40 , pp. 335-355 , 1998
VosMarKoc
SteinLib Testdata Library
Voss, S.; Martin, A. & Koch, T.
VossCMST
Capacitated Minimum Spanning Trees
Vo}, S.
Vol. 1 , pp. 225-235 , 2001
VossStHOP
The Steiner tree problem with hop constraints
Vo}, S.
Annals of Operations Research , Vol. 86 , pp. 321-345 , 1999
vos96d
Dynamic tabu search strategies for the traveling purchaser problem
Vo}, S.
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
wachter1
Failure of Global Convergence for a Class of Interior Point Methods
for Nonlinear Programming
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
waltz1
KNITRO-Direct: a hybrid interior algorithm for nonlinear
optimization
url
29.03.2006
JabRef Output
Wan02b
Distributed Construction of Connected Dominating Set in Wireless Ad Hoc
Networks
Wan, P.; Alzoubi, K. & Frieder, O.
Proceedings of the Annual Joint Conference of the IEEE Computer and
Communications Societies , pp. 1597-1604 , 2002
Wan02a
Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks
Wan, P.; Calinescu, G.; Li, X. & Frieder, O.
Wireless Networks , Vol. 8 , pp. 607-617 , 2002
18wan
Grooming of arbitrary traffic in SONET/WDM BLSRs
Wan, P.; Calinescu, G.; Liu, L. & Frieder, O.
IEEE Journal on Selected Areas in Communications , Vol. 18 , pp. 1995 - 2003 , 2000
Wan04b
Minimum-Power Multicast Routing in Static Ad Hoc Wireless Networks
Wan, P.; Calinescu, G. & Yi, C.
IEEE/ACM Transactions on Networking , Vol. 12 , pp. 507-514 , 2004
WaYa00
Load-Balanced Routing in Counter Rotated SONET Rings
Wan, P. & Yang, Y.
Networks , Vol. 35 , pp. 279-286 , 2000
WanLiuFri99
Optimal Placement of Wavelength Converters in Trees, tree-connected
rings, and Tree of Rings
Wan, P.; Frieder, O. & Liu, L.
Computer Communications , Vol. 26 , pp. 718-722 , 2003
WLJ02
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
wwang1
Adaptive Use of Iterative Methods in Predictor-Corrector Interior Point
Methods for Linear Programming
Wang, W. & O'Leary, D.P.
1999
WangEtAl04
An Efficient Low-Degree RMST Algorithm for VLSI/ULSI Physical Design
Wang, Y.; Hong, X.; Jing, T.; Yang, Y.; Hu, X. & Yan, G.
pp. 442-452 , 2004
wang1
Nondegeneracy of polyhedra and linear programs
Wang, Y. & Monteiro, R.D.C.
1994
Wang04
PumaMart: A parallel and autonomous agents based Internet marketplace
Wang, Y.; Tan, K. & Ren, J.
Electronic Commerce Research and Applications , Vol. 3 , pp. 294-310 , 2004
Yufei-infocom2001
Internet Traffic Engineering without Full Mesh Overlaying
Wang, Y.; Wang, Z. & Zhang, L.
Proc. 20th IEEE Conference on Computer Communications (INFOCOM'2001) , pp.
565-571 , 2001
Wang2001
Internet QoS: Architectures and Mechanisms for Quality of Service
Wang, Z.
Morgan Kaufmann , 2001
WangCrowcroft1996
Quality-of-service routing for supporting multimedia applications
29.03.2006
JabRef Output
29.03.2006
JabRef Output
1995
warners4
A two-phase algorithm for solving a class of hard satisfiability problems
Warners, J.P. & van Maaren, H.
Operations Research Letters , Vol. 23 , pp. 81-88 , 1998
warners2
Potential reduction algorothms for structured combinatorial optimization
problems
Warners, J.P.; Terlaky, T.; Roos, C. & Jansen, B.
Operations Research Letters , Vol. 21 , pp. 55-64 , 1997
warners3
A potential reduction approach to the frequency assignment problem
Warners, J.P.; Terlaky, T.; Roos, C. & Jansen, B.
Discrete Applied Mathematics , Vol. 78 , pp. 251-282 , 1997
Wa91
An algorithm for designing rings for survivable fiber network
Wasem, O.
IEEE Transactions on Reliability , Vol. 40 , pp. 428-432 , 1991
WasemGrossTiapa1995
Forecasting broadband demand between geographic areas
Wasem, O.; Gross, A. & Tiapa, G.
IEEE Communications Magazine , Vol. 33 , pp. 50-57 , 1995
WaWuCa94
Survivable SONET Networks - Design Methodology
Wasem, O.; Wu, T. & Cardwell, R.
IEEE Journal on Selected Areas in Communications , Vol. 12 , pp. 205-212 , 1994
WatHirMik01
Parallel evolutionary multi-criterion optimization for mobile
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Wei81
A lower bound on the stability number of a simple graph
Wei, V.K.
1981
We85
Accelerating convergence of the Frank-Wolfe algorithm
Weintraub, A.; Ortiz, C. & Conzalez, J.
Transportation Research , Vol. 19B , pp. 113-122 , 1985
weintraub1
A cutting plane approach for chance constrained linear programs
Weintraub, A. & Vera, J.
Operations Research , Vol. 39 , pp. 776-785 , 1991
WEINTRAUB
Tables of Cumulative Binomial Probability Distribution for Small Values of
$p$
Weintraub, S.
Collier-Macmillan Limited , 1963
wei95
Algorithms, Data Structures, and Problem Solving with C++
Weis, M.A.
Addison-Wesley , 1995
weismantel1
On the 0/1 knapsack problem
Weismantel, R.
Mathematical Programming , Vol. 77 , pp. 49-68 , 1997
02weg
The value of system level integration
Wellbrock, G. & Guild, K.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
We02
Decomposition Schemes for the Traveling Salesman Subtour Problem
Westerlund, A.
2002
Westland92
Congestion and Network Externalities in the Short Run Pricing of
Information Services
Westland, J.C.
Management Science , Vol. 38 , pp. 992-1009 , 1992
00wes
ULH-optimized grooming in optical mesh networks
Weston-Dawkes, J.
Proceedings of the Optical Fiber Communication Conference (OFC 2002) , pp. 784 786 , 2002
02wes
The changing mix of protection and restoration mechanisms in core
optical mesh networks
Weston-Dawkes, J.
All-Optical Networking: Existing and Emerging Architecture and
Applications/Dynamic Enablers of Next-Generation Optical Communications
Systems/Fast Optical Processing in Optical Transmission/VCSEL and Microcavity
Lasers , pp. TuE3-29 - TuE3-30 , 2002
wets3
Stochastic programming: solution techniques and approximation schemes
Wets, R.J.
?? , Vol. ?? , pp. 566-603 , ??
wets4
Statistical estimation from an optimization viewpoint
Wets, R.J.
Annals of Operations Research , Vol. 84 , pp. 79-102 , 1998
29.03.2006
JabRef Output
wets1
Challenges in stochastic programming
Wets, R.J.
Mathematical Programming , Vol. 75 , pp. 115-135 , 1996
wets2
Stochastic programs with fixed recourse: the equivalent deterministic
program
Wets, R.J.
SIAM Review , Vol. 16 , pp. 309-339 , 1974
Mend90
Optimal Incentive-Compatible Priority Pricing for the M/M/1 Queue
Whang, S. & Mendelson, H.
Operations Research , Vol. 38 , pp. 870-883 , 1990
Whi83
A Fast Algorithm for the Greedy Interchange of Large-Scale Clustering and
Median Location Problems
Whitaker, R.
INFOR , Vol. 21 , pp. 95-108 , 1983
WhMaSm99
Genetic algorithms and network ring design.
White, A.; Mann, J. & Smith, G.
Annals of Operations Research , Vol. 86 , pp. 347-371 , 1999
white1
A linear programming approach to solving bilinear programmes
White, D.J.
Mathematical Programming , Vol. 56 , pp. 45-50 , 1992
White
A quadratic facility location problem
29.03.2006
JabRef Output
White, J.A.
AIIE Transactions , Vol. 3 , pp. 156-157 , 1971
rel90-1
Reliability computations for planar networks
Whited, D.; Shier, D. & Jarvise, J.
ORSA Journal on Computing , Vol. 2 , pp. 46-60 , 1990
03whi
The role of SONET-based networks in British Telecom
Whitt, S.; Hawker, I. & Callaghan, J.
SUPERCOMM/ICC '90 , Vol. 3 , pp. 919 - 923 , 1990
whi84
On approximation for queues, I: Extremal distributions
Whitt, W.
AT&T Bell Laboratories Technical Journal , Vol. 63 , pp. 115-138 , 1984
WC95
A Delay-Constrained Distributed Multicast Routing Algorithm
Wi, S. & Choi, Y.
Proceeding of the Twelfth International Conference on Computer Communication
(ICCC'95) , pp. 883-838 , 1995
02wid
A new approach for automatic grooming of SONET circuits to optical
express links
Widjaja, I.; Saniee, I.; Qian, L.; Elwalid, A.; Ellson, J. & Cheng, L.
ICC '03 , Vol. 2 , pp. 1407 - 1411 , 2003
Widmayer
Fast approximation algorithms for Steiner's problem in graphs
P. Widmayer
Institut fr Angewandte Informatik und formale Beschreibungsverfahren, University
29.03.2006
JabRef Output
Karlsruhe , 1986
W94
The Design and Evaluation of Routing Algorithms for Real-Time Channels
Widyono, R.
1994
Wieselthier02
Energy-Efficient Broadcast and Multicast Trees in Wireless Networks
Wieselthier, J.; Nguyen, G. & Ephremides, A.
Mobile Networks and Applications , Vol. 7 , pp. 481-492 , 2002
Wilf67
The eigenvalues of a graph and its chromatic number
Wilf, H.S.
J. London Math. Soc. , Vol. 42 , pp. 330-332 , 1967
WilWin98
Ring Routing and Wavelength Translation
Wilfong, G. & Winkler, P.
Proc. 9th ACM-SIAM Symposium on Discrete Algorithms , pp. 333-341 , 1998
willemain1
Model formulation: what experts think about and when
Willemain, T.R.
Operations Research , Vol. 43 , pp. 916-932 , 1995
willemain3
Insights on modeling from a dozen experts
Willemain, T.R.
Operations Research , Vol. 42 , pp. 213-222 , 1994
willenborg2
Elements of Statistical Disclosure Control
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
des86-2
Generalized Steiner problem in series-parallel
networks
Winter, P.
Journal of Algorithms , Vol. 7 , pp. 549-566 , 1986
Wi86
Generalized Steiner Problem in Series-Parallel Networks
Winter, P.
Journal of Algorithms , Vol. 7 , pp. 549-566 , 1986
des85-2
Generalized Steiner problem in outerplanar networks
Winter, P.
BIT , Vol. 25 , pp. 485-496 , 1985
des85-3
Generalized Steiner problem in Halin networks
Winter, P.
Proc. 12th International Symposium on Mathematical
Programming
, 1985
Winter
An algorithm for the Steiner problem in the Euclidean plane
Winter, P.
Networks , Vol. 15 , pp. 323-345 , 1985
WinterMGSmith
Path-distance heuristics for the Steiner problem in undirected networks
Winter, P. & Smith, J.M.
29.03.2006
JabRef Output
29.03.2006
JabRef Output
Wolff82
Poisson Arrivals See Time Averages
Wolff, R.
Operations Research , Vol. 30 , pp. 223-231 , 1982
wolkowicz3
Simple Efficient Solutions for Semidefinite Programming
url
Wolkowicz, H.
2001
wolkowicz5
Semidefinite programming for discrete optimization and matrix
completion problems
Wolkowicz, H. & Anjos, M.F.
Discrete Applied Mathematics , Vol. 123 , pp. 513-577 , 2002
wolkowicz1
Semidefinite programming relaxations for the graph partitioning
problem
url
url
29.03.2006
JabRef Output
Integer Programming
Wolsey, L.A.
John Wiley , 1998
wolsey1
MIP modelling of changeovers in production planning and scheduling
problems
Wolsey, L.A.
European J. Oper. Res , Vol. 99 , pp. 154-165 , 1997
wolsey2
Valid inequalities for mixed integer programs with generalized and
variable upper bound constraints
Wolsey, L.A.
Discrete Applied Mathematics , Vol. 25 , pp. 251-261 , 1990
Wolsey98
Integer Programming
Wolsey, L.
John Wiley and Sons , 1998
Wo89
Submodularity and Valid Inequalities in Capacitated Fixed Charge
Networks
Wolsey, L.
Operations Research Letters , Vol. 8 , pp. 119-124 , 1989
Wong84
A dual ascent approach for Steiner tree problems on a directed graph
Wong, R.T.
Mathematical Programming , Vol. 28 , pp. 271-287 , 1984
Wo84
A Dual Ascent Algorithm for the Steiner Problem in Directed Graphs
29.03.2006
JabRef Output
Wong, R.
Mathematical Programming , Vol. 28 , pp. 271-287 , 1984
Wong
Steiner Tree Oriented Placement
Wong, Y. T.
Department of Mechanical Engineering, University of Maryland , 1988
WongPecht
A solution for Steiner's problem
Wong, Y.T. & Pecht, M.
pp. 261-304 , 1993
WongPechtJEP
Approximating the Steiner tree in the placement process
Wong, Y.T. & Pecht, M.
Journal of Electronic Packaging , Vol. 111 , pp. 228-235 , 1989
Wood04
Current and future insights from online auctions
Wood, C.A.
2004
Wood86
Factoring algorithms for computing K-terminal network reliability
Wood, R.
IEEE Transactions on Reliability , Vol. R-35 , pp. 269-78 , 1986
Woolston
The design of centralized networks with reliability and availability
constraints
Woolston, K. & Albin, S.
Computers & Operations Research , Vol. 15 , pp. 207-217 , 1988
29.03.2006
JabRef Output
WoolstonAlbin1988
The design of centralized networks with reliability and availability
constraints
Woolston, K. & Albin, S.
Computers and Operations Research , Vol. 15 , pp. 207-217 , 1988
mwright4
What, if anything, is new in optimization?
url
Wright, M.H.
2000
mwright2
Ill-Conditioning and Computational Error in Interior Methods for
Nonlinear Programming
url
Wright, M.H.
SIAM Journal on Optimization , Vol. 9 , pp. 84-111 , 1999
mwright3
The Interior-Point Revolution in Constrained Optimization
url
Wright, M.H.
1998
mwright1
Why a pure Newton barrier step may be infeasible
Wright, M.H.
SIAM Journal on Optimization , Vol. 5 , pp. 1-12 , 1995
swright5
On the convergence of the Newton/log-barrier method
url
Wright, S.
Mathematical Programming , Vol. 90 , pp. 71-100 , 2001
swright11
Recent developments in interior point methods
url
29.03.2006
JabRef Output
Wright, S.
pp. 311-333 , 2000
swright13
Optimization on computational grids
url
Wright, S.
2000
swright2
Modified Cholesky Factorizations in Interior-Point Algorithms for
Linear Programming
url
Wright, S.
SIAM Journal on Optimization , Vol. 9(4) , pp. 1159-1191 , 1999
swright8
Effects of finite-precision arithmetic on interior-point methods for
nonlinear programming
url
Wright, S.
1998
swright7
Modifying SQP for Degenerate Problems
url
Wright, S.
1997
swright6
Primal-dual interior point methods
Wright, S.
SIAM , 1996
swright3
Stability of augmented system factorizations in interior-point
methods
url
Wright, S.
29.03.2006
JabRef Output
1994
swright9
The role of linear objective functions in barrier methods
Wright, S. & Jarre, F.
Mathematical Programming , Vol. 84 , pp. 357-373 , 1999
swright10
Properties of the log-barrier function on degenerate nonlinear
programs
url
url
Wright, S.J.
Mathematical Programming , Vol. 95 , pp. 137-160 , 2003
swright14
On reduced convex QP formulations of monotone LCPs
Wright, S.J.
Mathematical Programming , Vol. 90 , pp. 459-473 , 2001
29.03.2006
JabRef Output
WuChao04
Spanning Trees and Optimization Problems
Wu, B.Y. & Chao, K.
Chapman and Hall / CRC , 2004
Wu02
Extended Dominating-Set-Based Routing in Ad Hoc Wireless Networks
with Unidirectional Links
Wu, J.
IEEE Transactions on Parallel and Distributed Computing , Vol. 22 , pp. 327-340 ,
2002
wu01dominatingsetbased
A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks
Wu, J. & Li, H.
Telecommunication Systems , Vol. 18 , pp. 13-36 , 2001
Wu00
Domination and Its Applications in Ad Hoc Wireless Networks with
Unidirectional Links
Wu, J. & Li, H.
Proceedings of the International Conference on Parallel Processing , pp. 189-197 ,
2000
WL99
On calculating connected dominating set for efficient routing in ad hoc
wireless networks
Wu, J. & Li, H.
Proceedings of the Third International Workshop on Discrete Algothrithms and
Methods for MOBILE Computing and Communications , pp. 7-14 , 1999
Wu99
On Calculating Connected Dominating Set for Efficient Routing in Ad Hoc
Wireless Networks
Wu, J. & Li, H.
Proceedings of the international workshop on Discrete algorithms and methods for
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
XuChi01a
Effective heuristic procedure for a field technician
url
scheduling problem
Xu, J. & Chiu, S.
Journal of Heuristics , Vol. 7 , pp. 495-509 , 2001
XuChi98a
Effective heuristic procedure for a field technician scheduling problem
Xu, J. & Chiu, S.
1998
XuChiu96a
Solving a real-world field technician scheduling problem
Xu, J. & Chiu, S.
Proceedings of the International Conference on
Management Science and the Economic Development of China
, pp. 240-248 , 1996
jxu2
Optimizing a ring-based private line telecommunication network using
tabu search
Xu, J.; Chiu, S.Y. & Glover, F.
Management Science , Vol. 45(3) , pp. 330-345 , 1999
jxu1
Tabu search for dynamic routing communications network design
Xu, J.; Chiu, S.Y. & Glover, F.
Telecommunications Systems , Vol. 8 , pp. 55-77 , 1997
XuChGl99
Optimizing a Ring-based Private Line Telecommunication Network Using
Tabu Search
29.03.2006
JabRef Output
29.03.2006
JabRef Output
2002
sxu2
url
The Global Linear Convergence of an Infeasible Non-Interior PathFollowing Algorithm for Complementarity Problems with Uniform PFunctions
Xu, S.
1996
sxu1
A Polynomial Time Interior-Point Path Following Agorithm for LCP
Based on Chen-Harker-Kanzow Smoothing Techniques
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
Yates95
A framework for uplink power control in cellular radio systems
Yates, R.
IEEE J. Sel. Areas Commun. , Vol. 13 , pp. 1341-1347 , 1995
YH95
Integrated power control and base station assignment
Yates, R. & Huang, C.
IEEE Trans. Veh. Techn. , Vol. 44 , pp. 638-644 , 1995
ye:2003
A Recursive Random Search Algorithm for Large-Scale Network
Parameter Configuration
Ye, T. & Kalyanaraman, S.
Proc. ACM SIGMETRICS , 2003
Ye5
A ``build-down'' scheme for linear programming
Ye, Y.
Mathematical Programming , to appear
ye23
Improved complexity results on solving real-number linear
feasibility problems
url
Ye, Y.
2002
ye16
A .699-Approximation Algorithm for Max-Bisection
url
Ye, Y.
Mathematical Programming , Vol. 90 , pp. 101-111 , 2001
ye11
Approximating quadratic programming with bound and quadratic
constraints
url
29.03.2006
JabRef Output
Ye, Y.
Mathematical Programming , Vol. 84 , pp. 219-226 , 1999
ye12
On the complexity of approximating a KKT point of quadratic
programming
Ye, Y.
Mathematical Programming , Vol. 80 , pp. 195-211 , 1998
ye15
Approximating global quadratic optimization with convex
quadratic constraints
url
Ye, Y.
1998
Ye10
On homogeneous and self-dual algorithms for LCP
Ye, Y.
Mathematical Programming , Vol. 76 , pp. 211-221 , 1997
ye13
Approximating quadratic optimization with linear and boolean
constraints
url
Ye, Y.
1997
ye14
Interior Point Algorithms: Theory and Analysis
Ye, Y.
John Wiley , 1997
ye8
Complexity analysis of the analytic center cutting plane method that uses
multiple cuts
Ye, Y.
29.03.2006
JabRef Output
url
Ye, Y.
1996
ye
A new complexity result on minimization of a quadratic function with a
sphere constraint
Ye, Y.
pp. 19-31 , 1992
Ye6
A potential reduction algorithm allowing column generation
Ye, Y.
SIAM Journal on Optimization , Vol. 2 , pp. 7-20 , 1992
Ye915
On the finite convergence of interior-point algorithms for linear
programming
Ye, Y.
Mathematical Programming , Vol. 57 , pp. 325-335 , 1992
Ye3
An $O(n^3L)$ potential reduction algorithm for linear programming
Ye, Y.
Mathematical Programming , Vol. 50(2) , pp. 239-258 , 1991
Ye4
Recovering optimal basic variables in Karmarkar's polynomial algorithm
for linear programming
Ye, Y.
Mathematics of Operations Research , Vol. 15(3) , pp. 564-572 , 1990
29.03.2006
JabRef Output
Ye2
An extension of Karmarkar's algorithm and the trust region method for
quadratic programming
Ye, Y.
pp. 49-64 , 1989
Ye0
Interior algorithms for linear, quadratic, and linearly constrained convex
programming
Y. Ye
Department of Engineering--Economic Systems, Stanford University , 1987
Ye1
Karmarkar's algorithm and the ellipsoid method
Ye, Y.
Operations Research Letters , Vol. 6(4) , pp. 177-182 , 1987
ye03
Algorithms for the Design of WDM Translucent Optical Networks
Ye, Y.; Chai, T.; Cheng, T. & Lu, C.
Optics Express , Vol. 11 , 2003
Ye9114
A quadratically convergent $O(nL)$--iteration algorithm for linear
programming
Ye, Y.; Gler, O.; Tapia, R.A. & Zhang, Y.
Mathematical Programming , Vol. 59 , pp. 151-162 , 1993
YeK1
Recovering Optimal Dual Solutions in Karmarkar's Polynomial Algorithm
for Linear Programming
Ye, Y. & Kojima, M.
Mathematical Programming , Vol. 39(3) , pp. 305-317 , 1987
YePar1
29.03.2006
JabRef Output
url
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
yen71
Finding the K Shortest Loopless Paths In a Network
Yen, J.
Management Science , Vol. 17 , pp. 712-716 , 1971
Yeo02
An efficient broadcast scheduling algorithm for TDMA ad hoc networks
Yeo, J.; Lee, H. & Kim, S.
Computers and Operations Research , Vol. 29 , pp. 1793-1806 , 2002
yildirim1
Sensitivity analysis in linear programming and semidefinite
programming using interior-point methods
url
url
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
D. Yuan
Division of Optimization, Department of Mathematics, Linkping University , 2001
YuNe
Informational complexity and efficient methods for the solution of convex
extremal problems
Yudin, D.B. & Nemirovskii, A.S.
konomika i Matematicheskie metody , Vol. 12 , pp. 357-369 , 1976
YCL95
Video bandwidth allocation for multimedia teleconferences
Yum, T.; Chen, M. & Leung, Y.
IEEE Trans. on Commun. , Vol. 43 , pp. 457-465 , 1995
yildirim4
An interior-point perspective on sensitivity analysis in semidefinite
programming
url
Y}ld}r}m, E.A.
2001
yildirim5
On sensitivity analysis in conic programming
url
Y}ld}r}m, E.A.
2001
zabinsky1
Pure adaptive search in global optimization
Zabinsky, Z.B. & Smith, R.L.
Mathematical Programming , Vol. 53 , pp. 323-338 , 1992
Zach01
The rectilinear Steiner problem: A Tutorial
Zachariasen, M.
pp. 467-507 , 2001
29.03.2006
JabRef Output
Zachariasen99
Rectilinear Full Steiner Tree Generation
Zachariasen, M.
Networks , Vol. 33 , pp. 125-143 , 1999
ZachariasenRohe03
Rectilinear group Steiner trees and applications in VLSI design
Zachariasen, M. & Rohe, A.
Mathematical Programming , Vol. 94 , pp. 407-433 , 2003
zad73
On building minimum cost communication networks
Zadeh, N.
Networks , Vol. 3 , pp. 315-331 , 1973
eva10
Treatment Planning for Prostate Implants Using MR Spectroscopy
Imaging
Zaider, M.; Zelefsky, M.; Lee, E.K.; Zakian, K.; Amols, H.A.; Dyke, J. &
Koutcher, J.
International Journal of Radiation Oncology, Biology and Physics , Vol. 47 , pp. 10851096 , 2000
zaman1
Review of the academic evidence on the relationship between
teaching and research in higher education
url
Zaman, M.Q.u.
2004
zan00
A Review of Routing and Wavelength Assignment Approaches for
Wavelength-routed Optical WDM Networks
Zang, H.; Jue, J.P. & Mukherjee, B.
Optical Networks Magazine , pp. 47-60 , 2000
29.03.2006
JabRef Output
Za69
Minimum Concave Cost Flows in Certain Networks
Zangwill, W.
Management Science , Vol. 14 , pp. 429-450 , 1969
Za67
The convex simplex method
Zangwill, W.
Management Science , Vol. 14 , pp. 221-283 , 1967
zegura
GT-ITM: Georgia Tech internetwork topology models (software)
Zegura, E.
1996
zeguraetal
How to model an internetwork
Zegura, E.; Calvert, K. & Bhattacharjee, S.
Proceedings of 15th IEEE Conf. on Computer Communications (INFOCOM) , pp. 594602 , 1996
Zelikovsky97
A series of approximation algorithms for the acyclic directed Steiner tree
problem
Zelikovsky, A.
Algorithmica , Vol. 18 , pp. 99-110 , 1997
Zelikovsky94
A polynomial-time subpolynom-approximation scheme for the acyclic
directed Steiner tree problem
Zelikovsky, A.
1994
Zelikovsky93
An $11/6$-approximation algorithm for the network Steiner problem
29.03.2006
JabRef Output
Zelikovsky, A.Z.
Algorithmica , Vol. 9 , pp. 463-470 , 1993
ZelikovskyIPL
A faster approximation algorithm for the Steiner tree problem in graphs
Zelikovsky, A.Z.
Information Processing Letters , Vol. 46 , pp. 79-83 , 1993
ZelikovskyConf
An $11/6$-approximation algorithm for the Steiner problem on graphs
Zelikovsky, A.Z.
Proceedings of the Fourth Czechoslovakian Symposium on Combinatorics, Graphs, and
Complexity , pp. 351-354 , 1992
Zelikovsky2
A faster approximation algorithm for the Steiner tree problem in graphs
Zelikovsky, A.
Information Processing Letters , Vol. 46 , pp. 79-83 , 1993
Zelikovsky92
An $116$-approximation algorithm for the Steiner problem on graphs
Zelikovsky, A.
pp. 351-354 , 1992
zenios1
Asset/liability management under uncertainty for fixed income securities
Zenios, S.A.
Annals of Operations Research , Vol. 59 , pp. 77-98 , 1995
ZennerEtAl03
Emerging Uses of SIP in Service Provider Networks
Zenner, G.; Jones, M. & Patel, A.
Bell Labs Technical Journal , Vol. 8 , pp. 43-63 , 2003
29.03.2006
JabRef Output
Zhang2
Finding critical independent sets and critical vertex subsets are
polynomial problems
Zhang, C.
SIAM J. Discrete Mathematics , Vol. 3 , pp. 431-438 , 1990
zhang6
On Constructing Interior-Point Path-Following Methods for Certain
Semimonotone Linear Complementarity Problems
url
url
url
29.03.2006
JabRef Output
szhang2
Quadratic minimization and semidefinite relaxation
Zhang, S.
Mathematical Programming , Vol. 87(3) , pp. 453-465 , 2000
szhang3
Global error bounds for convex conic problems
Zhang, S.
SIAM Journal on Optimization , Vol. 10(3) , pp. 836-851 , 2000
szhang1
On the strictly complementary slackness relation in linear programming
Zhang, S.
pp. 347-361 , 1994
21shu
Dynamic traffic grooming algorithms for reconfigurable SONET over
WDM networks
Zhang, S. & Ramamurthy, B.
IEEE Journal on Selected Areas in Communications , Vol. 21 , pp. 1165 - 1172 , 2003
03shu
Dynamic traffic grooming algorithms for reconfigurable SONET over
WDM networks
Zhang, S. & Ramamurthy, B.
Proceedings IEEE Global Telecommunications Conference (GLOBECOM 2002) , Vol.
3 , pp. 2716 - 2720 , 2002
08zha
An effective and comprehensive approach for traffic grooming and
wavelength assignment in SONET/WDM rings
Zhang, X. & Qiao, C.
IEEE/ACM Transactions on Networking , Vol. 8 , pp. 608 - 617 , 2000
zha00
An Effective and Comprehensive Approach for Traffic Grooming and
29.03.2006
JabRef Output
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
url
Zhao, G.
1997
zhao1
Interior Point Methods With Decomposition For Linear Programs
url
Zhao, G.
1996
zhao2
On the rate of local convergence of high-order infeasible-pathfollowing algorithms for $P_*$-LCP with or without strictly
complementary solutions
url
29.03.2006
JabRef Output
url
Q. Zhao
Combinatorics and Optimization, University of Waterloo , 1996
yzhao1
A stochastic programming model using an endogenously determined worst
case risk measure for dynamic asset allocation
Zhao, Y. & Ziemba, W.T.
Mathematical Programming , Vol. 89 , pp. 293-309 , 2001
zhemin03
Traffic Grooming in optical WDM mesh networks using the blocking island
paradigm
Zhemin, D. & Hamdi, M.
Optical Networks Magazine , Vol. 4 , pp. 7-13 , 2003
03ding
Clustering techniques for traffic grooming in optical WDM mesh networks
Zhemin, D. & Hamdi, M.
Proceedings IEEE Global Telecommunications Conference (GLOBECOM 2002) , Vol.
3 , pp. 2711 - 2715 , 2002
zhe04
Optical WDM Networks
29.03.2006
JabRef Output
29.03.2006
JabRef Output
doi
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
29.03.2006
JabRef Output
ATM~Forum~Technical~Committee
April 2002
Batc99
Ultra high capacity optical transmission networks, Final report of action
COST 239
Batchelor~et~al., P.
Faculty of Electrical Engineering and Computing , 1999
Caf00
Wireless Location in CDMA Cellular Radio Systems
Caffery~Jr., J.
Kluwer Academic Publishers , 2000
CandiaVejarBravoAzlan04
Performance Analysis of Algorithms for the Steiner Problem in Directed
Networks
Candia-Vejar, A. & Bravo-Azlan, H.
Electronic Notes in Discrete Mathematics , Vol. 18 , pp. 67-72 , 2004
CastroMartins03
International differences in telecommunications demand
Martins, M.C.
Information Economics and Policy , Vol. 15 , pp. 291-303 , 2003
netflow
Netflow, C.
cisco01
Comparing Metro WDM Systems: Unidirectional vs. Bidirectional
Implementations
Systems, C.
2001
CISCOOSPF
29.03.2006
JabRef Output
url
Cisco~Systems~Inc.
2001
CLW
Optimal Robot Scheduling for Web Search Engines
Coffman Jr., E.G.; Liu, Z. & Weber, R.
Journal of Scheduling , Vol. 1 , pp. 15-29 , 1998
Coffman98
Optimal Robot Scheduling for Web Search Engines
Coffman Jr., E.; Liu, Z. & Weber, R.
Journal of Scheduling , Vol. 1 , pp. 14-22 , 1998
CPLEX93
Using the CPLEX(TM) Callable Library and CPLEX (TM) Mixed Integer
Library (Version 2.1)
CPLEX~Optimization, ~.
1993
daSilvaEtAl01
Transmission Network Expansion Planning Under a Tabu Search
Approach
da Silva, E.; Ortiz, J.; de Oliveira, G. & Binato, S.
IEEE Transactions on Power Systems , Vol. 16 , pp. 62-68 , 2001
xpress
XPRESS-MP
Dash Associates, L.
deGiovanniEtAl04
On the Impact of the Solution Representation for the Internet Protocol
Network Design Problem with Max-Hop Constraints
Giovanni, L.D.; Croce, F.D. & Tadei, R.
29.03.2006
JabRef Output
url
Simone, C.D.; Diehl, M.; Jnger, M.; Mutzel, P.; Reinelt, G. & Rinaldi, G.
Journal of Statistical Physics , Vol. 84 , pp. 1363-1371 , 1996
desimone1
Exact ground states of Ising spin glasses: New experimental results with a
branch and cut algorithm
Simone, C.D.; Diehl, M.; Jnger, M.; Mutzel, P.; Reinelt, G. & Rinaldi, G.
Journal of Statistical Physics , Vol. 80 , pp. 487-496 , 1995
VecianaEtAl
Routing and Provisioning VPNs based on Hose Traffic Models and/or
Constraints
de Veciana, G.; Park, S.; Sang, A. & Weber, S.
VicenteEtAl99
Placement Optimization Based on Global Routing Updating for System
Partitioning onto Multi-FPGA Mesh Topologies
de Vicente, J.; Lanchares, J. & Hermida, R.
pp. 91-101 , 1999
deVries-etal-2003
On Ascending Auctions for Heterogeneous Objects
de Vries, S.; Schummer, J. & Vohra, R.V.
2003
DS2
A View of Unconstrained Optimization
Dennis Jr., J.E. & Schnabel, R.
pp. 1-72 , 1989
DidiBihaEtAl01
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
GrotschelMartinWeismantel1
Packing Steiner trees: Polyhedral investigations
url
url
29.03.2006
JabRef Output
Problem
Kruskal Jr., J.
Proc. Amer. Math. Society , Vol. 7 , pp. 48-50 , 1956
Kuechler01
Supporting optimization of business-to-business e-commerce
relationships
Kuechler~Jr., W.; Vaishnavi, V.K. & Kuechler, D.
Decision Support Systems , Vol. 31 , pp. 363-377 , 2001
Ladeiradematos
A rectilinear arborescence problem
R. R. Ladeira de Matos
Department of Something, University of Alabama , 1979
bellabs
http://www.bell-labs.com/technology/lightwave/research.html
Lucent~Technologies
2002
MandoiuZelikovsky00
A note on the MST heuristic for bounded edge-length Steiner trees with
minimum number of Steiner points
andoiu, I.M. & Zelikovsky, A.
Information Processing Letters , Vol. 75 , pp. 165-167 , 2000
maple601
Maple 6.01. Waterloo Maple
Maple
PromelSteger02
The Steiner Tree Problem
Prmel, H.J. & Steger, A.
Vieweg , 2002
29.03.2006
JabRef Output
PromelSteger
RNC-approximation algorithms for the Steiner problem
Prmel, H.J. & Steger, A.
Vol. 1200 , pp. 559-570 , 1997
RodriguezMartinSalazarGonzalez04
Decomposition Approaches for a Capacitated Hub Problem
Rodrguez-Martn, I. & Salazar-Gonzlez, J.
2004
S93
Multicast in the Asynchronous Transfer Mode Environment
J.M. Simon~Doar
St. John's College, University of Cambridge , 1993
T98
OSPF network design solutions
Thomas~II, T.
Cisco Systems , 1998
Trot73
Solution characteristics and algorithms for the
vertex packing problem
Trotter Jr., L.
1973
Bureau00
Measuring electronic business: Definitions, underlying concepts and
measurement plans
United~States~Bureau~of~Census
2000
weston02
29.03.2006
JabRef Output
url
Kluwer , 2004
Sim
Handbook of Quantitative Supply Chain Analysis: Modeling in the EBusiness Era
29.03.2006
JabRef Output
url
Kluwer , 2004
CHD03
Ad Hoc Wireless Networking
Kluwer Academic Publisher , 2003
iec
http://www.iec.org/online/tutorials
2003
Nag6
Innovations in Financial and Economic Networks
Edward Elgar Publishing , 2003
abello1
Handbook of Massive Data Sets
url
29.03.2006
JabRef Output
url
29.03.2006
JabRef Output
url
url
29.03.2006
JabRef Output
DP98
Network Design: Connectivity and Facilities Location
American Mathematical Society , 1998
EriTel98
Understanding telecoummunications, vol.~2
Studentlitteratur, Lund, Sweden , 1998
Haynes98adv
Domination in Graphs: Advanced Topics
Marcel Dekker Inc. , 1998
migdalas1
Multilevel optimization: algorithms and applications
Kluwer Academic Publishers , 1998
PDP98
Multichannel Optical Networks: Theory and Practice
American Mathematical Society , 1998
ziemba1
Worldwide asset and liability modeling
Cambridge University Press , 1998
APP
Multilevel optimization -- Algorithms and applications
Kluwer Academic Publishers , 1997
EriTel97
Understanding telecoummunications, vol.~1
Studentlitteratur, Lund, Sweden , 1997
ferris3
Complementarity and Variational Problems: State of the Art
Society of Industrial and Applied Mathematics , 1997
29.03.2006
JabRef Output
local-search97-1
Local Search in Combinatorial Optimization
John Wiley & Sons Ltd. , 1997
jt
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation
Challenge
American Mathematical Society , 1996
BMMN95a
Network Models
Elsevier , 1995
BMMN95b
Network Routing
Elsevier , 1995
horp95
Handbook of Global Optimization
Kluwer , 1995
aidarous94
Telecommunications Network Management into the 21st Century
IEEE Press , 1994
du2
Advances in Optimization and Approximation
Kluwer Academic Publishers , 1994
Michie94
Machine learning, neural and statistical classification
Ellis Horwood , 1994
DP93a
Network Optimization Problems: Algorithms, Complexity and
Applications
29.03.2006
JabRef Output
29.03.2006
JabRef Output
fminconweb
The MathWorks Matlab Optimization Toolbox - fmincon
internet
http://www.telcite.fr
MATLAB
The MathWorks Matlab webpage
web1
Internet domain survey: Number of Internet hosts
wwwmarket
Market Topology
Xpress01
Dash Optimization. Xpress
29.03.2006
http://www.springer.com/978-0-387-30662-9