0387306625 Bibliography

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.; González, 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

Seite 1 von 1042JabRef Output

29.03.2006file://E:\Dokumente und Einstellungen\pralink_op\Desktop\temp_downloads\HOT-bi...

BL2000 A relax and cut algorithm for the traveling salesman problem

A.~Belloni & A.~Lucena

2000

BelSag2004 Dynamic Bundle Methods

A.~Belloni & C.~Sagastizábal

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



experience

Aardal, K.


aardal2 Market split and basis reduction: towards a solution of the Cornuéjols-Dawande 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.


aardal4 Preface: algebraic and geometric methods in discrete optimization

Aardal, K. & Thomas, R.R.



Mathematical Programming , Vol. 96 , pp. 179 , 2003

AardalvanHoeselKosterManninoSassano2001 Models and solution techniques for frequency assignmentproblems

Aardal, K.I.; van Hoesel, S.P.M.; Koster, A.M.C.A.; Mannino, C. & Sassano, A.

2001

AaHiHo95 A branch-and-cut algorithm for the frequency assignment problem

Aardal, K.; Hipolito, A.; van Hoesel, C. & Jansen, B.

1996

AarKor02 Selected topics in simulated annealing

Aarts, E. & Korst, J.

pp. 1-37 , 2002

AartsKorst89 Simulated Annealing and Boltzmann Machines


John Wiley and Sons Incorporated , 1989

AaKo89 Simulated annealing and Boltzmann machines: A stochastic approach to combinatorial optimization and neural computing


Wiley , 1989

AL97 Local Search in Combinatorial Optimization

Aarts, E. & Lenstra, J.

Wiley-Interscience , 1997

abbas1



Bioinformatics and management science: some common tools and techniques

Abbas, A.E. & Holmes, S.P.


HelHad00 Tabu search based heuristics for multi-floor facility

layout

Abdinnour-Helm, S. & Hadley, S.

International Journal of Production Research , Vol. 38 , pp. 365-383 , 2000

Abe1997 Residential broadband

Abe, G.

Macmillan Technical Publishing , 1997

abw A functional approach to external graph algorithms

Abello, J.; Buchsbaum, A. & Westbrook, J.

Vol. 1461 , pp. 332-343 , 1998

AbelloA01 Finding independent sets in a graph using continuous multivariable polynomial formulations

Abello, J.; Butenko, S.; Pardalos, P. & Resende, M.

Journal of Global Optimization , Vol. 21 , pp. 111-137 , 2001

AbParRes On Maximum Clique Problems in Very Large Graphs

Abello, J.; Pardalos, P.M. & Resende, M.G.C.

Vol. 50 , pp. 119-130 , 1999

AbeParEs99



On maximum clique problems in very large graphs

Abello, J.; Pardalos, P. & Resende, M.

Vol. 50 , pp. 119-130 , 1999

AbeParRes99a On maximum clique problems in very large graphs

Abello, J.; Pardalos, P. & Resende, M.

Vol. 50 , pp. 199-130 , 1999

AbeResSud02 Massive quasi-clique detection

Abello, J.; Resende, M. & Sudarsky, S.

Lecture Notes in Computer Science , Vol. 2286 , pp. 598-612 , 2002

AbeResSud02a Massive quasi-clique detection

Abello, J.; Resende, M. & Sudarsky, S.


AbeSta02 Inter-redes IP baseadas em redes Óticas

Abelém, A. & Stanton, M.

Anais de Minicursos de 20º Simpósio Brasileiro de Redes de Computadores , pp. 63-123 , 2002

Aboelfotoh89 Series-parallel bounds for the two-terminal reliability problem

Aboelfotoh, H. & Colbourn, C.

ORSA Journal on Computing , Vol. 1 , pp. 209-22 , 1989

AboElFotoh89a Computing 2-terminal reliability for radio-broadcast networks

AboElFotoh, H. & Colbourn, C.

IEEE Transactions on Reliability , Vol. 38 , pp. 538-55 , 1989



AboElFotoh01 A neural approach to topological optimization of communication networks, with reliability constraints

AboElFotoh, H. & Al-Sumait, L.


aboudi1 A facet generation and relaxation technique applied to an assignment problem with side constraints

Aboudi, R.; Hallefjord, .. & Jörnsten, 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

Adam, N.B. & Wortmann, J.C.

ACM Computing Surveys , Vol. 21 , pp. 515-556 , 1989

url



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.


adams2 On the equivalence between roof duality and Lagrangian duality for unconstrained 0-1 quadratic programming problems

Adams, W.P. & Dearing, P.M.


adams1 Persistency in 0-1 polynomial programming

Adams, W.P.; Lassiter, J.B. & Sherali, H.D.


adams4 Linearization strategies for a class of zero-one mixed integer programming problems

Adams, W.P. & Sherali, H.D.


adcock1 A simple algorithm to incorporate transactions costs in quadratic optimization



Adcock, C.J. & Meade, N.


adelman1 Allocating fibers in cable manufacturing

Adelman, D.; Nemhauser, G.L.; Padron, M.; Stubbs, R. & Pandit, R.

Manufacturing and Service Operations Management , Vol. 1 , pp. 21-35 , 1999

AdelsteinRichardSchwiebert03 Distributed multicast tree generation with dynamic group membership

Adelstein, F.; Richard, G. & Schwiebert, L.

Computer Communications , Vol. 26 , pp. 1105-1128 , 2003

adjiman2 A global optimization method, $$BB, for general twice-differentiable constrained NLPs --- I. Theoretical advances

Adjiman, C.S.; Androulakis, I.P. & Floudas, C.A.

Computers and Chemical Engineering , Vol. 22 , pp. 1137-1158 , 1998

adjiman3 A global optimization method, $$BB, for general twice-differentiable constrained NLPs --- II. Implementation and computational results



adjiman1 Global optimization of MINLP problems in process synthesis and design


Computers and Chemical Engineering , Vol. 21 , pp. S445-S450 , 1997

adler4 Baseball, optimization, and the world wide web

Adler, I.; Erera, A.L.; Hochbaum, D.S. & Olinick, E.V.

Interfaces , Vol. 32 , pp. 12-22 , 2002



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.


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

Afkhamie, K.H.; Luo, Z. & Wong, K.M.

1997

AgarwalShing Algorithms for the special cases of rectilinear Steiner trees: I. Points on the boundary of a rectilinear rectangle

Agarwal, P.K. & Shing, M.I.

Networks , Vol. 20 , pp. 453-485 , 1990

agarwal1

url



Design of capacitated multicommodity networks with multiple facilities

Agarwal, Y.K.


ageev1 On finding critical independent and vertex sets

Ageev, A.A.

SIAM J. Discrete Mathematics , Vol. 7 , pp. 293-295 , 1994

aggarwal1 Optimized crossover for the independent set problem

Aggarwal, C.C.; Orlin, J.B. & Tai, R.P.


Aggarwal82 Reliability evaluation by network decomposition

Aggarwal, K.; Chopra, Y. & Bajwa, J.

IEEE Transactions on Reliability , Vol. R-31 , pp. 355-8 , 1982

Aggarwal82a Topological layout of links for optimising the overall reliability in a computer communication system


Microelectronics and Reliability , Vol. 22 , pp. 347-51 , 1982

Aggarwal82b Topological layout of links for optimizing the s-t reliability in a computer communication system



Aggarwal81 Reliability evaluation in computer-communication networks

Aggarwal, K. & Rai, S.




AggarwalEtAl00 A flexible multicast routing protocol for group communication

Aggarwal, S.; Paul, S.; Massey, D. & Caldararu, D.

Computer Networks , Vol. 32 , pp. 35-60 , 2000

spaggarwal1 Indefinite quadratic fractional programming with a quadratic constraint

Aggarwal, S.P.

Cahiers du Centre détudes de recherche opérationnelle , Vol. 15 , pp. 405-410 , 1973

spaggarwal2 Quadratic fractional functionals programming

Aggarwal, S.P.


aghezzaf1 Optimizing constrained subtrees of trees

Aghezzaf, E.H.; Magnanti, T.L. & Wolsey, L.A.


Agnarsson03 Coloring powers of Planar Graphs

Agnarsson, G. & Halldórsson, M.M.

SIAM Journal on Discrete Mathematics , Vol. 16 , pp. 651-662 , 2003

AgnBCDG03 Optimal packet scheduling in UTRA-TDD

Agnetis, A.; Brogi, G.; Ciaschetti, G.; Detti, P. & Giambene, G.

IEEE Communication Letters , Vol. 52 , pp. 229-242 , 2003

AgKlRa95 When trees collide: An approximation algorithm for the generalized



Steiner problem in networks

Agrawal, A.; Klein, P. & Ravi, R.

SIAM Journal of Computing , Vol. 24 , pp. 440-456 , 1995

des95-7 When trees collide: an approximation algorithm

for the generalized Steiner problem on networks


SIAM Journal on Computing , Vol. 24 , pp. 440-456 , 1995

AgKlRa94 When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks


1994

Agrawal93 Mining association rules between sets of items in large databases

Agrawal, R.; Imielinski, T. & Swami, A.

Proceedings of the ACM SIGMOD International Conference on Management of Database , pp. 207-216 , 1993

Agrawal96 Parallel mining of association rules: Design, implementation and experience

Agrawal, R. & Shafer, J.C.

IEEE Trans, Knowledge and Data Engineering , Vol. 8 , pp. 962-969 , 1996

Agrawal94 Fast algorithms for mining association rules

Agrawal, R. & Srikant, R.

Proc. of the 20th VLDB Conf. , pp. 487-499 , 1994

AGMGB86



Architecture for a multimedia teleconferencing system

Aguilar, L.; Garcia-Luna-Aceves, J.; Moran, D.; Graighill, E. & Brungardt, R.

Proceedings of the ACM SIGCOMM , pp. 126-136 , 1986

AHMADI Dynamic Routing and Call Control in High-Speed Integrated Networks

Ahmadi, H.; Chen, J. & Guerin, R.

Proc. 13th International Teletraffic Congress, ITC 13 , pp. 397-403 , 1992

ahmed3 Mean-risk objectives in stochastic programming

Ahmed, S.

2004

ahmed1 A Multi-stage Stochastic Integer Programming Approach for Capacity Expansion under Uncertainty

Ahmed, S.; King, A.J. & Parija, G.

2000

ahmed2 The Sample Average Approximation Method for Stochastic Programs with Integer Recourse

Ahmed, S. & Shapiro, A.

2002

Ahn:Kim Optimal bandwidth allocation for bandwidth adaptation in wireless multimedia networks

Ahn, K. & Kim, S.

Computers and Operations Research , Vol. 30 , pp. 1917-1929 , 2003

AhoGareyHwang Rectilinear Steiner trees: Efficient special-case algorithms

url

url

url



Aho, A.V.; Garey, M.R. & Hwang, F.K.

Networks , Vol. 7 , pp. 37-58 , 1977

AHO The Design and Analysis of Computer Algorithms

Aho, A.V.; Hopcroft, J.E. & Ullman, J.D.

Addison-Wesley , 1974

gra74-1 The design and analysis of computer algorithms

Aho, A.; Hopcroft, J. & Ullman, J.


Aho02 UMTS Location for Network Planning and Optimization in Urban Areas

Ahonen, S.

Proc. LOBSTER Workshop , 2002

AhoEsk03 Mobile Terminal Location for UMTS

Ahonen, S. & Eskelinen, P.

IEEE Aerospace and Electronics Systems Magazine , Vol. 18 , pp. 23-27 , 2003

AhuMagOrl93 Network Flows: Theory, Algorithms, and Applications

Ahuja, R.; Magnanti, T. & Orlin, J.

Prentice-Hall , 1993

ahumo93 Network Flows : Theory and Algorithms



ahuja3



Inverse optimization

Ahuja, R.K. & Orlin, J.B.


ahuja4 A fast scaling algorithm for minimizing separable convex functions subject to chain constraints



ahuja2 Equivalence of the primal and dual simplex algorithms for the maximum flow problem


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.


ahuja6 Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem



AhuOrlSha98a New neighborhood search structures for the capacitated minimum spanning tree problem


1998

AMO93



Network Flows: Theory, Algorithms, and Applications



AhuMehOrlTar90a Faster algorithms for the shortest path problem

Ahuja, R.; Mehlhorn, K.; Orlin, J. & Tarjan, R.

Journal of ACM , Vol. 37 , pp. 213-223 , 1990

AhuOrlSha03a A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem

Ahuja, R.; Orlin, J. & Sharma, D.


AhuOrlSha01a Multi-exchange neighborhood search structures for the

capacitated minimum spanning tree problem

Ahuja, R.; Orlin, J. & Sharma, D.


AhuOrlTiw00 A greedy genetic algorithm for the quadratic

assignment problem

Ahuja, R.; Orlin, J. & Tiwari, A.


acl Random evolution in massive graphs

Aiello, W.; Chung, F. & Lu, L.

pp. 97-122 , 2002

pdf url

pdf url



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

Aiex, R.M.; Binato,; S. & Resende, M.G.C.

2001

aiex1 Probability distribution of solution time in GRASP: An experimental investigation

Aiex, R.M.; Resende, M.G.C. & Ribeiro, C.C.

2000

Aie02a Uma investigação experimental da distribuição de probabilidade de tempo de solução em heursticas GRASP e sua aplicação na análise de implementações paralelas

R.M. Aiex

Department of Computer Science, Catholic University of

Rio de Janeiro

, 2002

AieBinRes03a Parallel GRASP with path-relinking for job

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

url

url

pdf url



Aiex, R.; Resende, M.; Pardalos, P. & Toraldo, G.


AieResRib02a Probability distribution of solution time in

GRASP: An experimental investigation

Aiex, R.; Resende, M. & Ribeiro, C.

Journal of Heuristics , Vol. 8 , pp. 343-373 , 2002

Ai85 Facility Location Models for Distribution Planning

Aikens, C.

European Journal of Operational Research , Vol. 22 , pp. 263-279 , 1985

akg84 Topics in Relaxation and Ellipsoidal Methods

Akgül, M.

Pitman Publishing Limited , 1984

AkKh77 An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem

Akinc, U. & Khumawala, B.

Management Science , Vol. 23 , pp. 585-594 , 1977

AKINPELU The Overload Performance of Engineered Networks with Nonhierarchical and Hierarchical Routing

Akinpelu, J.M.

Bell System Technical Journal , Vol. 63 , pp. 1261-1281 , 1984

akker1 A polyhedral approach to single-machine scheduling problems

pdf url



van der Akker, J.M.; van Hoesel, C.P.M. & Savelsbergh, M.P.W.


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.


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

Akrotirianakis, I.; Maros, I. & Rustem, B.

Optimization Methods and Software , Vol. 16 , pp. 21-47 , 2001

akrotirianakis1 A Globally Convergent Interior Point Algorithm for General Non-Linear Programming Problems

Akrotirianakis, I. & Rustem, B.

url

url



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

with unequal release dates

Akturk, M. & Ozdemir, D.


alkhayyal1 On finitely terminating branch-and-bound algorithms for some global optimization problems

Al-Khayyal, F.A. & Sherali, H.D.

SIAM Journal on Optimization , Vol. 10 , pp. 1049-1057 , 2000

igp-converge Towards Milli-Second IGP Convergence

Alaettinoglu, C.; Jacobson, V. & Yu, H.

2000

albers1 Online algorithms: a survey

Albers, S.


ajb Diameter of the World-Wide Web

Albert, R.; Jeong, H. & Barabási, A.

Nature , Vol. 401 , pp. 130-131 , 1999

pdf url



albeverio1 On-line portfolio selection strategy with prediction in the presence of transaction costs

Albeverio, S.; Lao, L.J. & Zhao, X.L.

Mathematical Methods of OR , Vol. 54 , pp. 133-161 , 2001

AlevrasGrotschelWessaly1996 A network dimensioning tool

Alevras, D.; Grötschel, M. & Wessaly, R.

1996

Alevras:Grotschel:Jonas:Paul:Wessaly Survivable mobile phone network architectures: models and solution methods

Alevras, D.; Grötschel, M.; Jonas, P.; Paul, U. & Wessäly, R.

IEEE Communications Magazine , Vol. 36 , pp. 88-93 , 1998

Alevras:Grotschel:Wessaly Cost-efficient network synthesis from leased lines

Alevras, D.; Grötschel, M. & Wessäly, R.

Annals of Operations Research , Vol. 76 , pp. 1-20 , 1998

des98-2 Cost-efficient network synthesis from leased lines

Alevras, D.; Grötschel, M. & Wessäly, R.


AlexanderCohoonGanleyRobins95 Performance-oriented placement and routing for field-programmable gate arrays

Alexander, M.J.; Cohoon, J.P.; Ganley, J.L. & Robins, G.

Proceedings of the European Design Automation Conference , pp. 80-85 , 1995

AlexanderCohoonGanleyRobins An architecture-independent approach to FPGA routing based on multi-

url



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

Alfakih, A.Y.; Khandani, A. & Wolkowicz, H.

1997

Ali02 Optimization of Splitting Node Placement in Wavelength-Routed Optical Networks

Ali, M.

IEEE Journal on Selected Areas in Communications , Vol. 20 , pp. 1571-1579 , 2002

AliDeo01 Allocation of Multicast Nodes in Wavelength-Routed Networks

Ali, M. & Deogun, J.

IEEE International Conference on Communications (ICCC 2001) , pp. 614-618 , 2001

AliDeo00 Allocation of Splitting Nodes in All-Optical Wavelength-Routed Networks

Ali, M. & Deogun, J.

Photonic Network Communications , Vol. 2 , pp. 247-265 , 2000

ali00 Routing and Wavelength Assignment with Power Considerations in Optical Networks

url



Ali, M.; Ramamurthy, B. & Deogun, J.


ali99 Genetic Algorithm for Routing in WDM Optical Networks with Power Considerations. Part I: The Unicast Case

Ali, M.; Ramamurthy, B. & Deogun, J.

Proceedings of the 8$^th$ IEEE ICCCN'99 , pp. 335-340 , 1999

AlicherryEtAl03 WaveTunnel-Accurately Designing Deployable Optical Networks

Alicherry, M.; Gogate, S.; Khanna, R.; Nagesh, H.; Phadke, C.; Poosala, V. & Srinivasan, S.

Bell Labs Technical Journal , Vol. 8 , pp. 219-232 , 2003

alizadeh1 Interior Point Methods in Semidefinite Programming with

Applications to Combinatorial Optimization

Alizadeh, F.


alizadeh7 Second-order cone programming

Alizadeh, F. & Goldfarb, D.


alizadeh4 SDPpack User's Guide, Version 0.8 BETA

Alizadeh, F.; Haeberly, J.; Nayakkankuppam, M.V. & Overton, M.L.

1997

alizadeh2 Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results

url

url

url



Alizadeh, F.; Haeberly, J. & Overton, M.L.


alizadeh3 Complementarity and nondegeneracy in semidefinite programming

Alizadeh, F.; Haeberly, J. & Overton, M.L.


alizadeh8 Symmetric cones, potential reduction methods, and word-by-word extensions

Alizadeh, F. & Schmieta, S.

pp. 195-223 , 2000

alizadeh5 Optimization with semidefinite, quadratic and linear constraints

Alizadeh, F. & Schmieta, S.

1997

alkire1 Convex optimization problems involving finite autocorrelation sequences

Alkire, B. & Vandenberghe, L.


allal98_park_ride A Park and Ride integrated system

Allal, C.; Colson, B. & Fortz, B.

pp. 213-228 , 2002

allemand1 A polynomial case of unconstrained zero-one quadratic optimization

Allemand, K.; Fukuda, K.; Liebling, T.M. & Steiner, E.


url

url



AllIsmKenOli03 An Incremental Procedure for Improving Path Assignment in a Telecommunications Network

Allen, D.; Ismail, I.; Kennington, J. & Olinick, E.


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 Definicão de uma Rede Backbone Pública 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



Alon, N.; Dar, S.; Parnas, M. & Ron, D.

SIAM Review , Vol. 46 , pp. 285-308 , 2004

ak The concentration of the chromatic number of random graphs

Alon, N. & Krivelevich, M.

Combinatorica , Vol. 17 , pp. 303-313 , 1997

AlrabiahaZnati01 An efficient and easily deployable QoS-based routing scheme for online Internet multicasting

Alrabiaha, T. & Znati, T.


altaysalih1 Constrained nonlinear programming for volatility estimation with GARCH models

Altay-Salih, A.; Pinar, M.C. & Leyffer, S.


AlthausEtAl04 Approximating k-Hop Minimum-Spanning Trees

Althaus, E.; Funke, S.; Har-Peled, S.; Könemann, J.; Ramos, E. & Skutella, M.

2004

Al94 Topological Design of Ring Networks

Altinkemer, K.


AlGa88 Heuristics with constant error guarantees for the design of tree networks

Altinkemer, K. & Gavish, B.




AlKi95 Heuristics for Ring Network Design

Altinkemer, K. & Kim, B.

Third International Conference of Telecommunication Systems, Modelling and Analysis , pp. 429-442 , 1995

AltinkemerYu1992 Topological design of wide area communication networks

Altinkemer, K. & Yu, Z.


Altiparmak98 Reliability optimization of computer communication networks using genetic algorithms

Altiparmak, F.; Dengiz, B. & Smith, A.

SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218) , pp. 4676-81 vol.5 , 1998

altman1 Regularized Symmetric Indefinite Systems in Interior Point Methods for Linear and Quadratic Optimization

Altman, A. & Gondzio, J.


Alt02 Non-cooperative routing in loss networks

Altman, E.; Azouzi, R.E. & Abramov, V.

Performance Evaluation , Vol. 49 , pp. 43-55 , 2002

Alt00 Competitive routing in networks with polynomial costs

Altman, E.; Baar, T.; Jiménez, T. & Shikin, N.

2000

url



AlvParTam02a A tabu search algorithm for large-scale guillotine

(un)constrained two-dimensional cutting problems

Alvarez-Valdés, R.; Parajón, A. & Tamarit, J.


AlvParTam01a A computational study of heuristic algorithms for

two-dimensional cutting stock problems

Alvarez-Valdes, R.; Parajon, A. & Tamarit, J.

Proceedings of MIC'2001 , pp. 7-11 , 2001

Alv98 Parallelization strategies for the metaheuristic GRASP

Alvim, A.C.

Department of Computer Science,Catholic University of Rio de Janeiro , 1998

AlvRib98b Load balancing for the parallelization of the GRASP metaheuristic

Alvim, A. & Ribeiro, C.

Proceedings of the X Brazilian Symposium on Computer Architecture , pp. 279-282 , 1998

Alv98a Parallelization strategies for the metaheuristic GRASP

Alvim, A.C.F.

Department of Computer Science,

Catholic University of Rio de Janeiro

, 1998

AlvRib98a Load balancing in the parallelization of the metaheuristic

pdf url



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


International Journal of Foundations of Computer Science , Vol. 14 , pp. 287-303 , 2003

alzoubi02messg Message-optimal connected dominating sets in mobile ad hoc networks


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


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



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. 180-184 , 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


IEEE Transactions on Wireless Communications , Vol. 2 , pp. 939-952 , 2003

AmaCapMal03a Planning UMTS base station location: Optimization models with power



control and algorithms



AmaCM02j Planning UMTS Base Station Location: Optimization models with power control and algorithms



AmaCM02b Optimizing UMTS radio coverage via base station configuration


The 13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIRMC'02) , Vol. 1 , pp. 315-319 , 2002

AmaCapMal01 Discrete Models and Algorithms for the Capacitated Location Problems Arising in UMTS Network Planning


Proc. 5th International Workshop Discrete Algorithms and Methods for Mobile Computing and Communications (DAM-MCC) , pp. 1-8 , 2001

AmaCM01a Base Station Configuration and Location Problems

in UMTS Networks


Proceedings of the 9th International Conference on

Telecommunication Systems, Modeling and Analysis

, pp. 341-348 , 2001

AmaCM01b Discrete models and algorithms for the capacitated location

problem arising in UMTS network planning




Proceedings of the 5th International Workshop on

Discrete Algorithms and Methods for Mobile Computing and

Communications (DIAL-M)

, pp. 1-8 , 2001

AmaCM01c Optimizing Base Station Siting in UMTS Networks


Proceedings of IEEE VTC Spring 2001 , 2001

AmaCM01d Improved models and algorithms for UMTS radio planning


Proceedings of IEEE VTC Fall 2001 , 2001

AmaCapMalSig03a Optimization models and algorithms for downlink UMTS radio planning

Amaldi, E.; Capone, A.; Malucelli, F. & Signori, F.

Wireless Communications and Networking, 2003 (WCNC 2003) , Vol. 2 , pp. 827-831 , 2003

AmaCM03a Optimization models and algorithms for

downlink UMTS radio planning.


Proceedings of IEEE Wireless Communications and Networking Conference (WCNC'03) , Vol. 2 , pp. 827-831 , 2003

AmaCM03b A mathematical programming approach for W-CDMA radio planning with uplink and downlink constraints




Proceedings of IEEE VTC Fall 2003 , Vol. 2 , pp. 806-810 , 2003

AmaCMS02a UMTS Radio Planning: Optimizing Base Station Configuration


Proceedings of IEEE VTC Fall 2002 , Vol. 2 , pp. 768-772 , 2002

asbs Classes of small-world networks

Amaral, L.; Scala, A.; Barthélémy, M. & Stanley, H.

Proc. of National Academy of Sciences USA , Vol. 97 , pp. 11149-11152 , 2000

AminHakimi72 Upper bounds on the order of a clique of a graph

Amin, A.T. & Hakimi, S.L.

SIAM J. Appl. Math. , Vol. 22 , pp. 569-573 , 1972

Am98 A system for the design of packet-switched communication networks with economics tradeoffs

Amiri, A.


Amiri_1998_v104 The design of service systems with queueing time cost, workload capacities and backup service

Amiri, A.


Amiri_1998_v21 A system for the design of packet-switched communication networks with economic tradeoffs

Amiri, A.




Amiri_1997_v24 Solution procedures for the service system design problem

Amiri, A.


Amiri:Barkhi The multi-hour bandwidth packing problem

Amiri, A. & Barkhi, R.


AmPi99 Routing and capacity assignment in backbone communication networks under time varying traffic conditions

Amiri, A. & Pirkul, H.


amiri1 Primary and secondary route selection in backbone communication networks



Amiri:Pirkul Primary and secondary route selection in backbone communication networks



AmiRolBar99a Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures

Amiri, A.; Rolland, E. & Barkhi, R.




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.


an1 Globally minimizing a quadratic function under convex quadratic constraints

An, L.T.H.


Ana02



Optimization of Telecommunication Networks

Anandalingam, G.

pp. 826-841 , 2002

andersen16 On primal and dual infeasibility certificates in a homogeneous model for convex optimization

Andersen, E.D.


andersen7 On exploiting problem structure in a basis identifications procedure for linear programming

Andersen, E.D.


andersen15 Linear Optimization: Theory, methods, and extensions

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


1998

andersen8 The APOS linear programming solver: an implementation of the

url

url

url

url



homogeneous algorithm


1997

andersen1 Presolving in linear programming



andersen5 Implementation of interior point methods for large scale linear programming

Andersen, E.D.; Gondzio, J.; Mészáros, C. & Xu, X.

pp. 189-252 , 1996

JEM_ART A homogenized cutting plane method to solve the convex feasibility problem

Andersen, E.D.; Mitchell, J.E.; Roos, C. & Terlaky, T.

pp. 167-190 , 2001

andersen14 On implementing a primal-dual interior-point method for conic quadratic optimization

Andersen, E.D.; Roos, C. & Terlaky, T.


andersen3 On a homogeneous algorithm for the monotone complementarity problem

Andersen, E.D. & Ye, Y.


andersen6 A computational study of the homogeneous algorithm for large-scale convex optimization

url

url

url

url




Computational Optimization and Applications , Vol. 10 , pp. 243-269 , 1998

andersen9 Combining interior-point and pivoting algorithms for linear programming


1994

andersen4 A modified Schur complement method for handling dense columns in interior point methods for linear programming

Andersen, K.D.

1995

andersen10 A Newton barrier method for minimizing a sum of euclidean norms subject to linear equality constraints

Andersen, K.D. & Christiansen, E.

1995

andersen2 A symmetric primal-dual Newton method for minimizing a sum of norms

Andersen, K.D. & Christiansen, E.

1995

andersen12 An Efficient Primal-Dual Interior-Point Method for Minimizing a Sum of Euclidean Norms

Andersen, K.D.; Christiansen, E.; Conn, A.R. & Overton, M.L.

1998

And97 Soft and Safe Admission Control in Cellular Networks

Andersin, M.; Rosenberg, Z. & Zander, J.

url



IEEE/ACM Transactions on Networking , Vol. 5 , pp. 255-265 , 1997

Anderson02 A Contract and Balancing Mechanism for Sharing Capacity in a Comm unication Network

Anderson, E.; Kelly, F. & Steinberg, R.

2005

anderson1 A direct search algorithm for optimization with noisy function evaluations

Anderson, E.J. & Ferris, M.C.


anderson2 Linear Programming in Infinite-Dimensional Spaces

Anderson, E.J. & Nash, P.

John Wiley , 1987

anderson3 A class of continuous network flow problems

Anderson, E.J.; Nash, P. & Philpott, A.


anderson4 A continuous-time network simplex algorithm

Anderson, E.J. & Philpott, A.

Networks , Vol. 19 , pp. 395-425 , 1989

AndersonEtAl03 Optical Interface Unit-Bridge to the Next-Generation Packet Network

Anderson, J.; Makowski, S. & Tamras, S.


Andersson-etal-2000



Integer programming for combinatorial auction winner determination

Andersson, A. & Ygge, F.

n Proc. Fourth International Conference on Multiagent Systems , pp. 39-46 , 2000

andersson1 Credit risk optimization with conditional value-at-risk criterion

Andersson, F.; Mausser, H.; Rosen, D. & Uryasev, S.


AndradeLisser02 Planning network design under uncertainty with fixed charge

Andrade, R.; A.~Lisser; N.~Maculan & G.~Plateau

2002

AndRib02a Heuristics for the phylogeny problem

Andreatta, A. & Ribeiro, C.


AndCarRib02a A framework for the development of local search

heuristics for combinatorial optimization problems

Andreatta, A.; Carvalho, S. & Ribeiro, C.

pp. 59-79 , 2002

AndCarRib98a An object-oriented framework for local search heuristics

Andreatta, A. & Ribeiro, C.

pp. 33-45 , 1998

Andrews97 Template Algorithm for One-Hop Packet Routing

pdf url



Andrews, M.; Fernandez, A.; Harchol-Balter, M.; Leighton, T. & Zhang, L.

1997

AndrewsZhang2002 Approximation algorithms for access network design

Andrews, M. & Zhang, L.

Algorithmica , Vol. 34 , pp. 197-215 , 2002

AndRas03a Motif-GRASP and Motif-ILS: Two new stochastic local search algorithms for motif finding

Andronescu, M. & Rastegari, B.

2003

An80 An Integer Linear Programming Approach to Steiner Problem in Graphs

Aneja, Y.

Networks , Vol. 10 , pp. 167-178 , 1980

Ane80 An integer linear programming approach to the Steiner problem in graphs

Aneja, Y.

Networks , Vol. 10 , pp. 167-178 , 1980

Aneja80 An Integer Linear Programming Approach to the Steiner Problem in Graphs

Aneja, Y.

Networks , Vol. 10 , pp. 167-178 , 1980

aneja1 Maximal expected flow in a network subject to arc failures

Aneja, Y. & Nair, K.

Networks , Vol. 10 , pp. 45-57 , 1980



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

Anjos, M.F.

2003

anjos4 A semidefinite programming approach for the nearest correlation matrix problem

Anjos, M.F.; Higham, N.J.; Takouda, P.L. & Wolkowicz, H.

2003

anjos1 Strengthened semidefinite relaxations via a second lifting for the MAX-CUT problem

Anjos, M.F. & Wolkowicz, H.


anjos3 Geometry of Semidefinite Max-Cut Relaxations via Matrix Ranks


Journal of Combinatorial Optimization , Vol. 6 , pp. 237-270 , 2002

anjos2

url

url

url

url



A Tight Semidefinite Relaxation of the Cut Polytope


2000

Ansari01 Integrating E-commerce and data mining: Architecture and challenges

Ansari, S.; Kohavi, R.; Mason, L. & Zheng, Z.

Proceedings of the IEEE International Conference on Data Mining -- ICDM , 2001

anstreicher31 Recent advances in the solution of quadratic assignment problems

Anstreicher, K.M.


anstreicher24 Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem

Anstreicher, K.M.


anstreicher30 Improved complexity for maximum volume inscribed ellipsoids

Anstreicher, K.M.

2001

anstreicher18 The volumetric barrier for semidefinite programming

Anstreicher, K.M.


anstreicher29 Improved Linear Programming Bounds for Antipodal Spherical Codes

Anstreicher, K.M.

url

url

url

url

url



2000

anstreicher15 Towards a Practical Volumetric Cutting Plane Method for Convex Programming

Anstreicher, K.M.


anstreicher16 Ellipsoidal Approximations of Convex Sets Based on the Volumetric Barrier

Anstreicher, K.M.

Mathematics of Operations Research , Vol. 24(1) , pp. 193-203 , 1999

anstreicher17 Linear Programming in $O([n^3/ n]L)$ Operations

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

Anstreicher, K.M.

1998

anstreicher22 The Volumetric Barrier for Convex Quadratic Constraints

Anstreicher, K.M.

1998

anstreicher10 On Vaidya's volumetric cutting plane method for convex programming

Anstreicher, K.M.


url

url

url

url

url

url



anstreicher9 Volumetric path following algorithms for linear programming

Anstreicher, K.M.


anstreicher14 Potential Reduction Algorithms

Anstreicher, K.M.

1995

anstreicher11 Large step volumetric potential reduction algorithms for linear programming

Anstreicher, K.M.

1994

Ans7 On the performance of Karmarkar's algorithm over a sequence of iterations

Anstreicher, K.M.


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.


Ans3

url

url



A combined Phase I-Phase II algorithm for linear programming

Anstreicher, K.M.


Ans4 The worst-case step in Karmarkar's algorithm

Anstreicher, K.M.


Ans2 Linear programming and the Newton barrier flow

Anstreicher, K.M.


Ans1 A Monotonic Projection Algorithm for Fractional Linear Programming

Anstreicher, K.M.


Ans5 A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm

Anstreicher, K.M.


AnsBosch Long steps in a $O(n^3L)$ algorithm for linear programming

Anstreicher, K.M. & Bosch, R.

Mathematical Programming , Vol. 54(3) , 1992

anstreicher25 A New Bound for the Quadratic Assignment Problem Based on Convex Quadratic Programming

Anstreicher, K.M. & Brixius, N.W.

url




anstreicher28 Solving large quadratic assignment problems on computational grids

Anstreicher, K.M.; Brixius, N.W.; Goux, J. & Linderoth, J.


anstreicher21 Strong Duality for a Trust-Region Type Relaxation of the Quadratic Assignment Problem

Anstreicher, K.M.; Chen, X.; Wolkowicz, H. & Yuan, Y.

1998

anstreicher13 A Long-Step Path Following Algorithm for Semidefinite Programming Problems

Anstreicher, K.M. & Fampa, M.

1995

anstreicher27 Using continuous nonlinear relaxation to solve constrained maximum-entropy sampling problems

Anstreicher, K.M.; Fampa, M.; Lee, J. & Williams, J.


anstreicher26 Probabilistic analysis of an infeasible-interior-point algorithm for linear programming

Anstreicher, K.M.; Ji, J.; Potra, F.A. & Ye, Y.


anstreicher32 A masked spectral bound for maximum-entropy sampling

Anstreicher, K.M. & Lee, J.

url

url

url



2003

anstreicher12 A Monotonic Build-Up Simplex Algorithm For Linear Programming

Anstreicher, K.M. & Terlaky, T.


anstreicher20 On Lagrangian Relaxation of Quadratic Matrix Constraints

Anstreicher, K.M. & Wolkowicz, H.

1998

anstreicher23 A Note on the Augmented Hessian When the Reduced Hessian is Semidefinite

Anstreicher, K.M. & Wright, M.H.


Anwar04 Bidding behavior in competing auctions: Evidence from eBay

Anwar, S.; McMillan, R. & Zheng, M.

European Economic Review , 2004

APOS Intra-Domain QoS Routing in IP Networks: A Feasibility and Cost/Benefit Analysis

Apostolopoulos, G.; Guerin, R.; Kamat, S.; Orda, A. & Tripathi., S.K.

IEEE Network , Vol. 13 , pp. 42-54 , 1999

Appel77a Every planar map is four colourable. Part I: Discharging

Appel, K. & Haken, W.

Illinois Journal of Mathematics , Vol. 21 , pp. 429-490 , 1977

Appel77b

url

url



Every planar map is four colourable. Part II: Reducibility

Appel, K.; Haken, W. & Koch, J.

Illinois Journal of Mathematics , Vol. 21 , pp. 491-567 , 1977

applegate5 Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems

Applegate, D.; Bixby, R.; Chvátal, V. & Cook, W.


applegate4 On the solution of traveling salesman problems


Documenta Mathematica , Vol. Extra Volume Proceedings ICM III (1998) , pp. 645-656 , 1998

ApBiChCo The traveling salesman problem


1994

Applegate:Bixby:Chvatal:Cook Finding cuts in the TSP (A preliminary report)


1995

applegate:03 Making Intra-Domain Routing Robust to Changing and Uncertain Traffic Demands: Understanding Fundamental Tradeoffs

Applegate, D. & Cohen, E.

Proc. ACM SIGCOMM , 2003

applegate3 Solving large-scale matching problems

url



Applegate, D. & Cook, W.

pp. 299-348 , 1993

applegate1 A computational study of the job-shop scheduling problem

Applegate, D. & Cook, W.


Applegate03 Load Optimal MPLS Routing with $N+M$ Labels

Applegate, D. & Thorup, M.

Proceedings of IEEE INFOCOM2003 , 2003

gomory8 An approach to integer programming

Aráoz, J.; Evans, L.; Gomory, R.E. & Johnson, E.L.


AraJohGeo91 Optimization by simulated annealing: An experimental evaluation; Part II, Graph coloring and number partitioning

Aragon, C.; Johnson, D.; McGeoch, A. & Schevon, C.


Ara98a O problema de roteamento de veculos e algumas

metaheursticas

Arakaki, R.G.I.

Instituto Nacional de Pesquisas Espaciais , 1998

arantes1 The pooling of cryoprecipitate

Arantes, J.C.; Telang, P. & Lakshminarayanan, S.



International Journal of Industrial Engineering , Vol. 4 , pp. 159-166 , 1997

Arbib92 Methodological aspects of ring network design

Arbib, C.; Mocci, U. & Scoglio, C.

Lecture Notes in Control and Information Sciences , Vol. 180 , pp. 135-144 , 1992

Arci03 Availability models for protection techniques in WDM networks

Arci, D.; Maier, G.; Pattavina, A.; Petecchi, D. & Tornatore, M.

Proceedings of the 4th International Workshop on Design of Reliable Communication Networks (DRCN 2003) , pp. 158-166 , 2003

AreMouAbd01a A comparison of genetic/memetic algorithms and other

heuristic search techniques

Areibi, S.; Moussa, M. & Abdullah, H.

Proceedings of IC-AI 2001 , 2001

AreVan00a Efficient Hybrid Search Techniques For Circuit Partitioning

Areibi, S. & Vannelli, A.

IEEE 4th World Multiconference on Circuits, Systems, Communications and Computers , 2000

AreVan97a A GRASP clustering technique for circuit partitioning


Vol. 35 , pp. 711-724 , 1997

areibi1 Advanced search techniques for circuit partitioning




Vol. 16 , pp. 77-96 , 1994

Are99a GRASP: An effective constructive technique for VLSI circuit partitioning

Areibi, S.

Proc. IEEE Canadian Conference on Electrical and Computer Engineering (CCECE'99) , 1999

arge The buffer tree: A new technique for optimal I/O algorithms

Arge, L.

Vol. 955 , pp. 334-345 , 1995

abt On external memory MST, SSSP and multi-way planar graph separation

Arge, L.; Brodal, G.S. & Toma, L.

Vol. 1851 , 2000

ArgBarYu97a A GRASP for aircraft routing in response

to groundings and delays

Argüello, M.; Bard, J. & Yu, G.


ArgFeoGol96a Randomized methods for the number partitioning problem

Argüello, M.; Feo, T. & Goldschmidt, O.


Arian92 Algorithms for Generalized Round Robin Routing

Arian, Y. & Levy, Y.


pdf url

pdf url



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

Ariyawansa, K.A. & Felt, A.J.

2001

ariyawansa1 Polynomial cutting plane algorithms for two-stage stochastic linear programs based on ellipsoids, volumetric centers, and analytic centers

Ariyawansa, K.A. & Jiang, P.L.

1996

armand1 A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems

Armand, P.; Gilbert, J.C. & Jan-Jégou, S.


armijo1 Minimization of Functions Having Lipschitz Continuous First-Partial Derivatives

Armijo, L.

Pacific Journal of Mathematics , Vol. 16(1) , pp. 1-3 , 1966

ArmKliLusRos00 Design of stacked self-healing rings using a genetic algorithm

Armony, M.; Klincewicz, J.; Luss, H. & Rosenwein, M.


ArmKliLusRos00a

url

url



Design of stacked self-healing rings using a genetic

algorithm


dec85-1 Efficient Algorithms for Combinatorial

Problems on a Graph With Bounded

Decomposability -- A Survey

Arnborg, S.

BIT , Vol. 25 , pp. 2-23 , 1985

AranovBernEppstein On the number of minimal 1-Steiner trees

Aronov, B.; Bern, M. & Eppstein, D.

Discrete and Computational Geometry , pp. 29-34 , 1994

arora3 Approximation schemes for NP-hard geometric optimization problems: a survey

Arora, S.


Arora Polynomial-time approximation scheme for Euclidean TSP and other geometric problems

Arora, S.

Proceedings of the Symposium on Foundations of Computer Science , pp. 2-11 , 1996

AL96 Hardness of Approximations

Arora, S. & Lund, C.

url



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. 2-13 , 1992

ArMaNg83 Le Probème de Steiner sur un Graphe Orienté: Formulations et Relaxations

Arpin, D.; Maculan, N. & Nguyen, S.

1983



ArrMarMezOrt01a GRASP and tabu search algorithms for computing the

forwarding index in a graph

Arráiz, E.; Martnez, A.; Meza, O. & Ortega, M.


arsham1 Initialization of the simplex algorithm: an artificial-free approach

Arsham, H.


arthanari1 On the equivalence of the multistage-insertion and cycle-shrink formulations of the traveling salesman problem

Arthanari, T.S. & Usha, M.


ascheuer1 Combinatorial online optimization in practice

Ascheuer, N.; Grötschel, 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.; Jünger, M. & Reinelt, G.


ascheuer2 A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints

Ascheuer, N.; Jünger, M. & Reinelt, G.


url



ASH5 Performance Evaluation of QoS-Routing Methods for IP-Based Multiservice Networks

Ash, G.R.


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.


ASH1 Design and Optimization of Networks with Dynamic Routing

Ash, G.R.; Cardwell, R.H. & Murray, R.P.


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



Backward to the Future

Ash, G.R. & Chemouil, P.

IEEE Global Communications Newsletter , pp. 1-4 , 2004

ASH2 Robust Design and Planning of a Worldwide Intelligent Network

Ash, G.R.; Chemouil, P.; Kashper, A.N.; Katz, S.S. & Watanabe, Y.

IEEE Journal on Selected Areas in Communications , Vol. 7 , 1989

ASH3 Real-Time Network Routing in a Dynamic Class-of-Service Network

Ash, G.R.; Chen, J.; Frey, A.E. & Huang, B.D.

Proc. 13th International Teletraffic Congress, ITC 13 , 1991

asic2 Ill-conditionedness and interior-point methods

Asic, M.D. & Kovacevic-Vujcic, V.V.

1998

AKVRN Asymptotic behaviour of Karmarkar's method for linear programming

Asic, M.D.; Kovacevic-Vujcic, V.V. & Radosavljevic-Nikolic, M.D.


askin1 A parallel station heuristic for the mixed-model production line balancing problem

Askin, R.G. & Zhou, M.

International Journal on Production Research , Vol. 11 , pp. 3095-3105 , 1997

ass78 Multicommodity network flows -- A survey

Assad, A.

Networks , Vol. 8 , pp. 37-91 , 1978



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

Atamtürk, A.


atamturk6 On capacitated network design cut-set polyhedra

Atamtürk, A.


atamturk3 Flow pack facets of the single node fixed-charge flow polytope

Atamtürk, A.


atamturk2 A relational modeling system for linear and integer programming

Atamtürk, A.; Johnson, E.L.; Nemhauser, G.L. & Savelsbergh, M.W.P.


atamturk7 Valid inequalities for problems with additive variable upper bounds



Atamtürk, A.; Nemhauser, G.L. & Savelsbergh, M.W.P.


atamturk1 The mixed vertex packing problem

Atamtürk, A.; Nemhauser, G.L. & Savelsbergh, M.W.P.


atamturk4 Strong Formulations of Robust Mixed 0-1 Programming

Atamturk, A.

2003

Atiqullah93 Reliability optimization of communication networks using simulated annealing

Atiqullah, M. & Ro, S.


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.


atkinson3 A scaling technique for finding the weighted analytic center of a polytope

Atkinson, D.S. & Vaidya, P.M.


url



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.


audet3 Analysis of generalized pattern searches

Audet, C. & J. E. Dennis, J.


audet2



Pattern search algorithms for mixed variable programming

Audet, C. & J. E. Dennis, J.


auslender2 Penalty and barrier methods: a unified framework

Auslender, A.


auslender1 Asymptotic analysis for penalty and barrier methods in convex and linear programming

Auslender, A.; Cominetti, R. & Haddou, M.


Ausubel-Milgrom-2005 The Lovely but Lonely Vickrey Auction

Ausu-bel, L.M. & Milgrom, P.

2005

Ausubel-2002 An efficient ascending-bid auction for multiple objects

Ausu-bel, L.

American Economic Review , Vol. 94 , pp. 1452-1475 , 2004

avella1 On the $p$-median polytope

Avella, P. & Sassano, A.


AvMaSa02 Minimizing the span of $d$-walks to compute optimum frequency assignments

Avenali, A.; Mannino, C. & Sassano, A.




Avis A survey of heuristics for the weighted matching problem

Avis, D.

Networks , Vol. 13 , pp. 475-493 , 1983

avis2 On the solitaire cone and its relationship to multi-commodity flows

Avis, D. & Deza, A.


avis3 Stronger linear programming relaxations of max-cut

Avis, D. & Umemoto, J.


AvinBode62 Economic Applications of the Theory of Graphs

Avondo-Bodeno, G.

Gordon and Breach Science Publishers , 1962

Avramopoulos:Anagnostou Optimal component configuration and component routing

Avramopoulos, L. & Anagnostou, M.

IEEE Transactions on Mobile Computing , Vol. 1 , pp. 303-312 , 2002

avrdsz88 Generalized Concavity

Avriel, M.; Diewert, W.E.; Schaible, S. & Zang, I.

Plenum Press, New-York , 1988

AWDUCHE1 MPLS and Traffic Engineering in IP Networks



Awduche, D.


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



Optimal distributed algorithm for minimum weight spanning tree, counting, leader election and related problems

Awerbuch, B.

Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing , pp. 230-240 , 1987

AwerbuchAzarBartal04 On-line generalized Steiner problem

Awerbuch, B.; Azar, Y. & Bartal, Y.

Theoretical Computer Science , Vol. 324 , pp. 313-324 , 2004

Aykin Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem

Aykin, T.


ayllon96 Price-directive decomposition applied to routing in telecommunication networks

Ayllón, F.; Galán, J.; Marín, A. & Menéndez, A.


Azen92 Simulated annealing: Parallelization techniques

Azencott, R.

Wiley , 1992

G85 Augmented Lagrangean based algorithms for centralized network design

B.~Gavish

IEEE Trans. on Communications , Vol. 33 , pp. 1247-1257 , 1985

baiou2 The stable admissions polytope



Baïou, M. & Balinski, M.


baiou1 Separation of partition inequalities

Baïou, M.; Barahona, F. & Mahjoub, A.R.


baiou00 Separation of partition inequalities

Baïou, M.; Barahona, F. & Mahjoub, A.


BachhieslProsseggerPaulusWernerStoegner03 Simulation and Optimization of the Implementation Costs for the Last Mile of Fiber Optic Networks

Bachhiesl, P.; Prossegger, M.; Paulus, G.; Werner, J. & Stögner, H.

Networks and Spatial Economics , Vol. 3 , pp. 467-482 , 2004

Bahiense03 Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation

Bahiense, L.; Barahona, F. & Porto, O.


BahienseBarahonaPorto03 Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation



BahienseEtAl00 Solving Steiner tree problems in graphs with Lagrangean relaxation


2000



bahiense1 The Volume Algorithm revisited: relation with bundle methods

Bahiense, L.; Maculan, N. & Sagastizábal, C.


BahOliPer01a A mixed integer disjunctive model for transmission

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.


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.


bai1 Bounded error parameter estimation: A sequential analytic center approach

Bai, E.; Ye, Y. & Tempo, R.

url

pdf url

url



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.


BakCar03a A visual interactive approach to vehicle routing

Baker, B. & Carreto, C.


baker81 The Architectural Organization of a Mobile Radio Network via a Distributed Algorithm

Baker, D.J. & Ephremides, A.

IEEE Trans. on Communications , Vol. COM-29 , pp. 1694-1701 , 1981

Baker Efficient Heuristic Algorithms for the Weighted Set Covering Problem

Baker, E.


Baker:Fisher Computational Results for Very Large Air Crew Scheduling Problems

Baker, E. & Fisher, M.

Omega , Vol. 19 , pp. 613-618 , 1981

Bakoglu Circuits, Interconnections, and Packaging for VLSI

Bakoglu, H.


balachandran1

pdf url



Generalized transportation networks with stochastic demands: an operator-theoretic approach

Balachandran, V.

Networks , Vol. 9 , pp. 169-184 , 1979

BaAl92 Using a Hop-Constrained Model to Generate Alternative Communication Network Design

Balakrishnan, A. & Altinkemer, K.


Balakrishnan:Altinkemer Using a hop-constrained model to generate alternative communication network design



BalakrishnanAltinkemer1992 Using a hop-constrained model to generate alternative communication network design



des92-1 Using a hop-constrained model to generate

alternative communication network design



balakrishnan3 Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems

Balakrishnan, A.; Magnanti, T.L. & Mirchandani, P.




balakrishnan2 Designing hierarchical survivable networks



balakrishnan1 Network design


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.


BalakrishnanMagnantiWong1995 A decomposition algorithm for local access telecommunications network expansion planning

Balakrishnan, A.; Magnanti, T.L. & Wong, R.T.


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


Networks , Vol. 43 , pp. 10-27 , 2004

Balakrishnan98 Designing hierarchical survivable networks





Balakrishnan:Magnanti:Mirchandani_1994_v40_n5 A dual-based algorithm for multi-level network design



Balakrishnan:Magnanti:Mirchandani_v40_n7 Modeling and heuristic worst-case performance analysis of the two-level network design problem



BaMaMi94 Modeling and Heuristic Worst-Case Performance Analysis of Two-Level Network Design Problem



BMM94 A Dual-Based Algorithm for Multi-Level Network Design



BMM94b Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design Problem



Baal91 Models for Planning Capacity Expansion in Local Access Telecommunication Networks

Balakrishnan, A.; Magnanti, T.; Shulman, A. & Wong, R.




BaMaSh91 Models for Planning Capacity Expansion in Local Access Telecommunication Networks



BMSW91 Models for planning capacity expansion in local access telecommunication networks



des91-1 Models for planning capacity expansion in local

access telecommunication networks


Balakrishnan:Magnanti:Sokol Telecommunication link restoration planning with multiple facility types

Balakrishnan, A.; Magnanti, T. & Sokol, J.


BalMagSokWan02 Spare-Capacity Assignment for Line Restoration Using a Single-Facility Type

Balakrishnan, A.; Magnanti, T.; Sokol, J. & Wang, Y.


balmag2000 Telecommunication link restoration planning with multiple facility types

Balakrishnan, A.; Magnanti, T.; Sokol, J. & Wang, Y.




Balakrishnan:Magnanti:Sokol:Yi Spare-capacity assignment for line restoration using a single-facility type

Balakrishnan, A.; Magnanti, T.; Sokol, J. & Yi, W.

Operations Research , Vol. 50 , pp. 2120 , 2002

Balakrishnan:Magnanti:Wong A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning

Balakrishnan, A.; Magnanti, T. & Wong, R.


BaMaWo89 A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design



des89-2 A dual ascent procedure for large-scale

uncapacitated network design



Balakrishnan Problem reduction methods and a tree generation algorithm for the Steiner network problem

Balakrishnan, A. & Patel, N.

Networks , Vol. 17 , pp. 65-85 , 1987

Balakrishnani98 Designing hierarchical survivable networks





balas10 Projection with a Minimal System of Inequalities

Balas, E.

COmputational Optimization and Applications , Vol. 10 , pp. 189-193 , 1998

co79-1 Disjunctive Programming

Balas, E.

Annals of Discrete Mathematics , Vol. 5 , pp. 3-51 , 1979

Balas4 Intersection cuts --- a new type of cutting planes for integer programming

Balas, E.


balas15 On unions and dominants of polytopes

Balas, E.; Bockmayr, A.; Pisaruk, N. & Wolsey, L.


co93-1 A Lift-and-Project Cutting Plane

Algorithm for Mixed 0-1 Programs

Balas, E.; Ceria, S. & Cornuéjols, G.


balas7 Mixed 0--1 programming by lift-and-project in a branch-and-cut framework





Balas1 A lift-and-project cutting plane algorithm for mixed 0-1 programs



balas6 Gomory cuts revisited

Balas, E.; Ceria, S.; Cornuéjols, G. & Natraj, N.


balas5 Polyhedral methods for the maximum clique problem

Balas, E.; Ceria, S.; Cornuéjols, G. & Pataki, G.

1994

balas12 OCTANE: A new heuristic for pure 0--1 programs

Balas, E.; Ceria, S.; Dawande, M.; Margot, F. & Pataki, G.


balas11 Lifted cycle inequalities for the asymmetric traveling salesman problem

Balas, E. & Fischetti, M.


balas9 On the monotonization of polyhedra

Balas, E. & Fischetti, M.


balas8 The precedence-constrained asymmetric traveling salesman polytope

Balas, E.; Fischetti, M. & Pulleyblank, W.R.




Balas:Martin Pivot and Complement-A Heuristic for 0/1 Programming

Balas, E. & Martin, C.


Balas2 On the set covering polytope: I. All the facets with coefficients in 0,1,2

Balas, E. & Ng, S.M.


Balas3 On the set covering polytope: II. Lifting the facets with coefficients in 0,1,2

Balas, E. & Ng, S.M.


balas13 A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0-1 programming

Balas, E. & Perregaard, M.


BalSal91a An algorithm for the three-index assignment problem

Balas, E. & Saltzman, M.

Oper. Res. , Vol. 39 , pp. 150-161 , 1991

balas14 Pivot and shift --- a mixed integer programming heuristic

Balas, E.; Schmieta, S. & Wallace, C.

Discrete Optimization , Vol. 1 , pp. 3-12 , 2004

bal96 Weighted and Unweighted Maximum Clique Algorithms with Upper



Bounds from Fractional Coloring

Balas, E. & Xue, J.


BalasYu86 Finding a maximum clique in an arbitrary graph

Balas, E. & Yu, C.


BBSB01 Constructing Test Functions for Global Optimization Using Continuous Formulations of Graph Problems

Balasundaram, B. & Butenko, S.

2003

BBSB05bionet Novel approaches for analyzing biological networks

Balasundaram, B.; Butenko, S. & Trukhanov, S.


BOY97 Adaptive Real-Time Group Multicast

Baldi, M.; Ofek, Y. & Yener, B.

Proceedings of IEEE INFOCOM'97 , pp. 683 , 1997

Baldick A Randomized Heuristic for Inequality-Constrained Mixed-Integer Programming

Baldick, R.

1992

BlDer An analysis of alternate strategies for implementing matching algorithms

Ball, M. & Derigs, U.



Networks , Vol. 13 , pp. 517-549 , 1983

Ball80 Complexity of network reliability computations

Ball, M.

Networks , Vol. 10 , pp. 153-65 , 1980

rel80-1 Complexity of Network Reliability Computations

Ball, M.

Networks , Vol. 10 , pp. 153-165 , 1980

Ball79a Computing network reliability

Ball, M.


rel79-1 Computing Network Reliability

Ball, M.

Operations Research , Vol. 27 , 1979

Ball95 In: Network reliability

Ball, M.; Colbourn, C. & Provan., J.

Elsevier Science B.V. , Vol. 7 , pp. 673-672 , 1995

Ball79b Matroids and a reliability analysis problem

Ball, M. & Nemhauser, G.


Ball83 Calculating bounds on reachability and connectedness in stochastic



networks

Ball, M. & Provan, J.

Networks , Vol. 13 , pp. 253-78 , 1983

Ball77 Backtracking algorithms for network reliability analysis

Ball, M. & Slyke, R.V.


Ball:Vakhutinsky Fault-tolerant virtual path layout in ATM networks

Ball, M. & Vakhutinsky, A.


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.


Bandyopadhyaya Simulating sellers in online exchanges



Bandyopadhyaya, S.; Rees, J. & Barron, J.M.

Decision Support Systems , 2004

ban04 A Genetic Algorithm Approach for Solving the Routing and Wavelength Assignment Problem in WDM Networks

Banerjee, D.; Mehta, V. & Pandey, S.

International Conference in Networks, ICN'04 , 2004

banm00 Wavelength-routed optical networks: linear formulation, resource budgeting tradeoffs, and a reconfiguration study

Banerjee, D. & Mukherjee, B.


ban97 Wavelength Routed Optical Networks: Linear Formulation, Resource Budgeting Tradeoffs, and Reconfiguration Study


INFOCOM , 1997

Banerjee96 A practical approach for routing and wavelength assignment in large wavelength-routed optical networks design


IEEE journal on selected areas in telecommunications , Vol. 14 , pp. 903-908 , 1996

ban97b Design of Wavelength Routed Optical Networks for Packet Switched Traffic

Banerjee, S.; Yoo, J. & Chen, C.

IEEE Journal of Lightware Technology , Vol. 15 , pp. 1636-1646 , 1997

BangJensenEtAl03 Steiner Type Problems for Digraphs that are Locally Semicomplete or Extended Semicomplete



Bang-Jensen, J.; Gutin, G. & Yeo, A.

Journal of Graph Theory , Vol. 44 , pp. 193-207 , 2003

BanBut Environmental Policy and Transport: An Overview

Banister, D. & Button, K.J.

pp. 130-136 , 1993

BanMuk95 Practical approach for routing and wavelength assignment in large wavelength routed optical networks

Bannerjee, D. & Mukherjee, B.


bannerjee01clustering A Clustering Scheme for Hierarchical Control in Wireless Networks

Bannerjee, S. & Khuller, S.

Proceedings of IEEE INFOCOM , pp. 1-12 , 2001

BYC00 An Efficient Delay-Constrained Multicast Routing Algorithm

Baoxian, Z.; Yue, L. & Changjia, C.

International Conference on Communication Technologies (ICCT 2000) , pp. S07.2 , 2000

Bapat A sharp methodology for VLSI layout

S. Bapat

Department of Computer Science, University of Virginia , 1993

BapatCohoon A parallel VLSI circuit layout methodology

Bapat, S. & Cohoon, J.P.

Proceedings of the Sixth International Conference on VLSI Design , pp. 236-241 , 1993



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

Barabási, A.; Albert, R.; Jeong, H. & Bianconi, G.

Science , Vol. 287 , pp. 2115a , 2000

barabasi Emergence of Scaling in Random Networks

Barabási, A. & Albert, R.

Science , Vol. 286 , pp. 509-512 , 1999

baj Scale-free characteristics of random networks: the topology of the World-Wide Web

Barabási, A.; Albert, R. & Jeong, H.

Physica A , Vol. 281 , pp. 69-77 , 2000

barahona15 Network reinforcement url



Barahona, F.

2002

barahona10 On the $k$-cut problem

Barahona, F.


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.


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.


des92-6 Separating from the dominant of the spanning tree polytope

Barahona, F.

Op. Research Letters , Vol. 12 , pp. 201-203 , 1992

barahona11



On the computational complexity of Ising spin glass models

Barahona, F.

Journal of Physics A: Mathematical, nuclear and general , Vol. 15 , pp. 3241-3253 , 1982

barahona7 The volume algorithm: producing primal solutions with a subgradient method

Barahona, F. & Anbil, R.


barahona8 On some difficult linear programs coming from set partitioning problems

Barahona, F. & Anbil, R.

1999

barahona13 Robust Capacity Planning in Semiconductor Manufacturing

Barahona, F.; Bermon, S.; Gunluk, O. & Hood, S.

2001

barahona9 Solving large scale uncapacitated facility location problems

Barahona, F. & Chudak, F.

1999

barahona12 Facets of the bipartite subgraph polytope

Barahona, F.; Grötschel, M. & Mahjoub, A.R.


BJR2 An application of combinatorial optimization to statistical physics and circuit layout design

url

url

url



Barahona, F.; Grötschel, M.; Jünger, M. & Reinelt, G.


barahona5 Plant location with minimum inventory

Barahona, F. & Jensen, D.


BJR Experiments in quadratic 0-1 programming

Barahona, F.; Jünger, M. & Reinelt, G.


barahona14 Branch and cut based on the volume algorithm: Steiner trees in graphs and max-cut

Barahona, F. & Ladanyi, L.

2001

barahona4 On the cut polytope

Barahona, F. & Mahjoub, A.R.


Barbas:Marin Maximal covering code multiplexing access telecommunication networks

Barbas, J. & Marin, A.


BaCa84 A Heuristic Lagrangean Algorithm for the Capacitated Plant Location Problem

Barcelo, J. & Casanovas, J.


url



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

products manufacturer

Bard, J.


BarFeo91a An algorithm for the manufacturing equipment

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.


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

pdf url

pdf url

pdf url

pdf url



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

problem with time windows

Bard, J.; Kontoravdis, G. & Yu, G.


barker1 Cones of diagonal dominant matrices

Barker, G.P. & Carlson, D.

Pacific Journal of Mathematics , Vol. 57 , pp. 15-32 , 1975

Bar1 A variation on Karmarkar's algorithm for solving linear programming problems

Barnes, E.R.


Bar2 A sparse matrix version of Karmarkar's algorithm

Barnes, E.R.

1986

BCJ A polynomial time version of the affine scaling algorithm

Barnes, E.R.; Chopra, S. & Jensen, D.L.

1987

barnhart2

pdf url



Flight string models for aircraft fleeting and routing

Barnhart, C.; Boland, N.L.; Clarke, L.W.; Johnson, E.L.; Nemhauser, G.L. & Shenoi, R.G.


barnhart3 Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems

Barnhart, C.; Hane, C.A. & Vance, P.H.


BarHanVan00a Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems

Barnhart, C.; Hane, C. & Vance, P.


Barnhart:Hane:Vance Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems

Barnhart, C.; Hane, C. & Vance, P.


barnhart1 Branch-and-price: column generation for solving huge integer programs

Barnhart, C.; Johnson, E.L.; Nemhauser, G.L.; Savelsbergh, M.W.P. & Vance, P.H.


bar98 Branch-and-Price: Column Generation for Solving Huge Integer Programs

Barnhart, C.; Johnson, E.; Nemhauser, G.; Savelsbergh, M. & Vance, P.


Barnhart:Johnson:Nemhauser:Savelsbergh:Vance



Branch and price: column generation for solving huge integer programs

Barnhart, C.; Johnson, E.; Nemhauser, G.; Savelsbergh, M. & Vance, P.


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.


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



and sources of speedup

Barr, R. & Hickman, B.


BarrerraGriffithMckeeRobinsZhang Toward a Steiner engine: Enhanced serial and parallel implementations of the iterated 1-Steiner MRST heuristic

Barrerra, T.; Griffith, J.; McKee, S.A.; Robins, G. & Zhang, T.

Proceedings of the Third Great Lakes Symposium on VLSI , pp. 90-94 , 1992

Bartal-etal-2003 M~Tennenholtz (ed.) Incentive compatible multi unit combinatorial auctions

Bartal, Y.; Gonen, R. & Nisan, N.

Proceedings of the 9th Conference on Theoretical Aspects of Rationality and Knowledge , pp. 72-87 , 2003

baryamureeba2 On Solving Large Sparse Linear Systems arising from Linear Programming and Linear Regression

V. Baryamureeba

Department of Informatics, University of Bergen , 2000

baryamureeba1 Properties of a class of preconditioners for weighted least squares problems

Baryamureeba, V.; Steihaug, T. & Zhang, Y.

1999

Basagni01 Finding a Maximal Weighted Independent Set in Wireless Networks

Basagni, S.

Telecommunication Systems , Vol. 18 , pp. 155-168 , 2001

Basagni99

url

url



Distributed Clustering for Ad Hoc Networks

Basagni, S.

Proceedings of the 1999 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '99) , pp. 310 , 1999

basescu1 An analytic center cutting plane method in conic programming

V. L. Basescu

Mathematical Sciences, Rensselaer Polytechnic Institute , 2003

basescu2 An analytic center cutting plane approach for conic programming

Basescu, V.L. & Mitchell, J.E.

2004

Bass Road to Ruin

Bass, T.

Discover , pp. 56-61 , 1992

Battiti99 Assigning codes in wireless networks: bounds and scaling properties

Battiti, R.; Bertossi, A.A. & Bonuccelli, M.A.

Wireless Networks , Vol. 5 , pp. 195-209 , 1999

bat01 Reactive Search for Traffic Grooming in WDM Networks

Battiti, R. & Brunato, M.

Evolutionary Trends of the Internet - IWDC2001 , pp. 56-66 , 2001

BatBru01 Local Search Heuristics for Cost Reduction in WDM Bidirectional Rings


Workshop su Sistemi Distribuiti: Algoritmi, Architetture e Linguaggi , pp. ??-?? , 2001



battiti01 Reactive search for Traffic Grooming in WDM networks


Evolutionary Trends of the Internet , pp. 56-66 , 2001

BattitiProtasi01 Reactive local search for the maximum clique problem

Battiti, R. & Protasi, M.


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


Proceedings IEEE INFOCOM '96 , pp. 361-368 , 1996

BauerVarma95 Degree-constrained multicasting in point-to-point networks




Proceedings IEEE INFOCOM '95 , pp. 369-376 , 1995

BV95 Degree-Constrained Multicasting in Point-to-Point Networks


Proceedings IEEE INFOCOM '95, The Conference on Computer Communications , pp. 369-376 , 1995

bauer1 The circuit polytope: facets

Bauer, P.


bauer2 A branch and cut approach to The Cardinality Constrained Circuit problem

Bauer, P.; Linderoth, J.T. & Savelsbergh, M.W.P.


bau86 Intractable computations without local minima

Baum, E.B.

Phys. Rev. Lett. , Vol. 57 , pp. 2764-2767 , 1986

BaWo58 A Warehouse Location Problem

Baumol, W. & Wolfe, P.


BauPer03a Procedimientos para la localización de áreas de aportación de residuos urbanos

Bautista, J. & Pereira, J.

url



27 Congreso Nacional de Estadstica e Investigación Operativa , 2003

BauSuaMatCom00a Local search heuristics for the assembly line balancing

problem with incompatibilities between tasks

Bautista, J.; Suárez, R.; Mateo, M. & Companys, R.

Proceedings of the IEEE ICRA-00 , Vol. 3 , pp. 2404-2409 , 2000

Baybars:Kortanek Transmission facility planning in telecommunications networks: a heuristic approach

Baybars, I. & Kortanek, K.


BaLa1 The nonlinear geometry of linear programming, I. Affine and projective scaling trajectories

Bayer, D.A. & Lagarias, J.C.

Transactions of the American Mathematical Society , Vol. 314 , pp. 499-526 , 1989

BaLa2 The nonlinear geometry of linear programming, II. Legendre transform coordinates and central trajectories

Bayer, D.A. & Lagarias, J.C.


baysal1 Aerodynamic sensitivity analysis methods for the compressible Euler equations

Baysal, O. & Eleshaky, M.E.

Journal of Fluids Engineering , Vol. 113 , pp. 681-688 , 1991

baysal2 Aerodynamic shape optimization using sensitivity analysis on third-order Euler equations



Baysal, O.; Eleshaky, M.E. & Burgreen, G.W.

Journal of Aircraft , Vol. 30 , pp. 953-961 , 1993

BJS90 Linear Programming and Network Flows

Bazaraa, M.; Jarvis, J. & Sherali, H.

John Wiley and Sons , 1990

bazaraa2 Nonlinear Programming: Theory and Algorithms

Bazaraa, M.S.; Sherali, H.D. & Shetty, C.M.

John Wiley , 1993

BazSherShet Nonlinear Programming: Theory and Algorithms

Bazaraa, M.S.; Sherali, H.D. & Shetty, C.M.


BS Nonlinear Programming: Theory and Algorithms

Bazaraa, M.S. & Shetty, C.M.

John Wiley , 1979

baz77 Linear Programming and Network Flows

Bazaraa, M.; Jarvis, J. & Sherali, H.

Wiley , 1977

Baz79 Nonlinear programming -- Theory and algorithms

Bazaraa, M. & Shetty, C.


Beale



Branch and Bound Methods for Mathematical Programming Systems

Beale, E.


Beale:Tomlin Special Facilities in a General Mathematical Programming System for Nonconvex Problems Using Ordered Sets of Variables

Beale, E. & Tomlin, J.

Proceedings of the Fifth International Conference on Operations Research, J. Lawerence, ed., Tavistock Publications , pp. 447-454 , 1970

bean1 Reducing travel costs and player fatigue in the NBA

Bean, J.C. & Birge, J.R.


Bean97 Braess's paradox in a loss network

Beans, N.; Kelly, F. & Taylor, P.

Journal of Applied Prob. , Vol. 34 , pp. 155-159 , 1997

BHH The shortest path through many points

Beardwood, J.; Halton, J.H. & Hammersley, J.M.

Proceedings of the Cambridge Philosophical Society , Vol. 55 , pp. 299-327 , 1959

Beasley1984 An algorithm for the Steiner problem in graphs

Beasley, J.

Networks , Vol. 14 , pp. 147-159 , 1984

Beasley A heuristic for Euclidean and rectilinear Steiner problems

Beasley, J.E.




BeasleySST An SST-based algorithm for the Steiner problem in graphs

Beasley, J.E.

Networks , Vol. 19 , pp. 1-16 , 1989

beasley2 An algorithm for set covering problems

Beasley, J.E.


beasley3 A tree search algorithm for the crew scheduling problem

Beasley, J.E. & Cao, B.


beasley4 An evolutionary heuristic for the index tracking problem

Beasley, J.E.; Meade, N. & Chang, T.


Bea93 Lagrangean relaxation

Beasley, J.

pp. Oxford , 1993

Bea90 OR-Library: Distributing test problems by electronic mail

Beasley, J.


ORLibrary OR-Library: distributing test problems by electronic mail

url



Beasley, J.


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.


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



Graph Problems Arising from Wavelength-Routing in All Optical Networks

Beauquier, B.; Bermond, J.; Gargano, L.; Hell, P.; Pérennes, S. & Vaccaro, U.

2nd IEEE Workshop on Optics and Computer Science. Part of IPPS'97 Genova, Switzerland , Vol. IEEE Press , pp. 11 pages , April, 1997

BeaGarPer97 Graph problems arising from wavelength-routing in all-optical networks

Beauquier, B.; Gargano, L.; Perennes, S.; Bermond, J.; Hell, P. & Vaccaro, U.

Proceedings of the 2nd Workshop on Optics and Computer Science , pp. ??-?? , 1997

bhp98 Optimal wavelength-routed multicasting

Beauquier, B.; Hell, P. & Perennes, S.


beck3 Mirror descent and nonlinear projected subgradient methods for convex optimization

Beck, A. & Teboulle, M.


beck2 Global optimality conditions for quadratic optimization problems with binary constraints



beck1 A probabilistic result for the max-cut problem on random graphs



Be56



Studies in Economics of Transportation

Beckmann, M.; McGuire, C. & Winsten, C.

Yale University Press , 1956

Beck On the Theory of Traffic Flows in Networks

Beckmann, M.J.

Traffic Quarterly , Vol. 21 , pp. 109-116 , 1967

BeckMcWin Studies in the Economics of Transportation

Beckmann, M.J.; McGuire, C.B. & Winsten, C.B.

Yale University Press , 1956

BednarekTaulbee66 On maximal chains

Bednarek, A.R. & Taulbee, O.E.

Roum. Math. Pres et Appl. , Vol. 11 , pp. 23-25 , 1966

BehrensCarpenterEigerHoLussSeymourSeymourTruax2000 Network planning for xDSL

Behrens, C.; Carpenter, T.; Eiger, M.; Ho, Y.; Luss, H.; Seymour, G.; Seymour, P. & Truax, G.

Proceedings of the 16th Annual National Fiber Optic Engineers Conference , 2000

BehrensCarpenterEigerHoSeymour2001 Enhanced xDSL planning

Behrens, C.; Carpenter, T.; Eiger, M.; Ho, Y. & Seymour, P.


beisel1 Controlled Potential Reduction Methods for Linear Programming

Beisel, E. & Mendel, M.

2000

url



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.


bellamy91 Digital Telephony

Bellamy, J.

John Wiley , 1991

bellavia1 An inexact interior point method for monotone NCP

Bellavia, S. & Macconi, M.


B57 Dynamic Programming

Bellman, R.

Princeton University Press , 1957

BELLMAN Dynamic Programming



Bellman, R.E.


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.




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.


Ben-Ameur:Gourdin Internet routing and related topology issues

Ben-Ameur, W. & Gourdin, E.


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.


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.




bental15 Robust optimization --- methodology and applications

Ben-Tal, A. & Nemirovski, A.


bental13 Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications

Ben-Tal, A. & Nemirovskii, A.

SIAM , 2001

bental3 On polyhedral approximations of the second-order cone



bental10 Robust solutions of linear programming problems contaminated with uncertain data



bental8 On the quality of SDP approximations of uncertain SDP programs affected by box uncertainty


2000

bental6 Robust solutions of uncertain linear programs



url

url



bental4 On the quality of SDP approximations of uncertain SDP programs


1998

bental5 Robust convex optimization



bental1 Convex optimization in engineering: Modeling, analysis, algorithms


1997

bental2 Potential reduction polynomial time method for truss topology design



bental11 A conjugate duality scheme generating a new class of differentiable duals

Ben-Tal, A. & Teboulle, M.


bental14 Hidden convexity in some nonconvex quadratically constrained quadratic programming

Ben-Tal, A. & Teboulle, M.


Be62 Partitioning Procedures for Solving Mixed Integer Variables Programming Problems

url



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.


bengtsson1 On portfolio selection: Improved covariance matrix estimation for Swedish asset returns

Bengtsson, C. & Holst, J.

2002

Benichou:etal Experiments in Mixed Integer Linear Programming

Benichou, M.; Gauthier, J.; Girodet, P.; Hehntges, G.; Ribiere, G. & Vincent, O.


Benichou The efficient solution of large-scale linear programming problems - some algorithmic techniques and computational results

Benichou, M.; Gauthier, J.; Hehntges, G. & Ribiere, G.


bennaceur1 An incremental branch-and-bound method for the satisfiability problem

url



Bennaceur, H.; Gouachi, I. & Plateau, G.


Be94 Global tree optimization: A non-greedy decision tree algorithm

Bennet, K.

Computing Science and Statistics , Vol. 26 , pp. 156-160 , 1994

Be93 Bilinear separation of two sets in $n$-space

Bennet, K. & Mangasarian, O.


Be92 Robust linear programming discrimination of two linearly inseparable sets

Bennet, K. & Mangasarian, O.


bennett02 Tutorial on Grooming Switches

Bennett, G.

LightReading , 2002

bennett1 A parametric optimization method for machine learning

Bennett, K.P. & Bredensteiner, E.J.


bensonhy3 A Comparative Study of Large-Scale Nonlinear Optimization Algorithms

Benson, H.Y.; Shanno, D.F. & Vanderbei, R.J.

2001

url



bensonhy1 Interior-Point Methods for Nonconvex Nonlinear Programming: Jamming and Comparative Numerical Testing


2000

bensonhy2 Interior-Point Methods for Nonconvex Nonlinear Programming: Filter Methods and Merit Functions


2000

bensonhy4 Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming

Benson, H.Y. & Vanderbei, R.J.


benson5 Parallel computing on semidefinite programs

Benson, S.J.

2002

benson3 GPCG: A case study in the performance and scalability of optimization algorithms

Benson, S.J.; McInnes, L.C. & Moré, J.J.

2000

benson4 DSDP4 -- a software package implementing the dual-scaling algorithm for semidefinite programming

Benson, S.J. & Ye, Y.

2002

benson1

url

url

url

url

url



Solving large-scale sparse semidefinite programs for combinatorial optimization

Benson, S.J.; Ye, Y. & Zhang, X.


benson2 Mixed Linear and Semidefinite Programming for Combinatorial and Quadratic Optimization

Benson, S.J.; Ye, Y. & Zhang, X.


bentham1 Radio link frequency assignment project, Technical annex T--2.3.2: Potential reduction methods

van Bentham, H.; Hipolito, A.; Jansen, B.; Roos, C.; Terlaky, T. & Warners, J.

1995

beraldi1 The probabilistic set-covering problem

Beraldi, P. & Ruszczyski, A.


Bere84 Highway-capacity utilization and investment in transportation corridors

Berechman, J.

Environment and Planning , Vol. 16A , pp. 1475-1488 , 1984

Berg Radio Resource Management in Bunched Personal Communication Systems

Berg, M.

2002

berge

url

url



Graphs and Hypergraphs

Berge, C.

North-Holland Mathematical Library , 1976

gra73-1 Graphs and hypergraphs

Berge, C.

North-Holland , 1973

ber70 Graphes et Hypergraphes

Berge, C.

Dunod , 1970

Berge62 The Theory of Graphs and its Applications

Berge, C.

Methuen , 1962

berger2 A tabu search procedure for target-matching in financial scenario generation

Berger, A.J.; Mitchell, J.E.; Mulvey, J.M. & Rush, R.

1997

berger1 Solving multistage stochastic programs using tree dissection

Berger, A.J.; Mulvey, J.M.; Rothberg, E. & Vanderbei, R.J.

1995

BK00 Dimensioning Bandwidth for Elastic Traffic in High-Speed Data Networks

Berger, A. & Kogan, Y.

IEEE-ACM Transactions on Networking , Vol. 8 , pp. 643-654 , 2000

url

url



Berger:Raghavan Long-Distance Access Network Design

Berger, R. & Raghavan, S.


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

Berkelaar, A.B.

1997

berkelaar5 A primal-dual decomposition-based interior point approach to two-stage stochastic linear programming

Berkelaar, A.B.; Dert, C.; Oldenkamp, B. & Zhang, S.


berkelaar2 Basis- and partition Identification for Quadratic Programming and Linear Complementarity Problems

Berkelaar, A.B.; Jansen, B.; Roos, C. & Terlaky, T.


berkelaar1 Sensitivity Analysis for Degenerate Quadratic Programming

Berkelaar, A.B.; Jansen, B.; Roos, C. & Terlaky, T.

1996

berkelaar3 Polynomial Primal-Dual Cone Affine Scaling for Semidefinite

url

url

url

url

url



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.


BR Improved approximations for the Steiner tree problem



BermanRamaiyerConf Improved approximations for the Steiner tree problem


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



Bermond, J. & Coudert, D.

ICC '03 , Vol. 2 , pp. 1402 - 1406 , 2003

Bern Faster exact algorithms for Steiner trees in planar networks

Bern, M.

Networks , Vol. 20 , pp. 109-120 , 1990

BernPlassmann The Steiner problem with edge lengths 1 and 2

Bern, M. & Plassmann, P.

Information Processing Letters , Vol. 32 , pp. 171-176 , 1989

B88 Two probabilistic results on rectilinear Steiner trees

Bern, M.W.


Bern96 Solving the nonadditive traffic equilibrium problem

Bernstein, D. & Gabriel, S.

1996

BerGMMP98 Research Activities on UMTS Radio Interface, Network Architectures, and Planning

Berruto, E.; Gudmundson, M.; Menolascino, R.; Mohr, W. & Pizarroso, M.

IEEE Communications Magazine , pp. 82-95 , 1998

berry1 Path optimization for graph partitioning problems

Berry, J. & Goldberg, M.




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



01bmo Grooming dynamic traffic in unidirectional SONET ring networks


OFC/IOOC '99 , Vol. 1 , pp. 71 - 73 , 1999

Bertossi95 Code assignment for hidden terminal interference avoidance in multihop packet radio networks

Bertossi, A.A. & Bonuccelli, M.A.

IEEE/ACM Trans. Netw. , Vol. 3 , pp. 441-449 , 1995

Ber91 Linear Network Optimization: Algorithms and Codes

Bertsekas, D.

The MIT Press , 1991

Berteskas92 Data Networks

doi



Bertsekas, D. & Gallager, R.


BG92 Data Networks


Prentice Hall , 1992

BeGa87 Data Networks



ber87 Data Networks



berg87 Data networks



BerTse94 RELAX-IV: A faster version of the RELAX code for solving minimum cost flow problems

Bertsekas, D. & Tseng, P.

1994

BerTse90 RELAXT-III: A new and improved version of the RELAX code, Lab. for Information and Decision Systems Report P-1990

Bertsekas, D. & Tseng, P.

1990



ber95 Nonlinear Programming

Bertsekas, D.P.


BerGal Data Networks

Bertsekas, D.P. & Gallager, R.


Ber98a Network Optimization: Continuous and Discrete Models

Bertsekas, D.

Athena Scientific , 1998

Bertsekas98 Network optimization: Continuous and discrete models

Bertsekas, D.


Ber95a Dynamic Programming and Optimal Control, Vol. 1--2

Bertsekas, D.


Ber91a Linear networks optimization: Algorithms and Codes

Bertsekas, D.

MIT Press , 1991

Ber91b An Auction Algorithm for shortest paths

Bertsekas, D.




Ber88a The Auction Algorithm: A distributed relaxation method

for the assignment problems

Bertsekas, D.

Annals of Operation Research , Vol. 14 , pp. 105-123 , 1988

Ber85a A distributed asynchronous relaxation algorithm for theAssignment Problem

Bertsekas, D.

Proceedings of the $24^th$ IEEE Conference on Decisionand Control , pp. 1703-1704 , 1985

Ber82 Constrained optimization and Lagrange multiplier methods

Bertsekas, D.

Academic Press , 1982

Ber82a Projected Newton methods for optimization problems with simple constraints

Bertsekas, D.

SIAM Journal on Control and Optimization , Vol. 20 , pp. 221-246 , 1982

Ber79a A distributed Algorithm for the Assignment Problem

Bertsekas, D.

1979

Ber76 On the Goldstein-Levitin-Polyak gradient projection method

Bertsekas, D.



IEEE Trans. Automat. Control , Vol. AC-21 , pp. 174-184 , 1976

BerCas91a A generic auction algorithm for the minimum costnetwork flow problem

Bertsekas, D. & Castanon, D.

1991

BerCas89a The Auction Algorithm for minimum cost network flowproblem


1989

BerCas89b The Auction Algorithm for transportation problems


Annals of Operation Research , Vol. 20 , pp. 67-96 , 1989

BerCas93a Asynchronous Hungarian Methods for the Assignment

Problem

Bertsekas, D. & Costanon, D.


Ber83 Projected Newton methods and optimization of multicommodity flows

Bertsekas, D. & Gafni, E.

IEEE Trans. Automat. Control , Vol. AC-28 , pp. 1090-1096 , 1983

Ber84 Second derivative algorithms for minimum delay distributed routing in networks

Bertsekas, D.; Gafni, E. & Gallager, R.

IEEE Trans. Comm. , Vol. COM-32 , pp. 911-919 , 1984



Ber92 Data networks



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.


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.


bertsimas3



On the worst case complexity of potential reduction algorithms for linear programming

Bertsimas, D. & Luo, X.


bertsimas1 A technique for speeding up the solution of the Lagrangean dual

Bertsimas, D. & Orlin, J.B.


bertsimas7 On the relation between option and stock prices: a convex optimization approach

Bertsimas, D. & Popescu, I.


bertsimas9 The price of robustness

Bertsimas, D. & Sim, M.


BS04 The price of robustness

Bertsimas, D. & Sim, M.


bertsimas2 A new generation of vehicle routing research: Robust algorithms, addressing uncertainty

Bertsimas, D. & Simchi-Levi, D.


bertsimas6 From valid inequalities to heuristics: a unified view of primal-dual approximation algorithms in covering problems



Bertsimas, D. & Teo, C.


bertsimas5 Introduction to Linear Optimization

Bertsimas, D. & Tsitsiklis, J.

Athena , 1997

bertsimas4 Rounding algorithms for covering problems

Bertsimas, D. & Vohra, R.


bertsekas92 Data Networks

Betsekas, D. & Gallager, R.


BetserAvritzerCarlyleKarplus1989 Configuration synthesis for a heterogeneous backbone cluster and a PC-interface network

Betser, J.; Avritzer, A.; Carlyle, J. & Karplu, W.

Proceedings of IEEE INFOCOM 8 , pp. 400-40 , 1989

98betts Optimization Models for Telecommunications Networks Planning and Design: Channel Assignment and Equipment Selection

D. Betts

Southern Methodist University , 1998

KJ83 Routing to multiple destinations in computer networks

Bharath-Kumar, K. & Jaffe, J.

IEEE Transactions on Communications , Vol. 31 , pp. 343-351 , 1983



bhargava1 The world wide web: opportunities for operations research and management science

Bhargava, H.K. & Krishnan, R.


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.


biegler1 Numerical experience with a reduced Hessian method for large url



scale optimization

Biegler, L.; Nocedal, J.; Schmid, C. & Ternet, D.

1997

biemur01 Strong inequalities for capacitated survivable network design problems

Bienstock, C. & Muratore, G.


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.


Bi93a Computational experience with an effective heuristic for some

capacity expansion problems in local access networks

Bienstock, D.


Bi93b A lot-sizing problem on trees, related to network design

Bienstock, D.


des90-2 On the structure of minimum-weight



$k$-connected spanning networks

Bienstock, D.; Brickell, E. & Monma, C.

SIAM J. Discrete Math. , Vol. 3 , pp. 320-329 , 1990

bienstock4 Minimum cost capacity installation for multicommodity network flows

Bienstock, D.; Chopra, S.; Günlük, O. & Tsai, C.


des98-1 Minimum cost capacity installation for multicommodity network flows



des95-10 Minimum cost capacity installation for multicommodity network flows


1995

biechoguntsa98 Minimum cost capacity installation for multicommodity network flows



Bienstock:Chopra:Gunluk:Tsai Minimum cost capacity installation for multicommodity network flows.



BCGT98 Minimum cost capacity installation for multicommodity network flows


Math. Program. , Vol. 81 , pp. 177-200 , 1998



bienstock3 Computational integer programming (Foreword)

Bienstock, D. & Cook, W.


biegun96 Capacitated network design-polyhedral structure and computation

Bienstock, D. & Günlük, O.

INFORMS Journal on Computing , pp. 243-259 , 1996

bienstock2 Computational experience with a difficult mixed integer multicommodity flow problem



BiGu96 Capacitated network design - polyhedral structure and computation



BiGu95 Computational Experience with a Difficult Mixed-Integer Multicommodity Flow Problem



bieg95 Computational Experience with a Difficult Mixed-integer Multicommodity Flow Problem



Bienstock:Marcotte



On a network design problem that is intractable on trees

Bienstock, D. & Marcotte, O.


bienstock5 Strong inequalities for capacitated survivable network design problems

Bienstock, D. & Muratore, G.


Bie00 Aymptotic analysis of the flow deviation method for the maximum concurrent flow problem

Bienstock, D. & Raskina, O.


bier02 Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem

Bienstock, D. & Raskina, O.


Bienstock03 Combined Network Design and Multi-Period Pricing: Modeling, Solution Techniques and computation

Bienstock, D.; Raskina, O.; Saniee, I. & Wang, Q.

to appear in Operations Research , 2003

Bie02 Combined network design and multi-period pricing: Modeling, solution techniques and computation

Bienstock, D.; Raskina, O.; Saniee, I. & Wang, Q.

2002

BienstockSaniee2001 ATM network design: Traffic models and optimization-based heuristics



Bienstock, D. & Saniee, I.


Bie98 ATM network design: Traffic models and optimization-based heuristics

Bienstock, D. & Saniee, I.

1998

bienstock6 Subset algebra lift operators for 0-1 integer programming

Bienstock, D. & Zuckerberg, M.

2002

BihaMahjoub00 Steiner k-Edge Connected Subgraph Polyhedra

Biha, M. & Mahjoub, A.


Bikhchandani-Ostroy-2002 The package assignment model

Bikhchandani, S. & Ostroy, J.

Journal of Economic Theory , Vol. 2002 , pp. 377-406 , 2003

Bikhchandani-Ostroy-2002b Ascending Price Vickrey Auctions

Bikhchandani, S. & Ostroy, J.

2002

Bikhchandani-etal-2001 Linear programming and Vickrey auctions

Bikhchandani, S.; de Vries, S.; Schummer, J. & Vohra, R.R.

in Brenda Dietrich and Rakesh R. Vohra (eds.) Mathematics of the Internet - E-Auctions and Markets , pp. 75-117 , 2001

url



BiKr77 Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem

Bilde, O. & Krarup, J.


05bil Multicast traffic grooming in WDM optical mesh networks

Billah, A.; Wang, B. & Awwal, A.


3bil Effective traffic grooming in WDM rings

Billah, A.; Wang, B. & Awwal, A.


des73-1 Network design with fixed and variable

costs elements

Billheimer, J. & Gray, P.


billups3 Improving the robustness of descent-based methods for semi-smooth equations using proximal perturbations

Billups, S.C. & Ferris, M.C.


billups2 QPCOMP: A quadratic programming based solver for mixed complementarity problems





BillupsFerris Convergence of infeasible interior point algorithms from arbitrary starting points


1993

BinHerLoeRes01a A GRASP for job shop scheduling

Binato, S.; Hery, W.; Loewenstern, D. & Resende, M.

pp. 59-79 , 2002

BinHerLoeRes02a A greedy randomized adaptive search

procedure for job shop scheduling

pp. 58-79 , 2002

BinOli01a A reactive GRASP for transmission network expansion planning

Binato, S. & Oliveira, G.

pp. 81-100 , 2002

BinOli02a A Reactive GRASP for transmission network expansion

planning


pp. 81-100 , 2002

BinOli99a A Reactive GRASP for transmission network expansion planning




1999

BinOliAra01a A greedy randomized adaptive search procedure for

transmission expansion planning

Binato, S.; Oliveira, G. & Araújo, J.

IEEE Transactions on Power Systems , Vol. 16 , pp. 247-253 , 2001

BinFarRes01a Greedy randomized adaptive path relinking

Binato, S.; Faria Jr., H. & Resende, M.

Proceedings of the IV Metaheuristics International Conference , pp. 393-397 , 2001

BibDidLioNon02a Labeling heuristics for orthogonal drawings

Binucci, C.; Didimo, W.; Liotta, G. & Nonato, M.

Vol. 2265 , pp. 139-153 , 2002

Bin00 Radio Network Planning with Neural Networks

Binzer, T. & Landstorfer, F.

Proceedings of IEEE Vehicular Technology Conference (VTC Fall 2000) , 2000

birge4 Stochastic Programming Computation and Applications

Birge, J.R.


birge1 Decomposition and partitioning methods for multistage stochastic linear programs

Birge, J.R.


pdf url

url



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.


birge5 Optimal flows in stochastic dynamic networks with congestion

Birge, J.R. & Ho, J.


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.


birman95 Routing and wavelength assignment methods in single-hop all-optical



networks with blocking

Birman, A. & Kershenbaum, A.

INFOCOM '95: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume , pp. 431 , 1995

bischof1 ADIFOR, Generating derivative codes from FORTRAN programs

Bischof, C.; Carle, A.; Corliss, G.; Griewank, A. & Howland, P.

1991

Biswas03 Intercarrier Bandwidth Exchange : An Engineering Framework

Biswas, S.; Saha, D. & Mandal, N.


Bixby96 Bixby, R.

1996

bixby10 Solving real-world linear programs: a decade and more of progress

Bixby, R.E.


Bixby3 Progress in Linear Programming

Bixby, R.E.


bixby5 Implementing the simplex method: The initial basis

Bixby, R.E.




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.


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.


bixby7 Solving a truck dispatching scheduling problem using branch-and-cut

Bixby, R.E. & Lee, E.K.


bixby9 Parallelizing the dual simplex method



Bixby, R.E. & Martin, A.


Bixby4 Recovering An Optimal LP Basis From An Interior Point Solution

Bixby, R.E. & Saltzman, M.J.


Bixby:Cook:Cox:Lee_1999 Computational experience with parallel mixed integer programming in a distributed environment

Bixby, R.; Cook, W.; Cox, A. & E.~K.~Lee


Bixby:Cook:Cox:Lee3 Computational experience with parallel mixed integer programming in a distributed environment

Bixby, R.; Cook, W.; Cox, A. & Lee, E.

Annals of Operations Research -- Parallel Optimization , Vol. 90 , pp. 19-43 , 1999

Bixby:Lee:2 Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut

Bixby, R. & E.K.~Lee


Bixby:Lee Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut

Bixby, R. & E.K.~Lee

1993

Bixby:Martin_1997 Parallelizing the dual simplex method

Bixby, R. & Martin, A.

1997



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.


Bjo Least Squares Methods

Björck, 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.


BleyEtAl2003 Kosten- und Qualitätsoptimierung in Kommunikationsnetzen



Bley, A.; Koster, A.; Kröller, A.; Wessäly, R. & Zymolka, A.

Telekommunikation Aktuell , Vol. 57 , pp. 1-62 , 2003

BG96 An approximate algorithm for combinatorial optimization problems with two parameters

Blokh, D. & Gutin, G.

Australasian J. Combin. , Vol. 14 , pp. 157-164 , 1996

Blue96 Hybrid extreme point tabu search

Blue, J. & Bennett, K.

1996

BluRol03a Metaheuristics in combinatorial optimization: Overview and conceptual comparison

Blum, C. & Roli, A.

ACM COmputing Surveys , Vol. 35 , pp. 268-308 , 2003

bobrovnikova1 Accurate solution of weighted least squares by iterative methods

Bobrovnikova, E. & Vavasis, S.

1997

bockmayr1 Branch and infer: a unifying framework for integer and finite domain constraint programming

Bockmayr, A. & Kasper, T.


BodinGoldenAssadBall1983 Routing and scheduling of vehicles and crews

Bodin, L.D.; Golden, B.L.; Assad, A.A. & Ball, M.O.

url




Boehning:Butler:Gillett_1988 A parallel integer linear programming algorithm

Boehning, R.; Butler, R. & Gillett, B.


Boesch91 On the existence of uniformly optimally reliable networks

Boesch, F.; Li, X. & Suffel, C.

Networks , Vol. 21 , pp. 181-94 , 1991

BoeseKahngMccoyRobins Near-optimal critical sink routing tree constructions

Boese, K.D.; Kahng, A.B.; McCoy, B.A. & Robins, G.

IEEE Transactions on Computer-Aided Design , pp. 1417-1436 , 1995

BoeseKahngMccoyRobinsSteiner Rectilinear Steiner trees with minimum Elmore delay


Proceeedings of the Design Automation Conference , pp. 381-386 , 1994

BoeseKahngMccoyRobinsICCD Fidelity and near-optimality of Elmore-based routing constructions


Proceedings of the International Conference on Computer Design , pp. 182-187 , 1993

boese1 A new adaptive multi-start technique for combinatorial global optimizations

Boese, K.D.; Kahng, A.B. & Muddu, S.


BoeseKahngRobins



High-performance routing trees with identified critical sinks

Boese, K.D.; Kahng, A.B. & Robins, G.

Proceedings of the Thirtieth Design Automation Conference , pp. 182-187 , 1993

Bo89 Location Problems Arising in Computer Networks

Boffey, T.


BoKa84 P-Median and Multi-Medians

Boffey, T. & Karkazis, J.


Bogdanowicz93 A new optimal algorithm for backbone topology design in communications networks

Bogdanowicz, Z.

Mathematical and Computer Modelling , Vol. 17 , pp. 49-61 , 1993

BDDW Algorithmic enhancements to the method of centers for linear programming problems

Boggs, P.T.; Domich, P.D.; Donaldson, J.R. & Witzgall, C.


boggs2 An interior-point method for general large scale quadratic programming problems

Boggs, P.T.; Domich, P.D. & Rogers, J.E.


boggs2:old An interior-point method for general large scale quadratic programming problems

url



Boggs, P.T.; Domich, P.D.; Rogers, J.E. & Witzgall, C.

1994

boggs3 A practical algorithm for general large scale nonlinear optimization problems

Boggs, P.T.; Kearsley, A.J. & Tolle, J.W.


boggs4 Sequential quadratic programming

Boggs, P.T. & Tolle, J.W.

Acta Numerica , Vol. ? , pp. ???-??? , 1996

boggs5 A global convergence analysis of an algorithm for large-scale nonlinear optimization problems

Boggs, P.T.; Tolle, J.W. & Kearsley, A.J.


BoBuPaAMS Modeling and Optimization in Massive Graphs

Boginski, V.; Butenko, S. & Pardalos, P.M.

pp. 17-39 , 2003

BoBuPaAnna On Structural Properties of the Market Graph

Boginski, V.; Butenko, S. & Pardalos, P.M.

2003

bohnenblust1 Joint positiveness of matrices

Bohnenblust, J.

1940s

url

url



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.


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.


bollapragada1 Optimal design of truss structures by logic-based branch and cut

Bollapragada, S.; Ghattas, O. & Hooker, J.N.


BollobasEtAl04 On the value of a random minimum weigth Steiner tree



Bollobás, B.; Gamarnik, D.; Riordan, O. & Sudakov, B.


bollobas88 The chromatic number of random graphs

Bollobás, B.


bollobas Random Graphs

Bollobás, B.


bollobas78 Extremal Graph Theory

Bollobás, B.


b-e Cliques in random graphs

Bollobás, B. & Erdös, P.

Math. Proc. Camb. Phil. Soc. , Vol. 80 , pp. 419-427 , 1976

Bomze97 Evolution towards the maximum clique

Bomze, I.M.


BomzeA99 The maximum clique problem

Bomze, I.M.; Budinich, M.; Pardalos, P.M. & Pelillo, M.

pp. 1-74 , 1999

Bomze2



A new `ànnealed'' heuristic for the maximum clique problem

Bomze, I.M.; Budinich, M.; Pelillo, M. & Rossi, C.

pp. 78-96 , 2000

bomze1 Solving standard quadratic optimization problems via linear, semidefinite and copositive programming

Bomze, I.M. & de Klerk, E.

2001

Bomze3 Evolutionary approach to the maximum clique problem: empirical evidence on a larger scale

Bomze, I.M.; Pelillo, M. & Giacomini, R.

pp. 95-108 , 1997

BONALD IP Traffic and QoS Control: The Need for a Flow-Aware Architecture

Bonald, T.; Oueslanti-Boulahia, S. & Roberts, J.W.

World Telecommunications Congress , 2002

boga94ga Guaranteed approximation of Markov chains with applications to multiplexer engineering in ATM networks

Bonatti, M. & A.~Gaivoronski


Bon94 Guaranteed approximation of Markov chains with applications to multiplexer engineering in ATM networks

Bonatti, M. & Gaivoronski, A.


Bon94b Summary of some traffic engineering studies carried out within RACE

url



Bonatti, M.; Gaivoronski, A.; Lemoche, P. & Polese, P.

European Transactions on Telecommunications , Vol. 5 , pp. 207-218 , 1994

boga94wc Worst case analysis of ATM sources with application to access engineering of broadband multiservice networks

Bonatti, M. & Gaivoronski, A.

Proceedings of 14th International Teletraffic Congress , pp. 559-570 , 1994

BonattiGaivoronskiLemonchePolese94 Summary of some traffic engineering studies carried out within RACE project R1044

Bonatti, M.; A.~Gaivoronski; P.~Lemonche & P.~Polese


bonaventure:04 The Case for More Versatile BGP Route Reflectors

Bonaventure, O.; Uhlig, S. & Quoitin, B.

2004

BoMu Graph Theory with Applications

Bondy, J.A. & Murty, U.S.R.

Macmillan , 1976

gra76-2 Graph theory with applications

Bondy, J. & Murty, U.

Universities Press , 1976

bonnans1 Convergence of interior point algorithms for the monotone linear complementarity problem

Bonnans, J.F. & Gonzaga, C.C.



1993

bonnans2 Sequential quadratic programming with penalization of the displacement

Bonnans, J.F. & Launay, G.


bonnans5 Perturbed path following predictor-corrector interior point algorithms

Bonnans, J.F.; Pola, C. & Rebai, R.


bonnans3 On the convergence of the iteration sequence of infeasible path following algorithms for linear complementarity problems

Bonnans, J.F. & Potra, F.


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.


BGLS97 Optimisation numérique: Aspects théoriques et pratiques

Bonnans, J.; Gilbert, J.; C.~Lemaréchal & C.~Sagastizábal

Springer Verlag , 1997

rebbonhadlis00 Proximal decomposition method for solving global survivability in



telecommunication networks

Bonnans, J.; Haddou, M.; Lisser, A. & R.Rébaï

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.


Bonuccelli97 On scheduling variable length broadcasts in wireless networks

Bonuccelli, M.A. & Leonardi, S.


boon1 Team formation: Matching quality supply and quality demand

Boon, B.H. & Sierksma, G.


BoFr77 Large-Scale Network Topological Optimization

Boorstyn, R. & Frank, H.


Booth Analytic formulas for full Steiner trees

Booth, R.S.

Discrete and Computational Geometry , Vol. 6 , pp. 69-82 , 1991



BorchersDu The $k$-Steiner ratio in graphs

Borchers, A. & Du, D.


brian14 Implementation issues in CSDP

Borchers, B.

2001

brian11 CSDP, a C library for semidefinite programming

Borchers, B.


brian13 CSDP 2.3 user's guide

Borchers, B.


SDPLIB SDPLIB 1.2, a library of semidefinite programming test problems

Borchers, B.


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

url

url



Borchers, B. & Furman, J.


brian8 Three Methods to the Exact Solution of MAX-SAT Problems

Borchers, B.; Joy, S. & Mitchell, J.E.

1996

brian7 Solving MAX-SAT with heuristics and branch and cut

Borchers, B.; Joy, S. & Mitchell, J.E.

1995

brian9 A computational comparison of Branch and Bound and Outer Approximation Methods for 0-1 mixed integer nonlinear programs

Borchers, B. & Mitchell, J.E.


Brian200 An improved branch and bound algorithm for mixed integer nonlinear programming


Computers and Operations Research , Vol. 21(4) , pp. 359-367 , 1994

Brian195 Using an interior point method in a branch and bound algorithm for integer programming


1991

Borchers1991 Using an interior point method in a branch and bound algorithm for integer programming

Borchers, B. & Mitchell, J.



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 LP-polyhedra under orthogonal projection on two-dimensional planes

Borgwardt, K.H.


Bor The Simplex Method: A Probabilistic Analysis

Borgwardt, K.H.


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

Borndörfer, R.; Eisenblätter, A.; Grötschel, M. & Martin, A.


BoEiGrMa98b The orientation model for frequency assignment problems



Borndörfer, R.; Eisenblätter, A.; Grötschel, M. & Martin, A.

1998

borndorfer1 Set packing relaxations of some integer programs

Borndörfer, R. & Weismantel, R.


BorYan98 Online computation and competitive analysis

Borodin, A. & El-Yaniv, R.

Oxford University Press , 1998

boros2 Chvátal cuts and odd cycle inequalities in quadratic 0-1 optimization

Boros, E.; Crama, Y. & Hammer, P.L.


Boros1 Cut-polytopes, boolean quadric polytopes and nonnegative quadratic pseudo-boolean functions

Boros, E. & Hammer, P.L.


boros3 Balancing problems in acyclic networks

Boros, E.; Hammer, P.L.; Hartmann, M.E. & Shamir, R.


Borst94a Polling Systems

S. Borst

CWI, The Netherlands , 1994



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.


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.


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.



Socio-Economic Planning Sciences , Vol. 30(3) , pp. 157-162 , 1996

bosch1 Big Mac Attack: The Diet Problem Revisited at McDonald's

Bosch, R.A.

OR/MS Today , pp. 30-31 , 1993

bosch5 Pointillism via Linear Programming

Bosch, R. & Herman, A.

2004

bosch6 Continuous line drawings via the traveling salesman problem

Bosch, R. & Herman, A.


Boswell2003 Distributed High-Performance Web Crawlers:

A Survey of the State-of-the Art

Boswell, D.

2003

BoukercheEtAl04 An artificial immune based intrusion detection model for computer and telecommunication systems

Boukerche, A.; Jucá, K.; Sobral, J. & Notare, M.


Bourbeau05 Design for optimized multi-lateral multi-commodity markets

Bourbeau, B.; Crainic, T.G.; Gendreau, M. & Robert, J.


url

url



bourjolly1 A combinatorial column generation algorithm for the maximum stable set problem

Bourjolly, J.; Laporte, G. & Mercure, H.


Bo78 A heuristic technique for assigning frequencies to mobile radio nets

Box, F.


Boxma93 Efficient Visit Orders for Polling Systems

Boxma, O.; H.~Levy & Weststrate, J.


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



solving combinatorial linear programs containing a sufficiently large ball

Boyd, E.A.


aboyd3 On the complexity of a cutting plane algorithm for solving combinatorial linear programs

Boyd, E.A.


ABoyd1 Fenchel Cutting Planes for Integer Programs

Boyd, E.A.


boyd1 Linear Matrix Inequalities in System and Control Theory

Boyd, S.; Ghaoui, L.E.; Feron, E. & Balakrishnan, V.

SIAM , 1994

boyd2 Convex Optimization

Boyd, S. & Vandenberghe, L.

Cambridge University Press , 2004

sboyd2 A new bound for the ration between the 2-matching problem and its linear programming relaxation

Boyd, S.C. & Carr, R.


BoydPy Optimizing over the subtour polytope of the travelling salesman problem

Boyd, S.C. & Pulleyblank, W.R.

url



Mathematical Programming , Vol. 49(2) , pp. 163-187 , 1990/1991

des93-2 An integer polytope related to the design

of survivable communication networks

Boyd, S. & Hao, T.


tsp91-1 Optimizing over the subtour polytope of the travelling salesman problem

Boyd, S. & Pulleyblank, W.


des94-9 Transforming clique tree inequalities to induce

facets for the 2-edge connected polytope

Boyd, S. & Zhang, F.

1994

Brelaz79 New methods to color the vertices of a graph

Brélaz, D.


Brackett89 Dense wavelength division networks: principles and applications

Brackett, C.


BraBroGra77 Design and implementation of large-scale primal transshipment algorithms

doi



Bradley, G.; Brown, G. & Graves, G.


BrBrGr77 Design and Implementation of Large Scale Primal Transshipment Algorithms

Bradley, G.; Brown, G. & Graves, G.


Bradley:Hammer:Wolsey Coefficient Reduction in 0-1 Variables

Bradley, G.; Hammer, P. & Wolsey, L.


bradley2 Mathematical programming for data mining: formulations and challenges

Bradley, P.S.; Fayyad, U.M. & Mangasarian, O.L.


P.S.-Bradley98 Mathematical programming for data mining: Formulations and challenges

Bradley, P.S.; Fayyad, U.M. & Mangasarian, O.L.

1998

bradley3 Massive data discrimination via linear support vector machines

Bradley, P.S. & Mangasarian, O.L.

Optimization Methods and Software , Vol. 13(1) , pp. 1-10 , 2000

bradley1 Feature selection via mathematical programming

Bradley, P.S.; Mangasarian, O.L. & Street, W.N.




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.


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.


BramSim The Logic of Logistics: Theory, Algorithms, and Applications for Logistics Management

Bramel, J. & Simchi-Levi, D.


bra87 Algorithmique: conception et analyse



Brassard, G. & Bratley, P.

Masson , 1987

JEM_sdpheur A semidefinite programming heuristic for quadratic programming problems with complementarity constraints

Braun, S. & Mitchell, J.E.

2002

braun.thesis Solving a quadratic programming problem subject to orthogonality constraints

S. E. Braun


BrazilColeRubinsteinThomasWengWormald Minimal Steiner trees for $2^k 2^k$ square lattices

Brazil, M.; Cole, T.; Rubinstein, J.H.; Thomas, D.A.; Weng, J.F. & Wormald, N.C.

Journal of Combinatorial Theory, Series~A , Vol. 72 , 1995

BrazilNielsenWinterZachariasen04 Rotationally optimal spanning and Steiner trees in uniform orientation metrics

Brazil, M.; Nielsen, B.; Winter, P. & Zachariasen, M.

Computational Geometry , Vol. 29 , pp. 251–-263 , 2004

BrazilRubinsteinWengWormaldThomas Full minimal Steiner trees on lattice sets

Brazil, M.; Rubinstein, J.H.; Thomas, D.A.; Weng, J.F. & Wormald, N.C.

1995

BrazilEtAl01 Gradient-constrained minimum networks. I. Fundamentals

Brazil, M.; Rubinstein, J.; Thomas, D.; Weng, J. & Wormald, N.

url




BrazilThomasWeng02 Forbidden Subpaths for Steiner Minimum Networks in Uniform Orientation Metrics

Brazil, M.; Thomas, D. & Weng, J.

Networks , Vol. 39 , pp. 186–-202 , 2002

BrazilEtAl00 On the Complexity of the Steiner Problem

Brazil, M.; Thomas, D. & Weng, J.


BrazilEtAl02 Canonical Forms and Algorithms for Steiner Trees in Uniform Orientation Metrics

Brazil, M.; Thomas, D.; Weng, J. & Zachariasen, M.

2002

BrazilEtAl04 Flexibility of Steiner Trees in Uniform Orientation Metrics

Brazil, M.; Winter, P. & Zachariasen, M.

2004

Brearley:Mitre:Williams Analysis of Mathematical programming problems prior to applying the simplex method

Brearley, A.; G.~Mitre & H.~P.~Williams


Brecht89 Multiplicative improvements in network reliability bounds

Brecht, T. & Colbourn, C.

Networks , Vol. 19 , pp. 521-9 , 1989



Brecht88 Lower bounds on two-terminal network reliability



Brecht86 Improving reliability bounds in computer networks


Networks , Vol. 16 , pp. 369-80 , 1986

breedam1 Improvement heuristics for the vehicle routing problem based on simulated annealing

Breedam, A.V.


Bre79 New methods to color the vertices of a graph

Brelaz, D.


Bre96a Heuristic-biased stochastic sampling

Bresina, J.

Proceedings of the Thirteenth National Conference on Artificial Intelligence , pp. 271-278 , 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



Breu, R. & Burdet, C.


brimberg1 An oil pipeline design problem

Brimberg, J.; Hansen, P.; Lin, K.; Mladenovi, N. & Breton, M.


bp The anatomy of a large scale hypertextual Web search engine

Brin, S. & Page, L.

Proceedings of the Seventh International World Wide Web Conference , 1998

Google The Anatomy of a Large-Scale Hypertextual Web Search Engine

Brin, S. & Page, L.

1998

brixius1 SDPHA: a MATLAB implementation of homogeneous interior-point algorithms for semidefinite programming

Brixius, N.; Potra, F.A. & Sheng, R.


brixius2 Nonsymmetric search directions for semidefinite programming

Brixius, N.; Potra, F.A. & Sheng, R.


brixius3 Solving quadratic assignment problems using convex quadratic programming relaxations

Brixius, N.W. & Anstreicher, K.M.


url

url



brixius4 The Steinberg Wiring Problem

Brixius, N.W. & Anstreicher, K.M.

2001

BrGuWo96 Designing private line networks - polyhedral analysis and computation

Brockmüller, B.; Günlük, O. & Wolsey, L.A.

1996

bkm Graph structure in the Web

Broder, A.; Kumar, R.; Maghoul, F.; Raghavan, P.; Rajagopalan, S.; Stata, R.; Tomkins, A. & Wiener, J.


bkm00 The Bow-Tie Web

Broder, A.; Kumar, R.; Maghoul, F.; Raghavan, P.; Rajagopalan, S.; Stata, R.; Tompkins, A. & Wiener, J.

Proceedings of the Ninth International World Wide Web Conference , 2000

Broder2003 Efficient URL caching for World Wide Web crawling

Broder, A.Z.; Najork, M. & Wiener, J.

Proc. 12th WWW Conference (WWWC'03) , 2003

BronKerbosch73 Algorithm 457: Finding all cliques on an undirected graph

Bron, C. & Kerbosch, J.

Communications of ACM , Vol. 16 , pp. 575-577 , 1973

Brooks:Geoffrion Finding Everett's Lagrange Multipliers by Linear Programming

url



Brooks, R. & Geoffrion, A.


Brooks41 On Coloring the Nodes of a Network

Brooks, R.L.

Proc. Cambridge Philos. Soc. , Vol. 37 , pp. 194-197 , 1941

brotcorne1 Ambulance location and relocation models

Brotcorne, L.; Laporte, G. & Semet, F.


bls02 Fast heuristic for large scale covering-location problems

Brotcorne, L.; Laporte, G. & Semet, F.


bsss90 A new table of constant weight codes

Brouwer, A.; Shearer, J.; Sloane, N. & Smith, W.

IEEE Trans. Inform. Theory , Vol. 36 , pp. 1334-1380 , 1990

Bro00a Algorithmic methods in genetic mapping

D.C. Brown

Cornell University , 2000

BroVisTan00a Selecting mapping: A discrete optimization approach toselect a population subset for use in a high-densitygenetic mapping project

Brown, D.; Vision, T. & Tanksley, S.

Genetics , Vol. 155 , pp. 407-420 , 2000

pdf url



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.


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.


brunetta1



A branch-and-cut algorithm for the equicut problem

Brunetta, L.; Conforti, M. & Rinaldi, G.


Br79 New methods to color the vertices of a graph

Brélaz, D.


bt On distinguishing between Internet power law topology generators

Bu, T. & Towsley, D.

Proceedings of IEEE INFOCOM , 2002

BuSo99 Object-oriented implementation of parallel genetic algorithms

Bubak, M. & Sowa, K.

Vol. 2 , pp. 331-349 , 1999

bgv On external memory graph traversal

Buchsbaum, A.L.; Goldwasser, M.; Venkatasubramanian, S. & Westbrook, J.R.

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms , pp. 859-860 , 2000

Buchsbaum95 Monte Carlo and Markov chain techniques for network reliability and sampling

Buchsbaum, A. & Mihail, M.

Networks , Vol. 25 , pp. 117-30 , 1995

BuiEppley95 A hybrid genetic algorithm for the maximum clique problem



Bui, T.N. & Eppley, P.H.

Proceedings of the 6th International Conference on Genetic Algorithms , pp. 478-484 , 1995

burer14 Semidefinite Programming in the Space of Partial Positive Semidefinite Matrices

Burer, S.

2002

burer13 Local minima and convergence in low-rank semidefinite programming

Burer, S. & Monteiro, R.D.C.

2003

burer8 A Nonlinear Programming Algorithm for Solving Semidefinite Programs via Low-rank Factorization



burer9 A Computational Study of a Gradient-Based Log-Barrier Algorithm for a Class of Large-Scale SDPs



burer10 A projected gradient algorithm for solving the maxcut SDP relaxation



burer2 A General Framework for Establishing Polynomial Convergence of Long-Step Methods for Semidefinite Programming

url

url

url

url

url




1999

burer1 An efficient algorithm for solving the MAXCUT SDP relaxation


1998

burer12 Solving a class of Semidefinite Programs via Nonlinear Programming

Burer, S.; Monteiro, R.D.C. & Zhang, Y.


burer5 Interior-Point Algorithms for Semidefinite Programming Based on A Nonlinear Programming Formulation



burer6 Rank-Two Relaxation Heuristics for Max-Cut and Other Binary Quadratic Programs



burer7 Maximum Stable Set Formulations and Heuristics Based on Continuous Optimization



BurerA02 Maximum stable set formulations and heuristics based on continuous optimization

url

url

url

url

url





burer11 A Computational Study of a Gradient-Based Log-Barrier Algorithm for a Class of Large-Scale SDPs


2001

BurerA01 Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs


SIAM J. on Optimization , Vol. 12 , pp. 503-521 , 2001

burer3 Solving Semidefinite Programs via Nonlinear Programming. Part I: Transformations and Derivatives


1999

burer4 Solving Semidefinite Programs via Nonlinear Programming. Part II: Interior Point Methods for a Subclass of SDPs


1999

burger1 Functional and numberical solution of a control problem originating from heat transfer

Burger, J. & Pogu, M.

Journal of Optimization Theory and Applications , Vol. 68 , pp. 49-73 , 1991

baysal3 Improving the efficiency of aerodynamic shape optimization

url

url

url



Burgreen, G.W.; Baysal, O. & Eleshaky, M.E.

AIAA Journal , Vol. 32 , pp. 69-76 , 1994

BRRT02 A Memetic Algorithm for OSPF Routing

Buriol, L.S.; Resende, M.G.C.; Ribeiro, C.C. & Thorup, M.

Proc. INFORMS Telecom , pp. 187-188 , 2002

BurResRibTho03a A hybrid genetic algorithm for theweight setting problem in OSPF/IS-IS routing

Buriol, L.; Resende, M.; Ribeiro, C. & Thorup, M.

Networks , 2005

BurResRibTho05 A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing


Networks , 2005

BurResRibTor04 A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing


Networks , Vol. 46 , pp. 36-56 , 2005

BurResTho04 Survivable IP network design with OSPF routing

Buriol, L.; Resende, M. & Thorup, M.

2004

burkard2 Well-solvable special cases of the traveling salesman problem

Burkard, R.E.; Deineko, V.G.; Dal, R.v.; Veen, J.A.A.v.d. & Woeginger, G.J.




burkard3 The travelling salesman problem and the PQ-tree

Burkard, R.E.; Deineko, V.G. & Woeginger, G.J.


BrkDer Assignment and Matching Problems: Solution Methods with FORTRAN Programs

Burkard, R.E. & Derigs, U.

Springer Lecture Notes in Economics and Mathematical Systems, No. 184 , 1980

BurRudWoe96a Three-dimensional axial assignment problems with decomposible cost coefficients

Burkard, R.; Rudolf, R. & Woeginger, G.


BurKen99a Applying ant algorithms and no fit polygon to the

nesting problem

Burke, E. & Kendall, G.

Vol. 1747 , pp. 453-464 , 1999

Burke1 Translational cuts for convex minimization

Burke, J.V.; Goldstein, A.A.; Tseng, P. & Ye, Y.

1993

burke6 Optimizing Matrix Stability

Burke, J.V.; Lewis, A.S. & Overton, M.L.

url



1999

burke5 Variational Analysis of Non-Lipschitz Spectral Functions

Burke, J.V. & Overton, M.L.


burke7 Variational Analysis of the Abscissa Mapping for Polynomials

Burke, J.V. & Overton, M.L.

2000

Burke2 A unified analysis of Hoffman's bound via Fenchel duality

Burke, J.V. & Tseng, P.

1993

burke4 A non-interior predictor-corrector algorithm for the monotone linear complementarity problem

Burke, J.V. & Xu, S.


burke3 The global linear convergence of a non--interior path--following algorithm for linear complementarity problems

Burke, J.V. & Xu, S.


BuTd The ellipsoid method generates dual variables

Burrell, B.P. & Todd, M.J.

Math Oper Res , Vol. 10 , pp. 688-700 , 1985

Busygin03

url

url

url

url



A Simple Clique Camouflaging Against Greedy Maximum Clique Heuristics

Busygin, S.

2002

stas QUALEX 2.0 Release Notes

Busygin, S.

2001

BusyginButenkoPardalos A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere

Busygin, S.; Butenko, S. & Pardalos, P.M.


ButenkoCheng03 On the construction of virtual backbone for ad hoc wireless networks

Butenko, S.; Cheng, X.; Du, D. & Pardalos, P.

pp. 43-54 , 2003

Butenko02 On the Construction of Virtual Backbone for Ad Hoc Wireless Network

Butenko, S.; Cheng, X.; Du, D. & Pardalos, P.

pp. 43-54 , 2002

ButenkoCheng04 A new heuristic for the minimum connected dominating set problem on ad hoc wireless networks

Butenko, S.; Cheng, X.; Oliveira, C. & Pardalos, P.

pp. 61-73 , 2004

Butenko03 A New Heuristic for the Minimum Connected Dominating Set Problem on Ad Hoc Wireless Networks



Butenko, S.; Cheng, X.; Oliveira, C. & Pardalos, P.

pp. 61-73 , 2003

ButenkoCommanderPardalos04complexity On the complexity of broadcast scheduling problem

Butenko, S.; Commander, C.W. & Pardalos, P.M.

Submitted to IEEE Transactions on Wireless Communications , 2004

ButenkoCommanderPardalos04grasp A Greedy Randomized Adaptive Search Procedure for the Broadcast Scheduling Problem

Butenko, S.; Commander, C.W. & Pardalos, P.M.

Submitted to Journal of Combinatorial Optimization , 2004

ButenkoFestaPardalos On the chromatic number of graphs

Butenko, S.; Festa, P. & Pardalos, P.M.

J. Optim. Theory Appl. , Vol. 109 , pp. 51-67 , 2001

bpsss2 Estimating the size of correcting codes using extremal graph problems

Butenko, S.; Pardalos, P.M.; Sergienko, I.V.; Shylo, V. & Stetsyuk, P.

2006

bpsss Finding Maximum Independent Sets in Graphs Arising from Coding Theory

Butenko, S.; Pardalos, P.M.; Sergienko, I.V.; Shylo, V. & Stetsyuk, P.

Proceedings of the Seventeenth ACM Symposium on Applied Computing , pp. 542-546 , 2002

butnariu1 Total convexity for the powers of the norm in uniformly convex Banach spaces

Butnariu, D.; Iusem, A. & Resmerita, E.

url



1999

butnariu3 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

Butnariu, D. & Resmerita, E.

2001

byrd1 A Trust Region Method Based on Interior Point Techniques for Nonlinear Programming

Byrd, R.; Gilbert, J. & Nocedal, J.


byrd2 An Interior Point Algorithm for Large Scale Nonlinear Programming

Byrd, R.; Hribar, M.B. & Nocedal, J.


byrd3 On the local behavior of an interior point method for Nonlinear Programming

Byrd, R.; Liu, G. & Nocedal, J.

pp. 37-56 , 1998

byrd5 On the Convergence of Newton Iterations to Non-Stationary Points

Byrd, R.; Marazzi, M. & Nocedal, J.

url

url

url

url

url

url



2001

byrd4 Feasible Interior Methods Using Slacks for Nonlinear Optimization

Byrd, R.; Nocedal, J. & Waltz, R.

2000

byrne1 Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback-Leibler distance minimization

Byrne, C. & Censor, Y.

1999

BuerErsoy05 Ad hoc quality of service multicast routing

Bür, K. & Ersoy, C.

Computer Communications , pp. 1-13 , 2005

MLM2004 Stronger $K$-Tree relaxations for the vehicle routing problem

C.~Martinhon; A.~Lucena & N.~Maculan


Ca85 Um Sistema para o Planejamento de Redes Telefônicas Urbanas

Cabral, R.H.B.

DCC/UFMG , 1985

measure Measurement and analysis of IP network usage and behavior

Caceres, R. & others

IEEE Communication Magazine , 2000

Cachon01

url

url



Supply chain coordination with contracts

Cachon, G.

2001

cadenillas1 Consumption-investment problems with transaction costs: Survey and open problems

Cadenillas, A.

Mathematical Methods of Operations Research , Vol. 51 , pp. 43-68 , 2000

cadenillas2 Optimal trading of a security when there are taxes and transaction costs

Cadenillas, A. & Pliska, S.R.

Finance and Stochastics , Vol. 3 , pp. 137-165 , 1999

CafStu98 Overview of Radiolocation in CDMA Cellular Systems

Caffrey, J. & Stuber, G.

IEEE Communication Magazine , Vol. 36 , pp. 38-45 , 1998

Cagalj02 Minimum-Energy Broadcast in All-Wireless Networks: NP-Completeness and Distribution Issues

Cagalj, M.; Hubaux, J. & Enz, C.

Proceedings of the international conference on Mobile computing and networking , pp. 172-182 , 2002

Cai05 Monte Carlo approximation in incomplete information sequential auction games

Cai, G. & Wurman, P.

Decision Support Systems , Vol. 39 , pp. 153-168 , 2005

des89-5 The minimum augmentation of any graph to a



(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.


CalGKW97 Genetic approach to radio network optimization for mobile systems

Calégari, 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.


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



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.


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.


CamSav03a Incentive Schemes for Consumer Direct Delivery

Campbell, A. & Savelsbergh, M.

2003

CamSav02a Decision Support for Consumer Direct Grocery Initiatives

Campbell, A. & Savelsbergh, M.



2002

campbell1 Kernel Methods: A Survey of Current Techniques

Campbell, C.

2000

Campell Integer programming formulations of discrete hub location problems

Campbell, J.


CaMa94 Algoritmos e Heuri sticas Desenvolvimento e Avaliacão de Performance

Campello, R. & Maculan, N.

EDUFF , 1994

Cancela95 A recursive variance-reduction algorithm for estimating communication-network reliability

Cancela, H. & Khadiri, M.E.


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

url



CaHo Large-scaled 0/1 linear programming on distributed workstations

Cannon, T.L. & Hoffman, K.L.


CanCalCabVeg02a Procedimientos constructivos adaptivos (GRASP) para el problema

del empaquetado bidimensional

Cano, J.; Cabrera, R. & Vega, J.

Revista Iberoamericana de Inteligencia Artificial , Vol. 15 , pp. 26-33 , 2002

CanCorHerSan02a A GRASP Algorithm for clustering

Cano, J.; Cordón, O.; Herrera, F. & Sánchez, L.

Advances in Artificial Intelligence - IBERAMIA 2002, 8th Ibero-American Conference on AI, Seville, Spain, November 12-15, 2002, Proceedings , Vol. 2527 , pp. 214-223 , 2002

CanCorHerSan02b A greedy randomized adaptive search procedure applied to the clustering problem as an initialization process using K-means as a local search procedure

Cano, J.; Cordón, O.; Herrera, F. & Sánchez, L.

Journal of Intelligent and Fuzzy Systems , Vol. 12 , pp. 235-242 , 2002

Ca68 A tight upper bound on the rate of convergence of the Frank-Wolfe algorithm

Canon, M. & Cullum, C.

SIAM J. Control , Vol. 6 , pp. 509-516 , 1968

Ca74 Optimal routing in a packet-switched computer network

Cantor, D. & Gerla, M.

pdf url



IEEE Transactions on Computers , Vol. C-23 , pp. 1062-1069 , 1974

CaGe74 Optimal routing in a packet-switched computer network

Cantor, D. & Gerla, M.

IEEE Transactions on Computers , Vol. c-23 , pp. 1062-1069 , 1974

CanutoResendeRibeiro02 Local Search with Perturbations for the Prize-Collecting Steiner Tree Problem in Graphs

Canuto, S.; Resende, M. & Ribeiro, C.

Networks , Vol. 38 , pp. 50-58 , 2002

CanResRib01a Local search with perturbations for the prize-collecting Steiner tree problem in graphs

Canuto, S.; Resende, M. & Ribeiro, C.

Networks , Vol. 38 , pp. 50-58 , 2001

cao:00 Time-Varying Network Tomography

Cao, J.; Davis, D.; Wiel, S.V. & Yu, B.

Journal of the American Statistical Association , 2000

41xia Waveband switching in optical networks

Cao, X.; Anand, V. & Qiao, C.

IEEE Communication Magazine , Vol. 41 , pp. 105 - 112 , 2003

21xay A study of waveband switching with multilayer multigranular optical cross-connects

Cao, X.; Anand, V.; Xiong, Y. & Qiao, C.




Cao:Anand:Yizhi:Chunming A study of waveband switching with multilayer multigranular optical cross-connects

Cao, X.; Anand, V.; Yizhi, X. & Chunming, Q.


03cav Performance evaluation of wavelength band switching in multifiber all-optical 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



$0,12$-Chvátal-Gomory cuts

Caprara, A. & Fischetti, M.


caprara5 On the separation of maximally violated mod-$k$ cuts

Caprara, A.; Fischetti, M. & Letchford, A.N.


caprara7 Modeling and solving the train timetabling problem

Caprara, A.; Fischetti, M. & Toth, P.


caprara6 On the separation of split cuts and related inequalities

Caprara, A. & Letchford, A.N.


caprara4 Exact solution of the quadratic knapsack problem

Caprara, A.; Pisinger, D. & Toth, P.


caprara3 Modeling and solving the crew rostering problem

Caprara, A.; Toth, P.; Fischetti, M. & Vigo, D.


caroe2 Dual decomposition in stochastic integer programming

Car, C.C. & Schultz, R.




caroe1 L-shaped decomposition of two-stage stochastic programs with integer recourse

Car, C.C. & Tind, J.


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 difference-frequency-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.


des89-3 Computer-Aided Design Procedure for

Survivable Fiber Optic Networks



Cardwell, R.; Monma, C. & Wu, T.


carey1 Bounds on expected performance with links subject to failure

Carey, M. & Hendrickson, C.

Networks , Vol. 14 , pp. 439-456 , 1984

CC97 Building shared trees using a one-to-many joining mechanism

Carlberg, K. & Crowcroft, J.

ACM Computer Communication Review , Vol. 27 , pp. 5-11 , 1997

rel93-1 Evaluation of Telecommunication Network Performance

Carlier, J.; Li, Y. & Lutton, J.

1993

carlier94 ``Méthode de Décomposition pour l'Evaluation de la Fiabilité des Réseaux''

Carlier, J. & Lucet, C.

Thèse de doctorat , 1994

rel92-1 A decomposition algorithm for network reliability evaluation

Carlier, J. & Lucet, C.

1992

CaAu01 Optimized design of LMDS cells: site location, equipment sizing

and users homing

Carlson, C. & Authie, G.



Proceeding 3rd IEEE International Conference on Mobile and

Wireless Communications Networks (MWCN'2001)

, pp. 111-118 , 2001

CaroTuza91 Improved lower bounds on $k$-independence

Caro, Y. & Tuza, Z.

J. Graph Theory , Vol. 15 , pp. 99-107 , 1991

Caro00 Connected Domination and Spanning Trees with Many Leaves

Caro, Y.; West, D.B. & Yuster, R.

SIAM J. Discret. Math. , Vol. 13 , pp. 202-211 , 2000

CHKNW An empirical evaluation of the KORBX algorithms for military airlift operations

Carolan, W.J.; Hill, J.E.; Kennington, J.L.; Niemi, S.C. & Wichmann, S.J.


caron1 The assignment problem with seniority and job priority constraints

Caron, G.; Hansen, P. & Jaumard, B.


rcaron1 Analytic Centers and Repelling Inequalities

Caron, R.J.; Greenberg, H.J. & Holder, A.G.

1999

CaDeTo95b Algorithm 750: CDT: A subroutine for the exact solution of large-scale, asymmetric traveling salesman problems

Carpaneto, G.; Dell'Amico, M. & Toth, P.

url



ACM. Transactions on Mathematical Software , Vol. 21 , pp. 410-415 , 1995

CFT New lower bounds for the symmetric travelling salesman problem

Carpaneto, G.; Fischetti, M. & Toth, P.


97ccs Demand Routing and Slotting on Ring Networks

Carpenter, T.; Cosares, S. & Saniee, I.

1997

CarpenterEigerSeymourShallcross2001 Node placement and sizing for copper broadband access networks

Carpenter, T.; Eiger, M.; Seymour, P. & Shallcross, D.


CarpenterEigerSeymourShallcross1996 Automated design of fiber-to-the-curb and hybrid fiber-coax access networks

Carpenter, T.; Eiger, M.; Seymour, P. & Shallcross, D.


carpenter1 Separable quadratic programming via a primal-dual interior point method and its use in a sequential procedure

Carpenter, T.J.; Lustig, I.J.; Mulvey, J.M. & Shanno, D.F.


carr1 Separating clique trees and bipartition inequalities having a fixed number of handles and teeth in polynomial time

Carr, R.




CaPa90.1 An exact algorithm for the maximum clique problem

Carraghan, R. & Pardalos, P.


carraway1 Generalized dynamic programming for stochastic combinatorial optimization

Carraway, R.L.; Morin, T.L. & Moskowitz, H.


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.


carter1 The indefinite zero-one quadratic program

Carter, M.W.


CasTho03a



GRASPing the examination scheduling problem

Casey, S. & Thompson, J.


CasSte99 A surrogate constraint tabu thresholding implementation for the frequency assignment problem

Castelino, D. & Stephens, N.


castillo1 Chaotic behavior of the affine scaling algorithm for linear programming

Castillo, I. & Barnes, E.R.


cas03 Solving difficult multicommodity problems with a specialized interior-point algorithm

Castro, J.


castro3 Quadratic interior-point methods in statistical disclosure control

Castro, J.

2003

castro1 A specialized interior point algorithm for multicommodity flows

Castro, J.


castro4 Solving difficult multicommodity problems through a specialized interior-point algorithm

url

url

url



Castro, J.

2000

castro2 A parallel implementation of an interior-point algorithm for multicommodity network flows

Castro, J. & Frangioni, A.

Vector and Parallel Processing VECPAR 2000 , Vol. 1981 , pp. 301-315 , 2001

FioMal03b Parallel randomized heuristics for the set covering problem

Catalano, M.F. & Malucelli, F.

2000

Mat03tr Power Control, Capacity, and Duality of Up- and Downlink in Cellular CDMA Systems

Catrein, D.; Imhof, L. & Mathar, R.


CvSy Some computational experience and a modification of the Karmarkar algorithm

Cavalier, T.M. & Soyster, A.L.

1985

CaSh86 Network location problems with continuous link

demands: p-medians on a chain and 2-medians on a tree

Cavalier, T. & Sherali, H.


caven04 Minimizing the number of wavelength conversions in WDM networks with

url

pdf url



hybrid optical cross-connects

Cavendish, D.; Kolarov, A. & Sengupta, B.

Proceedings of the Seventh INFORMS Telecommunications Conference , 2004

censor4 Mathematical optimization for the inverse problem of intensity modulated radiation therapy

Censor, Y.

pp. 25-49 , 2003

censor3 Block-Iterative Algorithms with Diagonally Scaled Oblique Projections for the Linear Feasibility Problem

Censor, Y. & Elfving, T.

SIAM Journal on Matrix Analysis and Applications , Vol. 24 , pp. 40-58 , 2002

censor2 Averaging strings of sequential iterations for convex feasibility problems

Censor, Y.; Elfving, T. & Herman, G.T.

pp. 101-114 , 2001

censor1 Component Averaging: An Efficient Iterative Parallel Algorithm for Large and Sparse Unstructured Problems

Censor, Y.; Gordon, D. & Gordon, R.

1998

ceria0 Lift-and-project methods for mixed 0--1 programs

S. Ceria

Graduate School of Industrial Administration, Carnegie Mellon University , 1993

ceria2 Cutting plane algorithms for integer programs with general integer variables

url

url

url



Ceria, S.; Cordier, C.; Marchand, H. & Wolsey, L.A.


ceria3 Combining and strengthening Gomory cuts

Ceria, S.; Cornuéjols, G. & Dawande, M.

Lecture Notes in Computer Science , Vol. 920 , 1995

ceria1 A Lagrangian-based heuristic for large-scale set covering problems

Ceria, S.; Nobili, P. & Sassano, A.


CerNS97 Set covering problem

Ceria, S.; Nobili, P. & Sassano, A.

pp. 415-428 , 1997

ceria4 Solving integer and disjuntice programs by lift-and-project

Ceria, S. & Pataki, G.

Proceedings of the Sixth IPCO Conference , 1998

pataki8 Solving Integer and Disjunctive Programs by Lift-and-Project

Ceria, S. & Pataki, G.

Proceedings of the Sixth IPCO Conference , 1998

ceria5 Convex programming for disjunctive convex optimization

Ceria, S. & Soares, J.


CerFesRai03a



Shortest path auction algorithm without contractions

using virtual source concept

Cerulli, R.; Festa, P. & Raiconi, G.


CerFesRai01a Graph collapsing in shortest path Auction algorithms

Cerulli, R.; Festa, P. & Raiconi, G.


cdg Experiments in topic distillation

Chakrabarti, S.; Dom, B.; Gibson, D.; Kumar, S.R.; Raghavan, P.; Rajagopalan, S. & Tomkins, A.

Proceedings of ACM SIGIR Workshop on Hypertext Information Retrieval on the Web , 1998

ChakrabortyZabirChayabejaraChakraborty04 A Distributed Routing Method for Dynamic Multicasting

Chakraborty, D.; Zabir, S.; Chayabejara, A. & Chakraborty, G.


Chalmet:Gelders Lagrangian Relaxations for a Generalized Assignment-Type Problem

Chalmet, L. & Gelders, L.

Proceedings Second European Congress on Operations Research , pp. 789-810 , 1976

ChaJKPSUW97 Radio Network Optimization with Maximum Independent Set Search

Chamaret, B.; Josselin, S.; Kuonen, P.; Pizarroso

, M.; Salas-Manzanedo, B.; Ubeda, S. & Wagner, D.




Chamberland04 An efficient heuristic for the expansion problem of cellular wireless networks

Chamberland, S.


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. 570-574 , 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.


vwcchan1 Multiple layers of CMOS integrated circuits using recrystallized silicon film

Chan, V.W.C.; Chan, P.C.H. & Chan, M.

IEEE Electron Device Letters , Vol. 22 , pp. 77-79 , 2001

16cha Architectures and technologies for high-speed optical data networks

Chan, V.; Hall, K.; Modiano, E. & Rauschenbach, K.

IEEE Journal of Lightwave Technology , Vol. 16 , pp. 2146 - 2168 , 1998

Chandrashekar05

url



Auction based mechanisms for electronic procurement

Chandrashekar, T.S.; Narahari, Y.; Rosa, C.; Kulkarni, D. & Tew, J.D.

2005

ChaMel97 Adaptive and Global Routing for Multiplexed Optical Communication on Mesh and Torus Networks

Chang, C. & Melhem, R.

Proceedings of Workshop On Optics And Computer Science , pp. ??-?? , 1997

Chang84 The k-domination and k-stability problems on sun-free chordal graphs

Chang, G.J. & Nemhauser, G.L.

SIAM Journal on Algebraic and Discrete Methods , Vol. 5 , pp. 332-345 , 1984

Cha97 Energy conserving routing in wireless ad-hoc networks

Chang, J. & Tassiulas, L.

1997

ChCh00 A Heuristic Method for Self-Healing Ring Design in a Single-Homing Cluster

Chang, M. & Chang, S.


schang1 The steepest descent gravitational method for linear programming

Chang, S.Y. & Murty, K.G.


Chang94a An efficient approach to real-time traffic routing for telephone network management



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.


ChGa93 Telecommunications network topological design and capacity expansion: Formulations and algorithms

Chang, S. & Gavish, B.


tchang1 Heuristics for cardinality constrained portfolio optimisation

Chang, T.; Meade, N.; Beasley, J.E. & Sharaiha, Y.M.


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.




ChaoHsu Rectilinear Steiner tree construction by local and global refinement

Chao, T. & Hsu, Y.

Proceedings of the International Conference on Computer-Aided Design , pp. 432-435 , 1990

ChaKimPar03a GRASP with a new local search scheme for

vehicle routing problems with time windows

Chaovalitwongse, W.; Kim, D. & Pardalos, P.

J. of Combinatorial Optimization , Vol. 7 , pp. 179-207 , 2003

CharLis02 Minimum cost multicommodity flows

Chardaire, P. & A.Lisser

pp. 404-422 , 2002

CharLis03 Simplex and interior point specialization algorithms for solving non-oriented multicommodity flow problems



CharLis01 Non-oriented multicommodity flow problems


pp. 92-97 , 2001

chal02 Multicommodity Flow Problems

Chardaire, P. & Lisser, A.

pp. 92-97 , 2002

pdf url



chalis02 Simplex and interior-point specialized algorithms for solving non-oriented multicommodity flow problems



chardaire1 Simplex and interior point specialized algorithms for solving nonoriented multicommodity flow problems



Chardaire A primal simplex specialization for solving non-oriented multicommodity flow problems


Investigación 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.


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.




CharikarChekuriCheungDaiGoelGuhaLi99 Approximation Algorithms for Directed Steiner Problems

Charikar, M.; Chekuri, C.; Cheung, T.; Dai, Z.; Goel, A.; Guha, S. & Li, M.


Charikaretal04 Resource Optimization in QoS Multicast Routing of Real-Time Multimedia

Charikar, M.; Naor, J. & Schieber, B.


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.


ChartrandZhang02 The Steiner number of a graph

Chartrand, G. & Zhang, P.



Discrete Mathematics , Vol. 242 , pp. 41-54 , 2002

chase1 Individual differences versus social dynamics in the formation of animal dominance hierarchies

Chase, I.D.; Tovey, C.; Spangler-Martin, D. & Manfredonia, M.

Proceedings of the National Academy of Sciences , Vol. 99 , pp. 5744-5749 , 2002

chatterjee02wca WCA: A weighted clustering algorithm for mobile ad hoc networks

Chatterjee, M.; Das, S. & Turgut, D.

Journal of Cluster Computing , Vol. 5 , pp. 193-204 , 2002

ChattopadhyayMorganRaghuram1989 An innovative technique for backbone network design

Chattopadhyay, N.; Morgan, T. & Raghuram, A.

IEEE Transactions on Systems, Man and Cybernetics , Vol. 19 , pp. 1122-1132 , 1989

samit2 Analyzing and Exploiting the Structure of the Constraints in the ILP Approach to the Scheduling Problem

Chaudhuri, S.; Walker, R.A. & Mitchell, J.E.

IEEE Transactions on VLSI , Vol. 2 , pp. 456-471 , 1994

samit The structure of assignment, precedence, and resource constraints in the ILP approach to the scheduling problem

Chaudhuri, S.; Walker, R.A. & Mitchell, J.E.

Proceedings: 1993 IEEE International Conference on Computer Design , 1993

che96 A New Model for Optimal Routing and Wavelength Assignment in Wavelength Division Multiplexed Optical Networks

Chen, C. & Banerjee, S.

INFOCOM'96, Proceedings IEEE , Vol. 1 , pp. 164-171 , 1996



ChenEtAl01 Approximations for Steiner trees with minimum number of Steiner points

Chen, D.; Du, D.; Hu, X.; Lin, G.; Wang, L. & Xue, G.


ChenEtAl00 Approximations for Steiner Trees with Minimum Number of Steiner Points

Chen, D.; Du, D.; Hu, X.; Lin, G.; Wang, L. & Xue, G.


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 series–parallel graphs

Chen, G. & Xue, G.


ChenNahrstedt Effective Location-Guided Overlay Multicast in Mobile Ad Hoc Networks



Chen, K. & Nahrstedt, K.

International Journal of Wireless and Mobile Computing , 2006

CheNah02 Effective Location-Guided Tree Construction Algorithms for Small Group Multicast in MANET

Chen, K. & Nahrstedt, K.


ChMo03 Efficient Routing and Wavelength Assignment for Reconfigurable WDM Networks with Wavelength Converters

Chen, L. & Modiano, E.


chen1 FATCOP: A Fault Tolerant Condor-PVM Mixed Integer Program Solver

Chen, Q. & Ferris, M.C.

1999

ChenR02 Efficient auctions for supply chain procurement

Chen, R.R.; Roundy, R.; Zhang, R.Q. & Janakiraman, G.

2002

YCG98 Optimal packing of group multicastings

Chen, S.; Günlük, O. & Yener, B.

Proc. IEEE INFOCOM'98 , pp. 980-987 , 1998

chen:98 An Overview of Quality of Service Routing for Next-Generation High-Speed Networks: Problems and Solutions

Chen, S. & Nahrstedt, K.

url




CN98 An Overview of Quality of Service Routing for Next-Generation High-Speed Networks: Problems and Solutions

Chen, S. & Nahrstedt, K.


ChenD96 Atomic decomposition by basis pursuit

Chen, S.S.; Donoho, D.L. & Saunders, M.A.

1996

ChengEtAl01b Polynomial Time Approximation Scheme for Symmetric Rectilinear Steiner Arborescence Problem

Chen, X.; Dasgupta, B. & Lu, B.


xchen1 Proximal quasi-Newton methods for nondifferentiable convex optimization

Chen, X. & Fukushima, M.


ChengEtAl01a A Polynomial Time Approximation Scheme for the Problem of Interconnecting Highways

Chen, X.; Kim, J. & Lu, B.


tseng25 Analysis of Nonsmooth Symmetric Matrix Functions with Applications to Semidefinite Complementarity Problems

Chen, X.; Luo, H. & Tseng, P.

url



2000

xchen2 Non-interior continuation methods for solving semidefinite complementarity problems

Chen, X. & Tseng, P.

1999

chen03zonal A Zonal Algorithm for Clustering Ad Hoc Networks

Chen, Y.P. & Liestman, A.L.


chen02wcds Approximating minimum size weakly connected dominating sets for clustering mobile ad hoc networks

Chen, Y.P. & Liestman, A.L.

Proceedings of the Third ACM International Symposium on Mobile Ad Hoc

Networking and Computing

, pp. 165-172 , 2002

ChenLiestmanLiu2004 Clustering Algorithms for Ad Hoc Wireless Networks

Chen, Y.P.; Liestman, A.L. & Liu, J.

Vol. 2 , 2005

Chen96 A cut-based method for terminal-pair reliability

Chen, Y. & Yuang, M.


ChenEtAL2003 On the Full and Bottleneck Full Steiner Tree Problems

url



Chen, Y.; Lu, C. & Tang, C.

pp. 122-129 , 2003

Chen02 Approximating Minimum Size Weakly-Connected Dominating Sets for Clustering Mobile Ad Hoc Networks

Chen, Y. & Liestman, A.

Proceedings of the ACM international symposium on Mobile ad hoc networking $&$ computing , pp. 165-172 , 2002

chen00websail WebSail: From On-Line Learning to Web Search

Chen, Z.; Meng, X.; Zhu, B. & Fowler, R.

Web Information Systems Engineering , pp. 206-213 , 2000

zchen1 Solving parallel machine scheduling problems by column generation

Chen, Z. & Powell, W.B.


ChePow97a A Note on Bertsekas's Small-Label-First Strategy

Chen, Z. & Powell, W.

Networks , Vol. 29 , pp. 111-116 , 1997

cheney1 Newton's method for convex programming

Cheney, E.W. & Goldstein, A.A.


cheneym1 Electrical impedance tomography

Cheney, M.; Isaacson, D. & Newell, J.C.




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.


echeng Wheel inequalities for stable set polytopes

Cheng, E. & Cunningham, W.H.


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



polygon

Cheng, S.


Cheng98 Topological optimization of a reliable communication network

Cheng, S.


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


Cheng210 A Primal-Dual Interior Point Method for Linear Programming Based on a Weighted Barrier Function

Cheng, Z. & Mitchell, J.E.


Cheng208 An Alternative Derivation of the Projective Interior Point Method for



Linear Programming Through the Least Squares Approach


Optimization , Vol. 31 , pp. 95-106 , 1994

Cheng208old An Alternative Derivation of the Projective Interior Point Method for Linear Programming Through the Least Squares Approach


1993

CheriyanSalavatipour04 Hardness and Approximation Results for Packing Steiner Trees

Cheriyan, J. & Salavatipour, M.

pp. 180-191 , 2004

CMoSh1 Shortest path algorithms: Theory and experimental evaluation

Cherkassky, B.V.; Goldberg, A.V. & Radzik, T.


CheGol99a Negative-Cycle Detection Algorithms

Cherkassky, B. & Goldberg, A.


CheGolRad96a Shortest Path Algorithms: Theory and

Experimental Evaluation

Cherkassky, B.; Goldberg, A. & Radzik, T.


CheGolSil99a Buckets, Heaps, Lists, and Monotone Priority Queues



Cherkassky, B.; Goldberg, A. & Silverstein, C.


cb Internet Mapping Project

Cheswick, W. & Burch, H.

CheBM94 Network Planning for Third-Generation Mobile Radio Systems

Cheung, J.; Beach, M. & McGeehan, J.


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


International Journal of Circuit Theory and Applications , Vol. 19 , pp. 551-563 , 1991

ChiangSarrafzadehWongMinmax Global routing based on Steiner min-max trees


IEEE Transactions on Computer-Aided Design , Vol. 9 , pp. 1318-1325 , 1990



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.


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



ChMaRe94 Proximal Decomposition for Multicommodity Flow Problems with Convex Costs

Chifflet, J.; Mahey, P. & Reynier, V.


21chu Cost effectiveness of joint multilayer protection in packet-over-optical networks

Chigan, C.; Atkinson, G. & Nagarajan, R.


chinneck1 Locating minimal infeasible constraint sets in linear programs

Chinneck, J.W. & Dravniecks, E.W.


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



01mod Reducing electronic multiplexing costs in unidirectional SONET/WDM ring networks via efficient traffic grooming


The Bridge to Global Integration. , Vol. 1 , pp. 322 - 327 , 1998

Chlamtac03



Mobile ad hoc networking: imperatives and challenges

Chlamtac, I.; Conti, M. & Liu, J.J.

Ad Hoc Networks , Vol. 1 , pp. 13-64 , 2003

ChlFarZha94a Optimizing the system of virtual paths

Chlamtac, I.; Faragó, A. & Zhang, T.

IEEE/ACM Trans. on Networking , Vol. 2 , pp. 581-587 , 1994

chl93 Lightnets: Topologies for High-Speed Optical Networks

Chlamtac, I.; Ganz, A. & Karmi, G.

IEEE Journal of Lightware Technology , Vol. 11 , pp. 951-961 , 1993

ChlGanKar92 Lightpath communications: An approach to high-bandwidth optical WAN's

Chlamtac, I.; Ganz, A. & Karmi, G.


Chlamtac85broadcast On broadcasting in radio networks - problem analysis and protocol design

Chlamtac, I. & Kutten, S.


Chlamtac85spatial A spatial reuse TDMA/FDMA for mobile multi-hop radio networks

Chlamtac, I. & Kutten, S.

Proceedings of the IEEE INFOCOM , 1985

Chlamtac85 A link allocation protocol for mobile multihop networks

Chlamtac, I. & Lerner, A.

Proceedings of the IEEE Globecom , 1985



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.


ChPaRa83 On the Uncapacitated Plant Location Problem II: Facets and Lifting Theorems

Cho, D.C.; Padberg, M. & Rao, M.R.


Cho2002 Parallel Crawlers

Cho, J. & Garcia-Molina, H.


Cho2000a Synchronizing a database to improve freshness


Proc. 2000 ACM SIGMOD Int. Conf. on Management of data (SIGMOD '00) , pp. 117-128 , 2000

cho2000b The Evolution of the Web and Implications for an Incremental Crawler


Proceedings of the Twenty-sixth International Conference on Very Large Databases , 2000

doi



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

Choi, C. & Ye, Y.

2000

cchoi1 Application of semidefinite programming to circuit partitioning

Choi, C.C. & Ye, Y.

1999

choi2 Solving multicommodity network flow problems by an interior point method

Choi, I.C. & Goldfarb, D.

pp. 58-69 , 1990

url

url



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.


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.


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.


chopra4



The graph partitioning polytope on series-parallel and 4-wheel free graphs

Chopra, S.


chopra5 The $k$-edge-connected spanning subgraph polyhedron

Chopra, S.


des94-8 The ( k )-edge-connected spanning subgraph polyhedron

Chopra, S.


chopra2 Polyhedra of the equivalent subgraph problem and some edge connectivity problems

Chopra, S.


Ch89 On the spanning tree polyhedron

Chopra, S.


chogiltri96 Algorithms and extended formulations for one and two facility network design

Chopra, S.; Gilboa, I. & Trilochan-Sastry, S.

Proceedings 5th IPCO Conf., Lectures Notes in Computer Science , pp. 44-57 , 1996

Chopra1 Solving the Steiner Tree Problem on a Graph using Branch and Cut

Chopra, S.; Gorres, E.R. & Rao, M.R.




Chopraetal Solving the Steiner tree problem on a graph using branch and cut

Chopra, S.; Gorres, E. & Rao, M.


Chopra01 Supply chain management: Strategy, planning, and operation

Chopra, S. & Meindl, P.


Chopra00 Which e-business is right for your supply chain?

Chopra, S. & Mieghem, J.V.

Supply Chain Management Review , pp. 32-40 , 2000

chopra6 Facets of the $k$-partition polytope

Chopra, S. & Rao, M.R.


ChopraRao1 The Steiner tree problem 1: Formulations, compositions, and extension of facets



ChopraRao2 The Steiner tree problem 2: Properties and classes of facets



chopra3



The partition problem



Chopra94a The Steiner Tree Problem I: Formulations, Compositions and Extension of Facets

Chopra, S. & Rao, M.

Mathematical Programming: Series A , Vol. 64 , pp. 209-229 , 1994

Chopra94b The Steiner Tree Problem II: Properties and Classes of Facets

Chopra, S. & Rao, M.

Mathematical Programming: Series A , Vol. 64 , pp. 231-246 , 1994

vchopra1 The effect of errors in means, variances, and covariances on optimal portfolio choice

Chopra, V.K. & Ziemba, W.T.

pp. 53-61 , 1998

Chou Traffic engineering for MPLS-based virtual private networks

Chou, C.


Ch78 An algorithm for optimally locating network access facilities

Chou, W.; Ferrante, F. & Gerke, L.

Proceedings of ICC '78 , pp. 24.5.1-24.5.8 , 1978

des70-1 Survivable communication networks and the terminal

capacity matrix



Chou, W. & Frank, H.

IEEE Transactions on Circuit Theory , Vol. CT-17 , pp. 192-197 , 1970

Choukhmane Une heuristique pour le probleme de l'arbre de Steiner

Choukhmane, E.A.

R.A.I.R.O. Recherche Operationelle , Vol. 12 , pp. 207-212 , 1978

C91 On multicast path finding algorithms

Chow, C.

Proc. IEEE INFOCOMM'91 , pp. 1274-1283 , 1991

chowlin03 The Ring Grooming Problem

Chow, T.Y. & Lin, P.J.

Networks , Vol. 44 , pp. 194-202 , 2004

christof2 A branch-and-cut approach to physical mapping with end-probes

Christof, T.; Jünger, M.; Kececioglu, J.; Mutzel, P. & Reinelt, G.

Proceedings 1st International Conference on Computational Molecular Biology (RECOMB-1), Santa Fe, New Mexico , 1997

christof8 A branch-and-cut approach to physical mapping of chromosomes by unique end-probes

Christof, T.; Jünger, M.; Kececioglu, J.; Mutzel, P. & Reinelt, G.

Journal of Computational Biology , Vol. 4 , pp. 433-447 , 1997

christof4 A complete description of the traveling salesman polytope on 8 nodes

Christof, T.; Jünger, M. & Reinelt, G.


url

url



christof9 Computing physical maps of chromosomes with nonoverlapping probes by branch-and-cut

Christof, T. & Kececioglu, J.

Proceedings 3rd International Conference on Computational Molecular Biology (RECOMB-3), Santa Fe, New Mexico , 1999

christof7 Algorithmic aspects of using small instance relaxations in parallel branch-and-cut

Christof, T. & Reinelt, G.

1998

christof3 Efficient parallel facet enumeration for 0/1-polytopes


1997

christof5 Low-dimensional linear ordering polytopes


1997

christof6 Combinatorial Optimization and Small Polytopes


Top (Spanish Statistical and Operations Research Society) , Vol. 4 , pp. 1-64 , 1996

christof1 Parallel Cutting Plane Generation for the TSP


pp. 163-169 , 1995

Chr1

url

url

url

url

url



Worst-Case analysis of a new heuristic for the traveling salesman problem

Christofides, N.

1976

tsp76-1 Worst-Case Analysis of a New Heuristic for the

Traveling Salesman Problem

Christofides, N.

1976

ChBe83 Extensions to a Lagrangean Relaxation Approach for the Capacitated Warehouse Location Problem

Christofides, N. & Beasley, J.


ChBe82 A Tree Search Algorithm For $P$-Median Problem

Christofides, N. & Beasley, J.


des81-1 Network synthesis with connectivity constraints ---

a survey

Christofides, N. & Whitlock, C.

Operational Research '81 , pp. 705-723 , 1981

Chr02a Métodos de reincio aplicados ao seqüenciamento

em uma máquina com tempos de preparacão e data

de entrega



Christofoletti, L.M.

Departamento de Engenaria de Sistemas,

Universidade Estadual de Campinas

, 2002

ChrArm01a Estratégias de reincio de busca local baseadas em memória para programação de tarefas em uma máquina

Christofoletti, L. & Armentano, V.

Proceedings of the XXXIII Brazilan Symposium on Operations Research , pp. 1381-1389 , 2001

ChrLar91 An optimal on-line algorithm for $K$-servers on trees

Chrobak, M. & Larmore, L.


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.


cbchua2 A new notion of weighted centers for semidefinite programming

Chua, C.B.

2004

cbchua1 A primal-dual second order cone approximations algorithm for

url

url



symmetric cone programming

Chua, C.B.

2003

cbchua3 Relating Homogeneous Cones and Positive Definite Cones via $T$-algebras

Chua, C.B.


chua1 An Analytic Center Cutting Plane Method With Deep Cuts For Semidefinite Feasibility Problems

Chua, S.K.; Toh, K.C. & Zhao, G.Y.

2002

chudak1 A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs

Chudak, F.A.; Goemans, M.X.; Hochbaum, D.S. & Williamson, D.P.


chudak2 A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine

Chudak, F.A. & Hochbaum, D.S.


ChudakEtAl04 Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation

Chudak, F.; Roughgarden, T. & Williamson, D.


chudnovsky1

url

url



Progress on perfect graphs

Chudnovsky, M.; Robertson, N.; Seymour, P.D. & Thomas, R.


cl The diameter of random sparse graphs

Chung, F. & Lu, L.

Advances in Applied Math. , Vol. 26 , pp. 257-279 , 2001

ChungGardnerGraham Steiner trees on a checkerboard

Chung, F.R.K.; Gardner, M. & Graham, R.L.

Mathematics Magazine , Vol. 62 , pp. 83-96 , 1989

ChungGraham Steiner trees for ladders

Chung, F.R.K. & Graham, R.L.


ChungHwang The largest minimal rectilinear Steiner trees for a set of~$n$ points enclosed in a rectangle with given perimeter

Chung, F.R.K. & Hwang, F.K.

Networks , Vol. 9 , pp. 19-36 , 1979

CH78a A lower bound for the Steiner tree problem

Chung, F.R.K. & Hwang, F.K.

SIAM Journal on Applied Mathematics , Vol. 34 , pp. 27-36 , 1978

chu03 Wavelength Assignment Optimization in SDH over WDM Rings

Chung, J.; Lee, H. & Han, C.

International Journal of Management Science , Vol. 9 , pp. 12-27 , 2003



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

Chvátal, V.

W.H. Freeman and Company, Oxford, England , 1983

chvatal2 Edmonds polytopes and a hierarchy of combinatorial problems

Chvátal, V.


Chvatal79 A greedy heuristic for the set-covering problem

Chvatal, V.


Chva83 Linear Programming

Chvátal, V.

W. H. Freeman and Company , 1983

CicioraFarmerLarge1999 Modern cable television technology: Video, voice, and data communications



Ciciora, W.; Farmer, J. & Large, D.

Morgan Kaufmann , 1999

Cidon98 Propagation and Leader Election in a Multihop Broadcast Environment

Cidon, I. & Mokryn, O.

Proceedings of the International Symposium on Distributed Computing , pp. 104-118 , 1998

CM98 Propagation and leader election in multihop broadcast environment

Cidon, I. & Mokryn, O.

12th International Symposium on Distributed Computing (DISC98) , pp. 104-119 , 1998

Cidon89 Distributed Assignment Algorithms for Multihop Packet Radio Networks

Cidon, I. & Sidi, M.

IEEE Trans. Comput. , Vol. 38 , pp. 1353-1361 , 1989

Cieslik05 Shortest Connectivity

Cieslik, D.

Springer , 2005

CieslikDressHuberMoulton03 Connectivity Calculus

Cieslik, D.; Dress, A.; Huber, K. & Moulton, V.


Cieslik04 The Steiner ratio of high-dimensional Banach–Minkowski spaces

Cieslik, D.

doi




17cin Traffic and $$ grooming

Cinkler, T.

IEEE Network , Vol. 17 , pp. 16 - 21 , 2003

01cin On the future of the optical infrastructure - COST 266 views

Cinkler, T.; Bjornstad, S.; Careglio, D.; Colle, D.; Gauger, C.; Karasek, M.; Kuchar, A.; de Maesschalck, S.; Matera, F.; Mauz, C. & Settembre, M.

Transparent Optical Networks, 2002 , Vol. 1 , pp. 87 - 92 , 2002

Claess2 The Growing Importance of Networks in Finance and Their Effects on Competition

Claessens, S.; Dobos, G.; Klingebiel, D. & Laeven, L.

2003

Claess1 Electronic Finance: Reshaping the Financial Landscape Around the World

Claessens, S.; Glaessner, T. & Klingebeiel, D.

2000

ClarkColbournJohnsonUDG Unit Disk graphs

Clark, B.; Colbourn, C. & Johnson, D.


CCJ90 Unit disk graphs

Clark, B.N.; Colbourn, C.J. & Johnson, D.S.


Clark90



Unit Disk Graphs

Clark, B.; Colbourn, C. & Johnson, D.


clark:88 The Design Philosophy of the DARPA Internet Protocols

Clark, D.D.

Proc. ACM SIGCOMM , pp. 106-114 , 1988

clarke1 Necessary conditions in optimal control: a new approach

Clarke, F.


des96-5 Heuristics for designing minimum cost

survivable telecommunication networks

Clarke, L. & Anandalingam, G.

IEEE Transactions on Systems, Man and Cybernetics , Vol. 26 , pp. 856-862 , 1996

des95-6 A bootstrap heuristic for designing minimum cost

survivable networks

Clarke, L. & Anandalingam, G.


ClausKleitman73 Cost Allocation for a Spanning Tree

Claus, A. & Kleitman, D.

Networks , Vol. 3 , pp. 289-304 , 1973

Claus:Kratzig



Optimal planning of network structures within an exchange area

Claus, A. & Kratzig, S.


Claus83 Une Nouvelle Formulation Du Problème de Steiner sur un graphe

Claus, A. & Maculan, N.

1983

ClMa83 Une Nouvelle Formulation du Probème de Steiner sur un Graphe

Claus, A. & Maculan, N.

1983

clausen1 On the Applicability of Lower Bounds for Solving Rectilinear Quadratic Assignment Problems in Parallel

Clausen, J.; Karisch, S.E.; Perregaard, M. & Rendl, F.


clements1 Treatment Of Inequality Constraints In Power System State Estimation

Clements, K.A.; Davis, P.W. & Frey, K.D.

IEEE Transactions On Power Systems , Vol. 10 , pp. 567-573 , 1995

CMSW An estimate for the condition number of a matrix

Cline, A.K.; Moler, C.B.; Stewart, G.W. & Wilkinson, J.H.

SIAM Journal on Numerical Analysis , Vol. 16 , pp. 368-375 , 1979

ClGr02 Availability analysis or span-restorable mesh networks

Clouqueur, M. & Grover, W.D.




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.


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.


CockayneHewgillImproved



Improved computation of plane Steiner minimal trees

Cockayne, E.J. & Hewgill, D.E.


CockayneHewgill Exact computation of Steiner minimal trees in the plane

Cockayne, E.J. & Hewgill, D.E.


CockayneMelzak68 Steiner's Problem for Set-Terminals

Cockayne, E.J. & Melzak, Z.A.

Quarterly Applied Mathematics , Vol. 26 , pp. 213-218 , 1968

coffin1 Statistical analysis of computational tests of algorithms and heuristics

Coffin, M. & Saltzmann, M.J.


CohKel A Paradox of Congestion on a Queuing Network

Cohen, J.E. & Kelly, F.P.

Journal of Applied Probability , Vol. 27 , pp. 730-734 , 1990

Coh97 Congestion resulting from increased capacity in single-server queueing networks

Cohen, J. & Jeffries, C.


Cohen82 The Single Server Queue

Cohen, J.

North-Holland Publishing Company , 1982



CohoonGanleyChapter Rectilinear interconnections in the presence of obstacles

Cohoon, J.P. & Ganley, J.L.

1996

GanleyCohoonThumbnailJournal Rectilinear Steiner trees on a checkerboard

Cohoon, J.P. & Ganley, J.L.

ACM Transactions on Design Automation of Electronic Systems , Vol. 1 , 1996

CohoonRichardsSalowe An optimal Steiner tree algorithm for a net whose terminals lie on the perimeter of a rectangle

Cohoon, J.P.; Richards, D.S. & Salowe, J.S.


FraBoe02a The greedy algorithm and its application to the

construction of a continuous speech database

Fracois, H. & Boëffard, O.

Proceedings of LREC-2002 , Vol. 5 , pp. 1420-1426 , 2002

Coit96 Penalty guided genetic search for reliability design optimization

Coit, D. & Smith, A.

Computers and Industrial Engineering , Vol. 30 , pp. 895-904 , 1996

Coit96a Reliability optimization of series-parallel systems using a genetic algorithm

Coit, D. & Smith, A.

IEEE Transactions on Reliability , Vol. 45 , pp. 254-60, 266 , 1996

pdf url



Coit96b Adaptive penalty methods for genetic optimization of constrained combinatorial problems

Coit, D.; Smith, A. & Tate, D.


Colbourn87 Combinatorics of network reliability

Colbourn, C.

Oxford , pp. x+160 pp. , 1987

Col1 Large Sparse Numerical Optimization

Coleman, T.F.


coleman6 The Efficient Computation of Structured Gradients using Automatic Differentiation

Coleman, T.F. & Jonsson, G.F.

1997

coleman8 A trust region and affine scaling interior point method for nonconvex minimization with linear inequality constraints

Coleman, T.F. & Li, Y.


coleman7 Combining trust region and affine scaling for linearly constrained nonconvex minimization


1997

coleman3 A reflective Newton method for minimizing a quadratic function subject to

url

url

url



bounds on some of the variables



Coleman1 An interior trust region approach for nonlinear minimization subject to bounds


1993

coleman2 On the convergence of reflective Newton methods for large-scale nonlinear minimization subject to bounds


1992

coleman9 An interior Newton method for quadratic programming

Coleman, T.F. & Liu, J.


coleman4 Structure and Efficient Jacobian Calculation

Coleman, T.F. & Verma, A.

1996

coleman5 Structure and Efficient Hessian Calculation

Coleman, T.F. & Verma, A.

1996

col94 Coherent Numerical and Ordinal Probabilistic Assessments

Coletti, G.

url

url



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.


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. & Cornuéjols, G.


conforti2 A class of logic problems solvable by linear programming

Conforti, M. & Cornuéjols, G.

33rd FOCS , pp. 670-675 , 1992

conforti7 Balanced $0 1$ matrices. Part I: Decomposition

Conforti, M.; Cornuéjols, G.; Kapoor, A. & Vuskovi, K.

Journal of Combinatorial Theory B , pp. ??? , ???

url



conforti8 Balanced $0 1$ matrices. Part II: Algorithm

Conforti, M.; Cornuéjols, G.; Kapoor, A. & Vuskovi, K.

Journal of Combinatorial Theory B , pp. ??? , ???

conforti3 Balanced matrices

Conforti, M.; Cornuéjols, G.; Kapoor, A.; Vuskovi, K. & Rao, M.R.

pp. 1-33 , 1994

conforti6 Decomposition of balanced matrices

Conforti, M.; Cornuéjols, G. & Rao, M.R.

Journal of Combinatorial Theory B , Vol. 77 , pp. 292-406 , 1999

conforti4 The equipartition polytope I: Formulations, dimension and basic facets

Conforti, M.; Rao, M.R. & Sassano, A.


conforti5 The equipartition polytope II: Valid inequalities and facets

Conforti, M.; Rao, M.R. & Sassano, A.


CongLeungZhou Performance-driven interconnect design based on distributed RC delay model

Cong, J.; Leung, K.S. & Zhou, D.


Conitzer-Sandholm-2003 Computational criticisms of the revelation principle

Conitzer, V. & Sandholm, T.

url

url



Proceedings of the AAMAS Workshop on Agent Mediated Electronic Commerce (AMECV) , 2003

conn3 A Primal-Dual Trust-Region Algorithm for Non-convex nonlinear programming

Conn, A.R.; Gould, N.I.M.; Orban, D. & Toint, P.L.


conn4 Trust Region Methods

Conn, A.R.; Gould, N.I.M. & Toint, P.L.

SIAM , 2000

conn2 Discontinuous piecewise linear optimization

Conn, A.R. & Mongeau, M.


conn1 Two-Step Algorithms for Nonlinear Optimization with Structured Applications

Conn, A.R.; Vicente, L.N. & Visweswariah, C.

1998

Conn:Cornuejols A Projection Method for the Uncapacitated Facility Location Problem

Conn, A. & Cornuejols, G.

1987

consigli1 The CALM stochastic programming model for dynamic asset-liability management

Consigli, G. & Dempster, M.A.H.

pp. 464-500 , 1998

url

url



consiglio2 Integrated simulation and optimization models for tracking international fixed income indices

Consiglio, A. & Zenios, S.


consiglio1 Designing portfolios of financial products via integrated simulation and optimization models



consiglio3 A model for designing callable bonds and its solution using tabu search


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.


Co90 Integer programming solution for capacity expansion of the local access



network

Cook, W.

1990

cook3 On the matrix-cut rank of polyhedra

Cook, W. & Dash, S.


cook1 Computing minimum-weight perfect matchings

Cook, W. & Rohe, A.


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



Co64 Heuristic Methods for Location-Allocation Problems

Cooper, L.


coppersmith1 A Polytope for a Product of Real Linear Functions in 0/1 Variables

Coppersmith, D.; Günlük, O.; Lee, J. & Leung, J.

1999

corberan1 A cutting plane algorithm for the general routing problem

Corberán, A.; Letchford, A.N. & Sanchis, J.M.


CorMarSan02a A GRASP heuristic for the mixed Chinese postman problem

Corberán, A.; Mart, R. & Sanchs, J.


CorGosAgr03 Multicast over Wireless Mobile and Ad Hoc Networks: Present and Future Directions

Cordero, C.d.M.; Gossain, H. & Agrawal, D.


cordier1 bc-opt: A branch-and-cut code for mixed integer programs

Cordier, C.; Marchand, H.; Laundy, R. & Wolsey, L.A.


cordone1 On the complexity of graph tree partition problems

url

pdf url



Cordone, R. & Maffioli, F.


cormen:90 Introduction to Algorithms

Cormen, T.H.; Leiserson, C.E. & Rivest, R.L.

MIT Press (McGraw-Hill) , 1990

CLR92 Introduction to Algorithms

Cormen, T.; Leiserson, C. & Rivest, R.

MIT Press , 1992

CorLeiRiv90a Introduction to Algorithms

Cormen, T.; Leiserson, C. & Rivest, R.

MIT Press , 1990

cormican1 Stochastic network interdiction

Cormican, K.; Morton, D. & Wood, R.


Cornuejols:Fisher:Nemhauser Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms

Corneujols, G.; Fisher, M. & Nemhauser, G.


des85-4 The traveling salesman problem on a graph and some related

integer polyhedra

Cornuéjols, G.; Fonlupt, F. & Naddef, D.




cornuejols8 A class of hard small 0--1 programs

Cornuéjols, G. & Dawande, M.


Cornuejols2 Polyhedral study of the capacitated vehicle routing problem

Cornuéjols, G. & Harche, F.


Cornuejols1 On the 0,1 facets of the set covering polytope

Cornuéjols, G. & Sassano, A.


cornuejols3 The packing property

Cornuèjols, G.; Guenin, B. & Margot, F.


cornuejols6 On the rank of mixed 0,1 polyhedra

Cornuèjols, G. & Li, Y.


cornuejols7 A connection between cutting plane theory and the geometry of numbers



cornuejols4 Elementary closures for integer programs





cornuejols5 K-cuts: a variation of Gomory mixed integer cuts from the LP tableau

Cornuèjols, G.; Li, Y. & Vandenbussche, D.


CFN77 Location of bank accounts to optimize float: An analytical study of exact and approximate algorithms

Cornuejols, G.; Fisher, M.L. & Nemhauser, G.L.


CoFiNe77 Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms

Cornuejols, G.; Fisher, M. & Nemhauser, G.


CGOP03 A parallel Implementation of an Asynchronous Team to the Point-to-point Connection Problem

Correa, R.; Gomes, F.; Oliveira, C. & Pardalos, P.


95cos SONET Toolkit: A Decision Support System for Designing Robust and Cost-Effective Fiber-Optic Networks

Cosares, S.; Deutsch, D.; Saniee, I. & Wasem, O.


cosares1 SONET Toolket: A decision support system for designing robust and cost-effective fiber-optic networks



Cosares, S.; Deutsch, D.N.; Saniee, I. & Wasem, O.J.

Interfaces , Vol. 25(1) , pp. 20-40 , 1995

CoDeSaWa95 SONET Toolkit: A Decision Support System for Designing Robust and Cost-Effective Fiber-Optic Networks

Cosares, S.; Deutsch, D.; Saniee, I. & Wasem, O.


Co93 On the use of some known methods for t-colourings of graphs

Costa, D.


costa2 A Linear Matrix Inequalities Approach to Robust Mean-Semivariance Portfolio Optimization

Costa, O.L.V. & Nabholz, R.d.B.

Vol. 74 , pp. 87-105 , 2002

costa1 Robust portfolio selection using linear-matrix inequalities

Costa, O.L.V. & Paiva, A.C.


Co91 Uma Heuri stica para o Problema de Localizacão de Centros de Fios

Costa, R.A.V.

DCC/UFMG , 1991

Costamagna97 Heuristic algorithms for reliable multiplexed network design

Costamagna, E. & Fanni, A.


url

url



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


IEEE Globecom , pp. 2686-2690 , 2002

cou02b Routage optique dans les réseaux WDM multifibres avec conversion partielle


AlgoTel'02 , pp. 17-24 , 2002

Couder02 Lightpath assignment for multifibers WDM networks with wavelength translators


IEEE Global Telecommunications Conference , Vol. 21 , pp. 2693-2697 , 2002

coullard1 The $k$-walk polyhedron

Coullard, C.R.; Gamble, A.B. & Liu, J.

pp. 9-29 , 1994

des91-3

pdf

pdf



The Dominant of the

2-Connected-Steiner-Subgraph Polytope for (W_4)-Free Graphs


des91-2 The 2-connected-Steiner-subgraph polytope for

series-parallel graphs

1991

des93-3 Linear-Time Algorithms for the

2-Connected Steiner Subgraph Problem on Special Classes of Graphs

Networks , Vol. 23 , 1993

cr41 What is Mathematics?

Courant, R. & Robbins, H.

Oxford University Press, New York , 1941

Courcoubetis01 Providing Bandwidth Guarantees Over a Best-effort Network: Call Admission and Pricing

Courcoubetis, C.A.; Dimakis, A. & Reiman, M.I.

Proceedings of IEEE INFOCOM2001 , pp. 459-467 , 2001

Cour Researches into the Mathematical Principles of the Theory of Wealth

Cournot, A.A.

Macmillan , 1838



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.


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.


crainic1 A simplex-based tabu search method for capacitated network design

Crainic, T.G.; Gendreau, M. & Farvolden, J.M.


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



Cooperative parallel tabu search for capacitated network design

Crainic, T. & Gendreau, M.


CrTo98 Parallel metaheuristics

Crainic, T. & M.~Toulouse

pp. 205-251 , 1998

cra94 A Column Generation Approach to Job Grouping for flexible Manufacturing Systems

Crama, Y. & Oerlemans, A.


crama1 Simulated annealing for complex portfolio selection problems

Crama, Y. & Schyns, M.


CraSpi92a Approximation algorithms for three-dimensional assignment problems with triangle inequalities

Crama, Y. & Spieksma, F.


cramer1 Problem formulation for multidisciplinary optimization

Cramer, E.J.; Dennis, J.E.; Frank, P.D.; Lewis, R.M. & Shubin, G.R.


CRAWLEY A Framework for QoS-based Routing in the Internet

Crawley, E.; Nair, R.; Rajagopalan, B. & Sandick, H.



RFC 2386 , August 1998

crawley:98 A Framework for QoS-based Routing in the Internet

Crawley, E.; Nair, R.; Rajagopalan, B. & Sandick, H.

1998

CB04a A Multicast Routing Algorithm Using Multiobjective Optimization.

Crichigno, J. & Barán, B.

Telecommunications and networking: (ICT 2004) , Vol. 3124 , pp. 1107-1113 , 2004

CB04b Multiobjective Multicast Routing Algorithm

Crichigno, J. & Barán, B.

Telecommunications and networking: (ICT 2004) , Vol. 3124 , pp. 1029-1034 , 2004

crouzeix1 Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities

Crouzeix, J.; Marcotte, P. & Zhu, D.


Crowder:Johnson:Padberg Solving Large-scale Zero-one Linear Programming Problem

Crowder, H.; Johnson, E. & Padberg, M.


CJP Solving large-scale zero-one linear programming problems

Crowder, H.P.; Johnson, E.L. & Padberg, M.


CJPtsp



Solving large-scale symmetric travelling salesman problems to optimality

Crowder, H.P. & Padberg, M.


CruzMateusMacGregorSmith03 A Branch-and-Bound Algorithm to Solve a Multi-level Network Optimization Problem

Cruz, F.; Mateus, G. & Smith, J.M.

Journal of Mathematical Modelling and Algorithms , Vol. 2 , pp. 37–-56 , 2003

CrSmMa98 Solving to Optimality the Uncapacitated Fixed-Charge Network Flow Problem

Cruz, F.; Smith, J.M. & Mateus, G.


CrSmMa99 Algorithms for a Multi-level Network Optimization Problem

Cruz, F.; MacGregor~Smith, J. & Mateus, G.


CunMarRibRou02 Strategies for the parallel implementation of metaheuristics

Cung, V.; Martins, S.; Ribeiro, C. & Roucairol, C.

pp. 263-308 , 2002

CunMarRibRou02a Strategies for the parallel implementation of metaheuristics

Cung, V.; Martins, S.; Ribeiro, C. & Roucairol, C.

pp. 263-308 , 2002

CunLuc2004 Lower and upper bounds for the degree-constrained minimum spanning tree problem



da Cunha, A. & Lucena, A.

2005

cunningham1 Matching, matroids, and extensions

Cunningham, W.H.


des85-5 Optimal attack and reinforcement of a network

Cunningham, W.


CuGe92 Economie des Télécommunications: Ouverture et Régle-mentation

Curien, N. & Gensollen, M.

Economica , 1992

cvetkovic1 Semidefinite relaxations of the traveling salesman problem

Cvetkovic, D.; Cangalovic, M. & Kovacevic-Vujcic, V.V.

1998

Cynara:Bertsekas Distributed power control algorithms for wireless networks

Cynara, W. & Bertsekas, D.


czyzyk2 A study of the augmented system and column-splitting approaches for solving two-stage stochastic linear programs by interior-point methods

Czyzyk, J.; Fourer, R. & Mehrotra, S.




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.


czyzyk3 PCx user guide (version 1.1)

Czyzyk, J.; Mehrotra, S.; Wagner, M. & Wright, S.J.

1997

czyzyk4 Optimization case studies in the NEOS guide

Czyzyk, J.; Wisniewski, T. & Wright, S.J.


CordovaLee A heuristic algorithm for the rectilinear Steiner arborescence problem

Córdova, J. & Lee, Y.

1994

05dem Multi-layer traffic grooming in networks with an IP/MPLS layer on top of a meshed optical layer

D. Maesschalck, S.; Pickavet, M.; Colle, D. & Demeester, P.


Applegate:Bixby:Chvatal:Cook:2 On the solution of traveling salesman problems

url



D.~Applegate, R. & W.~Cook

Documenta Mathematica Journal der Deutschen Mathematiker-Vereinigung ICM III , pp. 645-656 , 1998

DiaFer98a A hybrid GRASP-Tabu Search algorithm for the single source capacitated plant location problem

Daz, J. & Fernández, E.

1998

Daf5 The General Multimodal Network Equilibrium Problem with Elastic Demand

Dafermos, S.

Networks , Vol. 12 , pp. 57-72 , 1982

Daf4 A Multicriteria Route-Mode Choice Traffic Equilibrium Model

Dafermos, S.

1981

Daf3 Traffic Equilibrium and Variational Inequalities

Dafermos, S.


Daf2 Integrated Equilibrium Flow Models for Transportation Planning

Dafermos, S.

Vol. 118 , pp. 106-118 , 1976

Daf1 The Traffic Assignment Problem for Multimodal Networks

Dafermos, S.




DafNag2 Isomorphism Between Spatial Price and Traffic Network Equilibrium Models

Dafermos, S. & Nagurney, A.

1985

DafNag1 On Some Traffic Equilibrium Theory Paradoxes


Transportation Research B , Vol. 18 , pp. 101-110 , 1984

DafSpar The Traffic Assignment Problem for a General Network

Dafermos, S.C. & Sparrow, F.T.

Journal of Research of the National Bureau of Standards , Vol. 73B , pp. 91-118 , 1969

Daf84 On some traffic equilibrium theory paradoxes


Transportation Research , Vol. 18B , pp. 101-110 , 1984

Daf69 The traffic assignment problem for a general network

Dafermos, S. & Sparrow, F.

Journal of RNBS , Vol. 73B , pp. 91-118 , 1969

Dag77a On the traffic assignment problem with flow dependent costs -- I

Daganzo, C.

Transportation Research , Vol. 11 , pp. 433-437 , 1977

Dag77b



On the traffic assignment problem with flow dependent costs -- II

Daganzo, C.


Dahl1999 Notes on polyhedra associated with hop-constrained paths

Dahl, G.


dahl2 Notes on polyhedra associated with hop-constrained paths

Dahl, G.


dahl99 Notes on polyhedra associated with hop-constrained paths

Dahl, G.


Dahl1998 "The 2-hop spanning tree problem

Dahl, G.


Dahl98 The 2-hop spanning tree problem

Dahl, G.


Dah94 The Design of Survivable Directed Networks

Dahl, G.




dahl04 On the directed hop-constrained shortest path problem

Dahl, G. & Gouveia, L.


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.


DahMarSto99a Routing through virtual paths in layered telecommunication networks



DaMaSt95 Routing through virtual paths in layered telecommunication networks


1995

des95-3 Routing through virtual paths in layered

telecommunication networks




1995

dahl04b A note on hop-constrained walk polytopes

Dahl, G.; N., F. & Gouveia, L.


dahl1 A cutting plane algorithm for multicommodity survivable network design problems

Dahl, G. & Stoer, M.


dahsto98 A cutting-plane algorithm for multicommodity survivable network design problems


Informs J. on Computing , Vol. 10 , 1998

DS98 A cutting plane algorithm for multicommodity survivable network design problems



des94-1 A polyhedral approach to multicommodity

survivable network design


Numer. Math. , Vol. 68 , pp. 149-167 , 1994

dahl3



Large-scale integer programs in image analysis

Dahl, G.; Storvik, G. & Fadnes, A.


willemain2 The effect of long-memory arrivals on queue performance

Dahl, T.A. & Willemain, T.R.


dai1 Computing All Nonsingular Solutions of Cyclic-n Polynomial Using Polyhedral Homotopy Continuation Methods

Dai, Y.; Kim, S. & Kojima, M.

2001

DaidaEtAl05 Visualizing Tree Structures in Genetic Programming

Daida, J.; Hilss, A.; Ward, D. & Long, S.

Genetic Programming and Evolvable Machines , Vol. 6 , pp. 79-110 , 2005

Dakin A tree-search algorithm for mixed integer programming problems

Dakin, R.J.

The Computer Journal , Vol. 8(3) , pp. 250-255 , 1965

DM78 Reverse Path Forwarding of Broadcast Packets

Dalal, Y. & Metcalfe, R.

Communications of the ACM , Vol. 21 , 1978

Da97 Distributed disaggregate simplicial decomposition -- A parallel algorithm for traffic assignment

Damberg, O. & Migdalas, A.

url



pp. 172-193 , 1997

Da97b Parallel algorithms for network problems

Damberg, O. & Migdalas, A.

pp. 183-238 , 1997

dammeyer1 Dynamic tabu list management using the reverse elimination method

Dammayer, F. & Vo, S.


Danilov-etal-2001 Discrete convexity and equilibria in economies with indivisible goods and money

Danilov, V.; Koshevoy, G. & Murota, K.

Mathematical Social Sciences , Vol. 41 , pp. 251-273 , 2001

Dans02 Existing business models for auctions and their adaptation to electronic markets

Dans, E.

Journal of Electronic Commerce Research , Vol. 3 , pp. 23-31 , 2002

Dan63 Linear Programming and Extensions

Dantzig, G.


Da62 Linear Programming and Extensions

Dantzig, G.


Dan51



Application of the simplex method to a transportation problem

Dantzig, G.

pp. 359-373 , 1951

dantzig5 Linear programming

Dantzig, G.B.


dantzig4 Planning under uncertainty

Dantzig, G.B.

Annals of Operations Research , Vol. 84 , pp. Preface , 1998

DANTZIG Linear Programming and Extensions

Dantzig, G.B.


Dan1 Maximization of a linear function of variables subject to linear inequalities

Dantzig, G.B.

pp. 339-347 , 1951

Dantzig3 Application of the simplex method to a transportation problem

Dantzig, G.B.

pp. 359-373 , 1951

danfj54 Solution of a large-scale traveling salesman problem

Dantzig, G.B.; Fulkerson, D.R. & Johnson, S.M.




DFJ Solutions of a large-scale travelling salesman problem

Dantzig, G.B.; Fulkerson, D.R. & Johnson, S.M.


Dan60a On the shortest route through a network

Dantzig, G.


Dantzig57 Discrete variable extremum problems

Dantzig, G.


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.


darbydowman1 Properties of some combinatorial optimization problems and their effect on the performance of integer programming and constraint logic



programming

Darby-Dowman, K. & Little, J.


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


IEEE International Conference on Communications (ICC '97) , pp. 376-380 , 1997

DB97 Routing in ad-hoc networks using minimum connected dominating sets


Proceedings of ICC 1997 , pp. 376-380 , 1997

DasLoui01 Reconstructing a Minimum Spanning Tree after Deletion of Any Node

Das, B. & Loui, M.


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



Networks (IC3N) , pp. 1-20 , 1997

das1 Normal-boundary intersection: a new method for generating Pareto optimal points in multicriteria optimization problems

Das, I. & Dennis, J.E.


Dasgupta-Maskin-1979 The implementation of social choice rules: some results on incentive compatibility

Dasgupta, H.P. & Maskin, E.

Review of Economic Studies , Vol. 46 , pp. 185-216 , 1979

dash1 Valid inequalities based on the interpolation procedure

Dash, S. & Gunluk, O.

2004

dash2 Valid inequalities based on simple mixed-integer sets

Dash, S. & Gunluk, O.

2003

Daskin1995 Network and discrete location: Models, algorithms, and applications

Daskin, M.S.

John Wiley , 1995

daskin95 Network and Discrete Location

Daskin, M.

John Wiley and Sons Incorporated , 1995

Daubechies88

url

url



Time-frequency localization operators: A geometric phase space approach

Daubechies, I.

IEEE Transactions on Information Theory , Vol. 34 , pp. 605-612 , 1988

mdavis1 Portfolio selection with transaction costs

Davis, M.H.A. & Norman, A.R.


davis1 Industrial-strength optimization at Boeing

Davis, P.

SIAM News , Vol. 29 , pp. 1,10 , 1996

DaRa69 A Branch and Bound Algorithm for the Capacitated Facilities Location Problem

Davis, P. & Ray, T.

Naval Research Logistic Quarterly , Vol. 16 , pp. 331-334 , 1969

97dayest Mesh and Ring Architectures for the Optical Network Layer

Day, M. & Ester, G.

Proceedings of NFOEC 97 , 1997

day1 Flight attendant rostering for short-haul airline operations

Day, P.R. & Ryan, D.M.


kn:dgv A polynomial Newton method for linear programming

De Ghellinck, G. & Vial, J.




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

assignment and sequencing

De, P.; Ghosj, J. & Wells, C.

International Journal of Production Economics , Vol. 34 , pp. 179-185 , 1994

deineko1 A study of exponential neighborhoods for the travelling salesman problem and the quadratic assignment problem

Deineko, V.G. & Woeginger, G.J.


dean1 NETPAD: An interactive graphics system for network modeling and optimization

Dean, N.; Mevenkamp, M. & Monma, C.L.


DearingFrancis A network flow solution to a multifacility location problem involving rectilinear distances

pdf url



Dearing, P.M. & Francis, R.L.


Deb1999 Multi-objective genetic algorithms: Problem difficulties and construction of test problems

Deb, K.

Evolutionary Computation , Vol. 7 , pp. 205-230 , 1999

D88 Multicast Routing in Internetworks and Extended LANs

Deering, S.

ACM SIGCOMM Summer 1988 , pp. 55-64 , 1988

DC90 Multicast routing in datagram internetworks and extended LANs

Deering, S. & Cheriton, D.

ACM Transactions on Computer Systems , Vol. 8 , pp. 85-110 , 1990

Deering90 Multicast Routing in Datagram Internetworks and Extended Lans

Deering, S. & Cheriton, D.


DEFJLW94 An Architecture for Wide-Area Multicast Routing

Deering, S.; Estrin, D.; Farinacci, D.; Jacobson, V.; Liu, C. & Wei, L.


DEFJLW96 The PIM architecture for wide-area multicast routing

Deering, S.; Estrin, D.; Farinacci, D.; Jacobson, V.; Liu, C. & Wei, L.

IEEE ACM Transactions on Networking , Vol. 4 , pp. 153-162 , 1996



rfc1112 Host extensions for IP multicasting

Deering, S.E.

1989

Deeter98 Economic design of reliable networks

Deeter, D. & Smith, A.


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.


dellamico2 Exact solution of the SONET ring loading problem

Dell'Amico, M.; Labbe, M. & Maffioli, F.


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

url



Dell'Amico, M.; Merani, M. & Maffioli, F.

IEEE Transactions in Wireless Communications , Vol. 3 , pp. 1013-1017 , 2004

DeLaMa99 Exact solution of the SONET Ring Loading Problem

Dell'Amico, M.; Labbé, M. & Maffioli, F.


DeMaVa95 On Prize-collecting Tours and the Asymmetric

Traveling salesman Problem

International Transactions on Operational Research , Vol. 81 , pp. 289-305 , 1995

DelDiaFerOrt99a Reactive GRASP and Tabu Search based heuristics for the single source capacitated plant location problem

Delmaire, H.; Daz, J.; Fernández, E. & Ortega, M.

INFOR , Vol. 37 , pp. 194-225 , 1999

DelDiaFerOrt97a Comparing new heuristics for the pure integer

capacitated plant location problem

1997

delorme1 Laplacian eigenvalues and the maximum cut problem

Delorme, C. & Poljak, S.


DelGanRod03a GRASP for set packing problems pdf url



Delorme, X.; Gandibleux, X. & Rodriguez, J.


DelGanRod01a GRASP for set packing problems

Delorme, X.; Gandibleux, X. & Rodriguez, J.

Proceedings of the Operational Research Peripatetic Post-Graduate

Programme (ORP3)

, pp. , 2001

DelRodGan01a Heuristics for railway infrastructure saturation

Delorme, X.; Rodriguez, J. & Gandibleux, X.

Electronic Notes in Theoretical Computer Science , Vol. 50 , 2001

dp81 Bounds and constructions for binary asymmetric error correcting codes

Delsarte, P. & Piret, P.

IEEE Trans. Inform. Theory , Vol. IT-27 , pp. 125-128 , 1981

Demange-etal-1986 Multi-item auctions

Demange, G.; Gale, D. & Sotomayor, M.

Journal of Political Economy , Vol. 94 , pp. 863-872 , 1986

DemangeMonnotPaschos03 Differential Approximation Results for the Steiner Tree Problem

Demange, M.; Monnot, J. & Paschos, V.


dembo1 The practice of portfolio replication. A practical overview of forward and inverse problems

pdf url



Dembo, R. & Rosen, D.


Dembo Scenario Optimization

Dembo, R.S.


Deme99 Resilience in Multilayer Networks

Demeester, P.; Autenrieth, A.; Brianza, C.; Castagna, L.; Signorelli, G.; Clemente, R.; Ravera, M.; Jajszczyk, A.; Janukowicz, D.; Van~Doorselaere, K. & Harada, Y.


deMercado76 A method for calculation of network reliability

deMercado, J.; Spyratos, N. & Bowen, B.

IEEE Transactions on Reliability , Vol. R25 , pp. 71-6 , 1976

DemEks98a Subset selection in multiple linear regression: a new

mathematical programming approach

Demirer, R. & Eksioglu, B.

1998

demiriz1 Linear programming boosting via column generation

Demiriz, A.; Bennett, K.P. & Shawe-Taylor, J.

Journal of Machine Learning , Vol. 46 , pp. 225-254 , 2002

DemErsCagDel01 Location Area Planning in Cellular Networks Using Simulated Annealing

url



Demirkol, I.; Ersoy, C.; Caglayan, M. & Delic, H.

Proc. IEEE INFOCOM 2001 , pp. 566-573 , 2001

demmel1 Applied Numerical Linear Algebra

Demmel, J.W.

SIAM , 1997

dempe1 Sensitivity analysis for linear optimization problem with fuzzy data in the objective function

Dempe, S. & Starostina, T.

2004

dempster1 Sequential importance sampling algorithms for dynamic stochastic programming

Dempster, M.A.H.


DempsterMedova01 Evolving system architectures for multimedia network design

Dempster, M. & E.~Medova


DenFox79a Shortest route methods: reaching pruning, and buckets

Denardo, E. & Fox, B.

Operational Research , Vol. 27 , pp. 161-186 , 1979

DenFox79b Shortest route methods: 2.

Group knapsacks, Expanded networks,

and Branch-and-Bound

url

url



Denardo, E. & Fox, B.

Operational Research , Vol. 27 , pp. 548-566 , 1979

DeneenDezell Using partitioning and clustering techniques to generate rectilinear Steiner trees

Deneen, L.L. & Dezell, J.B.

Proceedings of the Second Canadian Conference on Computational Geometry , pp. 315-318 , 1990

DeneenShuteThomborson A probably fast, provably optimal algorithm for rectilinear Steiner trees

Deneen, L.L.; Shute, G.M. & Thomborson, C.D.

Random Structures and Algorithms , Vol. 5 , pp. 535-557 , 1994

Dengiz97 Local search genetic algorithm for optimal design of reliable networks

Dengiz, B.; Altiparmak, F. & Smith, A.

IEEE Transactions on Evolutionary Computation , Vol. 1 , pp. 179-88 , 1997

Dengiz97a Genetic algorithm design of networks considering all-terminal reliability


6th Industrial Engineering Research Conference Proceedings , pp. 30-5 , 1997

Dengiz97b Efficient optimization of all-terminal reliable networks, using an evolutionary approach



Dengiz95 A genetic algorithm approach to optimal topological design of all terminal networks




Intelligent Engineering Systems Through Artificial Neural Networks. Vol.5. Fuzzy Logic and Evolutionary Programming. Proceedings of the Artificial Neural Networks in Engineering (ANNIE'95) , pp. 405-10 , 1995

Den The Science of Computing: Supernetworks

Denning, P.J.

American Scientist , Vol. 73 , pp. 127-129 , 1985

DMT A variable-metric variant of the Karmarkar algorithm for linear programming

Dennis Jr., J.E.; Morshedi, A.M. & Turner, K.


dennis3 A unified approach to global convergence of trust region methods for nonsmooth optimization

Dennis, J.E.; Li, S.B. & Tapia, R.A.


DeSc Numerical Methods for Unconstrained Optimization and Nonlinear Equations

Dennis, J.E. & Schnabel, R.B.


Deo74 Graph Theory with Applications to Engineering and

Computer Science

Deo, N.


Deo92



Parallel algorithms for terminal-pair reliability

Deo, N. & Medidi, M.


DeoPan84a Shortest path algorithms: taxonomy and annotation

Deo, N. & Pang, C.

Networks , Vol. 14 , pp. 275-323 , 1984

Kratsch97 An approximation algorithm for clustering graphs with dominating diametral path

Deogun, J.; Kratsch, D. & Steiner, G.


Der2 Solving large scale matching problems efficiently --- A new primal matching approach

Derigs, U.

Networks , Vol. 16 , pp. 1-16 , 1986

Der1 Solving matching problems via shortest path techniques

Derigs, U.

1983

derigs3 INTIME --- A new heuristic approach to the vehicle routing problem with time windows, with a bakery fleet case

Derigs, U. & Grabenhauer, G.

pp. 249-266 , 1993

DerMtz2 Solving (large scale) matching problems combinatorially



Derigs, U. & Metz, A.


DerMtz On the use of optimal fractional matchings for solving the (integer) matching problem

Derigs, U. & Metz, A.

Computing , Vol. 36 , pp. 263-270 , 1986

desaulniers1 Crew pairing at Air France

Desaulniers, G.; Desrosiers, J.; Dumas, Y.; Marc, S.; Rioux, B.; Solomon, M.M. & Soumis, F.


DesTri98a A greedy randomized adaptive search procedure (GRASP) for inferring logical clauses from examples in polynomial time and some extensions

Deshpande, A. & Triantaphyllou, E.

Mathl. Comput. Modelling , Vol. 27 , pp. 75-99 , 1998

desdss95 Time constrained routing and scheduling

Desrosiers, J.; Dumas, Y.; Solomon, M.M. & Soumis, F.

Vol. 8 , pp. 35-139 , 1995

desdss90 Time constrained routing and scheduling

Desrosiers, J.; Dumas, Y.; Solomon, M.M. & Soumis, F.

1990

des96 In: Constrained Routing and Scheduling

Desrosiers, J.; Dumas, Y.; Solomon, M. & Soumis, F.



Elsevier Science B.V. , Vol. 8 , pp. 35-139 , 1996

Desrosiers:Soumis:Desrochers_1984 Routing with time windows by column generation

Desrosiers, J.; Soumis, F. & Desrochers, M.

Networks , Vol. 14 , pp. 545-565 , 1984

Dewan90 User Delay Cost and Internal Pricing for a Service Facility

Dewan, S. & Mendelson, H.


DezaLaurent97 Geometry of Cuts and Metrics

Deza, M. & Laurent, M.


Deza1 Facets for the cut cone I



Deza2 Facets for the cut cone II: Clique-web inequalities



deza4 The Symmetries of the Cut Polytope and of some Relatives

Deza, M.M.; Grishukhin, V.P. & Laurent, M.

Applied Geometry and Discrete Mathematics --- The Victor Klee Festschrift , Vol. 4 , pp. 205-220 , 1991

deza3



Clique-Web Facets for Multicut Polytopes

Deza, M.M.; Grötschel, M. & Laurent, M.


deza5 Complete Descriptions of Small Multicut Polytopes

Deza, M.M.; Grötschel, M. & Laurent, M.

Applied Geometry and Discrete Mathematics --- The Victor Klee Festschrift , Vol. 4 , pp. 221-252 , 1991

MS2000 Exact solutions of optimal rectangular partitions via integer programming

de~Meneses, C. & de~Souza, C.

International Journal of Computational Geometry and Applications , Vol. 10 , pp. 477-522 , 2000

deVries-Vohra-2003 Combinatorial auctions: A survey

de~Vries, S. & Vohra, R.


Dia69a Algorithm 360: Shortest Path Forest with Topological Ordering

Dial, R.

Comm. ACM , Vol. 12 , pp. 632-633 , 1969

DianePlesnik91 THREE NEW HEURISTICS FOR THE STEINER PROBLEM IN GRAPHS

Diané, M. & Plesník, J.

Acta Mathematica Universitatis Comenianae , Vol. LX , pp. 105-121 , 1991

DiaVelSol99a Un modelo tipo GRASP para la paralelización de algoritmos en computadoras MIMD: Aplicación al algoritmo de Jarmenson



Diaz, J.; Velázquez, J. & Solis, J.

1999

DIBE Dynamic Routing of the Italcable Telephone Traffic: Experience and Perspectives

DiBenedetto, A.; LaNave, P. & Sisto, C.

Proceedings Globecom 1989 , 1989

des96-2 (k)-edge connected polyhedra on series-parallel graphs

Didi Biha, M. & Mahjoub, A.


DiederichEtAl04 A mobile differentiated services QoS model

Diederich, J.; Wolf, L. & Zitterbart, M.


Diestel Graph Theory

Diestel, R.


Dietrich:Escudero Coefficient Reduction for Knapsack-like constraints in 0/1 programs with variable upper bounds

Dietrich, B. & L.~Escudero


Dij59a A Note on Two Problems in Connection with Graphs

Dijkstra, E.

Numer. Math. , Vol. 1 , pp. 269-271 , 1959



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.



Doklady Akademiia Nauk SSSR , Vol. 174 , pp. 747-748 , 1967

dikin1 Iterative solution of linear and quadratic programming problems

Dikin, I.I.

Doklady of Soviet Academy of Sciences , Vol. 174 , pp. 747-748 (in Russian) , 1967

dikinZ2 Iterative Solution of Problems of Mathematical Programming

(Interior Point Algorithms)

Dikin, I.I. & Zorkal'tsev

Nauka , 1980

dimacs Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge

DIMACS

1995

dimacs1 The first DIMACS international implementation challenge: The benchmark experiments

DIMACS

1991

DiFl79 Exact and Approximate Algorithms for Optimal Network Design

Dionne, R. & Florian, M.

Networks , Vol. 9 , pp. 37-59 , 1979

DDC97 Multipoint Communication: A survey of protocols, functions, and mechanisms

Diot, C.; Dabbous, W. & Crowcroft, J.




Diot97 A Survey of Combinatorial Optimization Problems in Multicast Routing

Diot, C.; Dabbous, W. & Crowcroft, J.


Disney04 Assessing the impact of e-business on supply chain dynamics

Disney, S.; Naim, M. & Potter, A.

International Journal of Production Economics , Vol. 89 , pp. 109-118 , 2004

dive01 Multiband Switches: the Best of Both Worlds

Dive, G. & Zick, J.

Telecommunications Magazine , 2001

Dix Estimating extremal eigenvalues and condition numbers of matrices

Dixon, J.D.


DL93 How bad is naive multicast routing

Doar, M. & Leslie, I.

Proceedings of the IEEE INFOCOM , pp. 82-89 , 1993

Doar93 How Bad is Naive Multicast Routing

Doar, M. & Leslie, I.

Proceedings of the Annual Joint Conference of the IEEE Computer and Communications Societies , pp. 82-89 , 1993

Dod90a Slow annealing versus multiple fast annealing runs: An empirical



investigation

Dodd, N.


dolan7 NEOS Server 4.0 Administrative Guide

Dolan, E.

2001

dolan6 The NEOS Server for Optimization: Version 4 and Beyond

Dolan, E.; Fourer, R.; Moré, J.J. & Munson, T.S.

2002

dolan2 Benchmarking Optimization Software with Performance Profiles

Dolan, E. & Moré, J.J.


dolan1 Benchmarking Optimization Software with COPS

Dolan, E. & Moré, J.J.

2000

dolan4 Optimality Measures for Performance Profiles

Dolan, E.; Moré, J.J. & Munson, T.S.

2004

dolan5 Benchmarking Optimization Software with COPS 3.0

Dolan, E.; Moré, J.J. & Munson, T.S.

2004

url

url

url

url

url

url



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.


domingoferrer1 Practical Data-Oriented Microaggregation for Statistical Disclosure Control

Domingo-Ferrer, J. & Mateo-Sanz, J.M.

IEEE Transactions on Knowledge and Data Engineering , Vol. 14 , pp. 189-201 , 2002

donath1 Lower bounds for the partitioning of graphs

Donath, W.E. & Hoffman, A.J.

IBM Journal of Research and Development , Vol. 17 , pp. 420-425 , 1973

DongZhangNag A Supply Chain Network Equilibrium Model with Random Demands

Dong, J.; Zhang, D. & Nagurney, A.


DBMS LINPACK Users Guide

url



Dongarra, J.; Bunch, J.R.; Moler, C.B. & Stewart, G.W.

SIAM Publications , 1979

dongarra1 Performance of various computers using standard linear equations software

Dongarra, J.J.

1995

linpack Linpack Users' Guide

Dongarra, J.; Moler, C.; J.R.Bunch & G.W.Stewart

1979

DorStu03 The ant colony optimization metaheuristic: Algorithms, applications, and advances

Dorigo, M. & Stützle, T.

pp. 251-285 , 2003

dorigo99ant The Ant Colony Optimization Meta-Heuristic

Dorigo, M. & Caro, G.D.

pp. 11-32 , 1999

dorndorf1 Fast clustering algorithms

Dorndorf, U. & Pesch, E.


Doucette04 Advances on Design and Analysis of Mesh-Restorable Networks

Doucette, J.

University of Alberta , 2004

url



dou03 On the Availability and Capacity Requirements of Shared Backup Path-protected 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 Shared-Risk 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


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 Mesh-Restorable DWDM Networks



Doucette:Grover Influence of modularity and economy-of-scale effects on design of mesh-restorable DWDM networks

Doucette, J. & Grover, W.




DoHe03 Algorithmic Approaches for Efficient Enumeration of Candidate $p$-Cycles and Capacitated $p$-Cycle Network Design

Doucette, J.; He, D.; Grover, W.D. & Yang, O.

Proceedings of the 4th International Workshop on Design of Reliable Communication Networks (DRCN 2003) , pp. 212-220 , 2003

Douglis97 Rate of change and other metrics: A live study of the World Wide Web

Douglis, F.; Feldmann, A.; Krishnamurthy, B. & Mogul, J.

Proc. of USENIX , 1997

91dov Algorithms for Multiplex Bundling in a Telecommunications Network

Doverspike, R.D.


DrakeHougardy04 On approximation algorithms for the terminal Steiner tree problem

Drake, D. & Hougardy, S.


Drew03 Strategic uses of e-commerce by SMEs in the east of England

Drew, S.

European Management Journal , Vol. 21 , pp. 79-88 , 2003

Dre69 An appraisal of some shortest path algorithms

Dreyfus, S.


DreyfusWagner



The Steiner problem in graphs

Dreyfus, S.E. & Wagner, R.A.

Networks , Vol. 1 , pp. 195-207 , 1972

DreznerWesolowsky Layout of facilities with some fixed points

Drezner, Z. & Wesolowsky, G.O.


Driebeek An Algorithm for the Solution of Mixed Integer Programming Problems

Driebeek, N.


drijver1 Asset liability management modeling using multistage mixed-integer Stochastic Programming

Drijver, S.J.; Haneveld, W.K.K. & van der Vleck, M.H.

2000

DrorHaouari00 Generalized Steiner Problems and Other Variants

Dror, M. & Haouari, M.


DrorHaouariChaouachi00 Generalized spanning trees

Dror, M.; Haouari, M. & Chaouachi, J.


DuEtAl01 The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points

Du, D.; Wang, L. & Xu, B.

url



pp. 509-518 , 2001

DuHwang A proof of the Gilbert-Pollak conjecture on the Steiner ratio

Du, D.Z. & Hwang, F.K.


Du86 An Optimization Problem on Graphs

Du, D.


DK00 Theory of Computational Complexity

Du, D. & Ko, K.


DLNP01 Steiner tree problems

Du, D.; Lu, B.; Ngo, H. & Pardalos, P.

Vol. 5 , pp. 227-290 , 2001

PardalosetalEnz Steiner tree problems

Du, D.; Lu, B.; Ngo, H. & Pardalos, P.

Vol. 5 , pp. 227-290 , 2001

8 Global minimax approaches for solving discrete problems

Du, D. & Pardalos, P.

Lecture Notes in Economics and Mathematical Systems , Vol. 452 , pp. 34-48 , 1997

DP93 Subset Interconnection designs: Generalizations of spanning trees and



Steiner trees

Du, D. & Pardalos, P.

pp. 111-124 , 1993

du1 Global convergence of Rosen's gradient projection method

Du, D. & Zhang, X.


DuEtAL00 On Shortest k-Edge-Connected Steiner Networks in Metric Spaces

Du, X.; Hu, X. & Jia, X.


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.


duckworth2 Mathematics of one day cricket url



Duckworth, F.C. & Lewis, A.J.

Interdisciplinary Science Reviews , Vol. 24 , pp. 64-66 , 1999

duckworth1 A fair method for resetting the target in interrupted one-day cricket matches

Duckworth, F.C. & Lewis, A.J.


Duckworth03 Randomized Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs

Duckworth, W. & Mans, B.

Proceedings of the Fifth Conference on Algorithms and Complexity , pp. 83-95 , 2003

DER Direct Methods for Sparse Matrices

Duff, I.S.; Erisman, A.M. & Reid, J.K.

Clarendon Press , 1986

duffield:01 Trajectory Sampling for Direct Traffic Observation

Duffield, N.G. & Grossglauser, M.

IEEE/ACM Trans. Networking , Vol. 9 , pp. 280-292 , 2001

Duin99 Preprocessing the Steiner Problem in Graphs

Duin, C.

pp. 175-233 , 2000

Duin89a An Edge Elimination Test for the Steiner Problem in Graphs

Duin, C. & Volgenant, A.


url



Duin89b Reduction Tests for the Steiner Problem in Graphs



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



the Steiner problem in graphs

Duin, C. & Vo, S.

Networks , Vol. 34 , pp. 181-191 , 1999

DuinNetworks Reduction tests for the Steiner problem in graphs


Networks , Vol. 19 , pp. 549-567 , 1989

DuinORLetters An edge elimination test for the Steiner problem in graphs



DuVo89 Reduction Tests for the Steiner Problem in Graphs


Networks , Vol. 19 , pp. 549-567 , 1989

DVNetworkDesign Reducing the hierarchical network design problem



DuinVolgenantVoss04 Solving group Steiner problems as Steiner problems

Duin, C.; Volgenant, A. & Vo, S.


DV94 Steiner tree heuristics - a survey

Duin, C. & Vo}, S.

Operations Research Proceedings 1993 , pp. 485-496 , 1994



spielman2 Smoothed analysis of Renegar's Condition Number for Linear Programming

Dunagan, J.D.; Spielman, D.A. & Teng, S.

2001

Dunbar97 On weakly connected domination in graphs

Dunbar, J.E.; Grossman, J.; Hattingh, J.H.; Hedetniemi, S.T. & McRae, A.A.

Discrete Mathematics , Vol. 167--168 , pp. 261-269 , 1997

dunn-grover Comparison of $k$-Shortest Paths

and Maximum Flow Routing for Network Facility Restoration

Dunn, D.A.; Grover, W.D. & MacGregor, M.H.

IEEE J. on Selected Areas in Comm. , Vol. 12 , pp. 88-99 , 1994

Dun79 Rate of convergence of conditional gradient algorithms near singular and nonsingular extremals

Dunn, J.


dupacova1 Portfolio optimization via stochastic programming: methods of output analysis

Dupacova, J.

Mathematical Methods of Operations Research , Vol. 50(2) , 1999

Dupacova78 Minimax approach to stochastic linear programming and the moment problem. Recent results

Dupacová, J.

url



ZAMM , Vol. 58 , pp. T466-T467 , 1978

duran1 An outer-approximation algorithm for a class of mixed-integer nonlinear programs

Duran, M.A. & Grossman, I.E.


durier1 The general one center location problem

Durier, R.


Dutta Capacity planning of private networks using DCS under multibusy-hour traffic

Dutta, A.


Dutta:Hsu Cellular network design site selection and frequency planning

Dutta, A. & Hsu, V.


Dutta:Kawatra Topological design of a centralized communication network with unreliable links and node outage costs

Dutta, A. & Kawatra, R.


DuKi96 A heuristic approach for capacity expansion of packet networks

Dutta, A. & Kim, Y.




DuKu99 Design of Partially Survivable Networks for Cellular Telecommunication Systems

Dutta, A. & Kubat, P.


Dutta:Kubat Design of partially survivable networks for cellular telecommunication systems

Dutta, A. & Kubat, P.


16dut Traffic grooming in WDM networks: past and future

Dutta, R. & Rouskas, G.


20dut On optimal traffic grooming in WDM rings



dut00 A Survey of Virtual Topology Design Algorithms for Wavelength Routed Optical Networks



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



Dye, S.; Stougie, L. & Tomasgard, A.

Naval Research Logistics , Vol. 50 , pp. 869-887 , 2003

Dye:Tomasgard:Wallace Feasibility in transportation networks with supply eating arcs

Dye, S.; Tomasgard, A. & Wallace, S.

Networks , Vol. 31 , pp. 165-176 , 1998

dyer1 The complexity of vertex enumeration methods

Dyer, M.E.


Dykeman86 Scheduling algorithms for videotex systems under broadcast delivery

Dykeman, H.D.; Ammar, M.H. & Wong, J.W.

Proc. of Int. Communication Conf. (ICC'86) , pp. 1847-1851 , 1986

Balas:Ceria:Cornuejols Mixed 0-1 programming by lift-and-project in a branch-and-cut framework

E. Balas, S.C.


BC81 A restricted Lagrangian approach to the traveling salesman problem

E.~Balas & N.~Christofides


Lee_Winter2004 Generating cutting planes for mixed integer programming problems in a parallel computing environment

E.~K.~Lee




Tail91 Robust taboo search for the quadratic assignment problem

E.~Taillard


Easton80 Sequential destruction method for Monte Carlo evaluation of system reliability

Easton, M. & Wong, C.


eaves1 Optimal scaling of balls and polyhedra

Eaves, B.C. & Freund, R.M.


ecker4 Geometric Programming: methods, computations, and applications

Ecker, J.G.


Ecker1 Introduction to Operations Research

Ecker, J.G. & Kupferschmid, M.

John Wiley , 1986

ecker3 An application of nonlinear optimization in molecular biology

Ecker, J.G.; Kupferschmid, M.; Lawrence, C.E.; Reilly, A.A. & Scott, A.C.H.


eckstein7 A Practical General Approximation Criterion for Methods of Multipliers Based on Bregman Distances

url

url



Eckstein, J.

2000

eckstein6 How much communication does parallel branch and bound need?

Eckstein, J.


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.


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.




Eckstein2 Large-scale parallel computing, optimization, and operations research: a survey

Eckstein, J.

ORSA CSTS Newsletter , Vol. 14(2) , pp. 1,8-12,25-28 , 1993

eckstein4 Data-parallel implementations of dense simplex methods on the connection machine CM--2

Eckstein, J.; Bodurolu, ....; Polymenakos, L.C. & Goldfarb, D.


eckf93 Some reformulations and applications of the alternating direction method of multipliers

Eckstein, J. & Fukushima, M.

1993

eckstein8 PICO: an object-oriented framework for parallel branch and bound

Eckstein, J.; Phillips, C.A. & Hart, W.E.

2000

ede87 Algorithms in combinatorial geometry

Edelsbrunner, H.


edirisinghe2 Scenario-clustering based row aggregation in multi-stage stochastic LP

Edirisinghe, C.

1995

url



edirisinghe3 Bound-based approximations in multistage stochastic programming: Nonanticipativity aggregation

Edirisinghe, N.C.P.


edirisinghe1 Implementing bounds-based approximations in convex-concave two-stage stochastic programming

Edirisinghe, N.C.P. & Ziemba, W.T.


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



Efroymson, M. & Ray, T.


Eick93 The Physics of the $M(t)/G/$ Queue

Eick, S.; Massey, W.A. & Witt, W.

Operations Research , pp. 400-408 , 1993

Eiger1996 Coaxial network modeling and engineering

Eiger, M.

Proceedings of the International Conference on Telecommunications , Vol. 1 , pp. 207-210 , 1996

EikVerVosAar95a A probabilistic analysis of local search

Eikelder, H.; Verhoeven, M.; Vossen, T. & Aarts, E.

pp. 605-618 , 1996

Ei02 The Semidefinite Relaxation of the $k$-Partition Polytope is Strong

Eisenblätter, A.

Vol. 2337 , pp. 273-290 , 2002

eisenblatter2 Frequency Assignment in GSM Networks: Models, Heuristics, and Lower Bounds

A. Eisenblätter

TU-Berlin and Konrad-Zuse-Zentrum für Informationstechnik , 2001

EisG05 A novel view on cell coverage and coupling for UMTS radio network evaluation and design

Eisenblätter, A. & Geerdes, H.

Proceedings of the 2nd International Network Optimization Conference (INOC) , Vol.

url



B , pp. 307-314 , 2005

EiGrKo00 Frequency assignment and ramifications of coloring

Eisenblätter, A.; Grötschel, M. & Koster, A.

Discussiones Mathematicae Graph Theory , Vol. 22 , pp. 51-88 , 2002

eisenblatter1 Frequency Planning and Ramifications of Coloring

Eisenblätter, A.; Grötschel, M. & Koster, A.M.C.A.

2000

Eisetal02 Modelling Feasible Network Configurations for UMTS

Eisenblätter, A.; Fugenschuh, A.; Koch, T.; Koster, A.; Martin, A.; Pfender, T.; Wegel, O. & Wessäly, R.

Telecommunications network design and management (eds. G. Anandalingam and S. Raghavan) , pp. 1-22 , 2003

YSMP The Yale Sparse Matrix Package, I. The Symmetric codes

Eisenstat, S.C.; Gurshy, M.C.; Schultz, M.H. & Sherman, A.H.

International Journal for Numerical Methods in Engineering , Vol. 18 , pp. 1145-1151 , 1982

dennis4 A trust-region approach to nonlinear systems of equalities and inequalities

El-Alem, J.E.D.J.M. & Williamson, K.


ElBakry2 On the formulation and theory of the primal-dual Newton interior-point method for nonlinear programming

El-Bakry, A.S.; Tapia, R.A.; Tsuchiya, T. & Zhang, Y.


url



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.


ElayoubiEtAl04 Admission control in UMTS in the presence of shared channels

Elayoubi, S.; Chahed, T. & Hébuterne, G.


elhedhli1 The Integration of Interior-Point Cutting Plane Methods within Branch-and-Price Algorithms

Elhedhli, S. & Goffin, J.


ElkinKortsarz04 Polylogarithmic Inapproximability of the Radio Broadcast Problem

Elkin, M. & Kortsarz, G.

pp. 105-116 , 2004

EGR91 Groupware: Some issues and experiences

Ellis, C.; Gibbs, S. & Rein, G.

Commun. ACM , Vol. 34 , pp. 39-58 , 1991

ell75 La loi des volumes économiques appliquée aux Télécommunications

Ellis, L.

Rev. Telecom 1 , Vol. 50 , pp. 4-20 , 1975

ElGr71 Solving Fixed Charge Location-Allocation Problems with Capacity and

url



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.


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.


elzinga1 A central cutting plane algorithm for the convex programming problem

Elzinga, J. & Moore, T.J.


Eng04 The role of e-marketplaces in supply chain management

Eng, T.Y.

Industrial Marketing Management , Vol. 33 , pp. 97-105 , 2004



enge1 A counterexample to H. Arsham's `Ìnitialization of the simplex algorithm: an artificial free approach''

Enge, A. & Huhn, P.

SIAM Review , Vol. 40 , pp. online , 1998

engelke1 Predictor-Corrector Smoothing Methods for the Solution of Linear Programs

Engelke, S. & Kanzow, C.

2000

epelly1 An interior point solver for smooth convex optimization with an application to environmental-energy-economic models

Epelly, O.; Gondzio, J. & Vial, J.

2000

epelman2 Condition Number Complexity of an elementary algorithm for computing a reliable solution of a conic linear system

Epelman, M. & Freund, R.M.


epelman3 Pre-Conditioners and Relations between Different Measures of Conditioning for Conic Linear Systems


2000

epelman1 Condition Number Complexity of an Elementary Algorithm for Resolving a Conic Linear System


1997

url

url

url

url

url

url



Ephremides90 Scheduling broadcasts in multihop radio networks

Ephremides, A. & Truong, T.V.


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.


erd3 On the strength of connectedness of a random graph

Erdös, P. & Rényi, A.

Acta Math. Acad. Sci. Hungar. , Vol. 12 , pp. 261-267 , 1961

erd2 On the evolution of random graphs


Publ. Math. Inst. Hungar. Acad. Sci. , Vol. 5 , pp. 17-61 , 1960

erd1 On random graphs


Publicationes Mathematicae , Vol. 6 , pp. 290-297 , 1959

ErdemWong04 Rectilinear Steiner Tree Construction Using Answer Set Programming



Erdem, E. & Wong, M.

pp. 386-399 , 2004

EricksonMonmaVeinott Send-and-split method for minimum-concave-cost network flows

Erickson, R.E.; Monma, C.L. & Veinott Jr., A.F.


pard:pap A Genetic Algorithm for the weight setting

problem in OSPF routing

Ericsson, M.; Resende, M.G.C. & Pardalos, P.M.

Journal of Combinatorial

Optimization

, Vol. 6 , pp. 229-333 , 2002

ericsson1 A genetic algorithm for the weight setting problem in OSPF routing

Ericsson, M.; Resende, M.G.C. & Pardalos, P.M.

2001

EricssonResendePardalos2002 A genetic algorithm for the weight setting problem in OSPF routing

Ericsson, M.; Resende, M. & Pardalos, P.


ERP02 A Genetic Algorithm for the Weight Setting Problem

in OSPF Routing

Ericsson, M.; Resende, M. & Pardalos, P.

J. Combinatorial Optimization , Vol. 6 , pp. 299-333 , 2002

url



E94 MBONE -- The multicast backbone

Eriksson, H.


erkut1 Modeling of transport risk for hazardous materials

Erkut, E. & Verter, V.


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.


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


ErlebachRueegg04



Optimal Bandwidth Reservation in Hose-Model VPNs with Multi-Path Routing

Erlebach, T. & Rüegg, M.

2004

erls03 On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements

Erlebach, T. & Stefanakos, S.

STACS 2003: 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003. Proceedings , Vol. 2607 , pp. 133-144 , 2003

Er78 A Dual-based Procedure for Uncapacitated Facility Location

Erlenkotter, D.


Erlenkotter A Dual-Based Procedure for Uncapacitated Facility Location

Erlenkotter, D.


Er69 Preinvestment Planning for Capacity Expansion: A Multi-Location Dynamic Model

D. Erlenkotter

Stanford University , 1969

ergane86 Stochastic programming problems with incomplete information on distribution functions

Ermoliev, Y.; A.~Gaivoronski & C.~Nedeva

SIAM J.Control and Optimization , Vol. 23 , pp. 697-716 , 1986

Esbensen



Computing near-optimal solutions to the Steiner problem in a graph using a genetic algorithm

Esbensen, H.

Networks , Vol. 26 , pp. 173-185 , 1995

Esbensen89 Computing Near-Optimal Solutions to the Steiner Problem in a Graph Using a Genetic Algorithm

Esbensen, H.

Networks , Vol. 26 , pp. 173-185 , 1995

des76-1 Augmentation problems

Eswaran, K. & Tarjan, R.


etzion91 New lower bounds for asymmetric and undirectional codes

Etzion, T.


eo98 Greedy and heuristic algorithms for codes and colorings

Etzion, T. & Österg}rd, P.R.J.


Ev76 Derivation and analysis of some models for combining trip distribution and assignment

Evans, S.


Even84 On the NP-completeness of certain network testing problems



Even, S.; Goldreich, O.; Moran, S. & Tong, P.

Networks , Vol. 14 , pp. 1-24 , 1984

EvenItaiShamir76 On the complexity of timetable and multicommodity flow problems

Even, S.; Itai, A. & Shamir, A.


Everett Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources

Everett, H.


Ev63 Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources

Everett, H.


EysterWhite Some properties of the squared Euclidean distance location problem

Eyster, J.W. & White, J.A.


BaLa2001 Branch and cut based on the volume algorithm: Steiner trees in graphs and Max-Cut

F.~Barahona & L.~Ladányi

2001

BA2000 The volume algorithm: producing primal solutions with the subgradient method

F.~Barahona & R.~Anbil




CLS2003 Optimal Rectangular Partitions

F.~Calheiros; A.~Lucena & Souza, C.

Networks , Vol. 41 , pp. 51-67 , 2003

facchinei1 On the Identification of Zero Variables in an Interior-Point Framework

Facchinei, F.; Fischer, A. & Kanzow, C.


facchinei2 Finite-dimensional variational inequalities and complementarity problems: volumes I and II

Facchinei, F. & Pang, J.


FakcharoenpholRaoTalwar04 A tight bound on approximating arbitrary metrics by tree metrics

Fakcharoenphol, J.; Rao, S. & Talwar, K.

Journal of Computer and System Sciences , Vol. 69 , pp. 485–-497 , 2004

Fa69 Lagrange multipliers and nonconvex programs

Falk, J.E.


FaSo69 An Algorithm for Separable Nonconvex Programming Problems

Falk, J. & Soland, R.


falkner1



A computational study of graph partitioning

Falkner, J.; Rendl, F. & Wolkowicz, H.


Fal The Java Theory

Fallows, J.

The Atlantic Online, The Atlantic Monthly/Digital Edition , 1996

fff On power-law relationships of the Internet topology

Faloutsos, M.; Faloutsos, P. & Faloutsos, C.

Proceedings of the ACM-SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication , pp. 251-262 , 1999

FampaMaculan04 Using a conic formulation for finding Steiner minimal trees

Fampa, M. & Maculan, N.

Numerical Algorithms , Vol. 35 , pp. 315–-330 , 2004

05jso Enabling subwavelength level traffic grooming in survivable WDM optical network design

Fang, J. & Somani, A.


FangCaiDeng03 Total balancedness condition for Steiner tree games

Fang, Q.; Cai, M. & Deng, X.


FangLiuyGuibaszZhao04 RoamHBA: Maintaining Group Connectivity In Sensor Networks



Fang, Q.; Liuy, J.; Guibasz, L. & Zhao, F.

2004

fang:99 Inter-AS Traffic Patterns and Their Implications

Fang, W. & Peterson, L.

Proc. IEEE Global Internet , 1999

fang04 Fair bandwidth sharing algorithms based on game theory frameworks for wireless ad-hoc networks

Fang, Z. & Bensaou, B.

Proceedings of the IEEE Infocom , 2004

FantauzziGaivoronskiMessina97 Decomposition methods for network optimization problems in the presence of uncertainty

Fantauzzi, F.; Gaivoronski, A. & E.~Messina

Vol. 450 , pp. 234-248 , 1997

farias6 Semi-Continuous Cuts for Mixed-Integer Programming

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.

url



2005

Faal93 A primal partitioning solution for the arc-chain formulation of a multicommodity network flow problem

Farvolden, J.; Powell, W. & Lustig, I.


faybusovich8 Self-concordant barriers for cones generated by Chebyshev systems

Faybusovich, L.

2001

faybusovich9 On the Nesterov approach to semi-infinite programming

Faybusovich, L.

2001

faybusovich5 Euclidean Jordan algebras and generalized affine-scaling vector fields

Faybusovich, L.

1998

faybusovich6 A Jordan-algebraic approach to potential-reduction algorithms

Faybusovich, L.

1998

faybusovich2 Infinite-dimensional semidefinite programming: regularized determinants and self-concordant barriers

Faybusovich, L.

1996

url

url

url

url

url



faybusovich3 Semidefinite programming: A path-following algorithm for a linear-quadratic functional

Faybusovich, L.


faybusovich4 Linear systems in Jordan algebras and primal-dual interior-point algorithms

Faybusovich, L.

1996

faybusovich1 Jordan algebras, Symmetric cones and Interior-point methods

Faybusovich, L.

1995

faybusovich7 A long-step primal-dual algorithm for the symmetric programming problem

Faybusovich, L. & Arana, R.

1999

faybusovich10 Primal-dual algorithms and infinite-dimensional Jordan algebras of finite rank

Faybusovich, L. & Tsuchiya, T.


Usama-M.-Fayyad96 From data mining to knowledge discovery: An overview

Fayyad, U.M.; Piatetsky-Shapiro, G. & Smyth, P.

pp. 1-30 , 1996

rcp

url

url

url



The Case for Separating Routing from Routers

Feamster, N.; Balakrishnan, H.; Rexford, J.; Shaikh, A. & van der Merwe, J.

Proc. ACM SIGCOMM Workshop on Future Directions in Network Architecture , 2004

Feamster2003e Guidelines for Interdomain Traffic Engineering

Feamster, N.; Borkenhagen, J. & Rexford, J.

ACM SIGCOMM Computer Communication Review , Vol. 33 , 2003

whatif A Model of BGP Routing for Network Engineering

Feamster, N.; Winick, J. & Rexford, J.

Proc. ACM SIGMETRICS , 2004

F98 A Threshold of $ n$ for Approximating Set Cover

Feige, U.


fg1 Interactive proofs and the hardness of approximating cliques

Feige, U.; Goldwasser, S.; Lovász, L.; Safra, S. & Szegedy, M.


fk Zero knowledge and the chromatic number

Feige, U. & Kilian, J.

Journal of Computer and System Sciences , Vol. 57 , pp. 187-199 , 1998

feige2 On the optimality of the random hyperplane rounding technique for MAX CUT

Feige, U. & Schechtman, G.

url




feige1 Approximating the value of two prover proof systems, with

applications to MAX 2SAT and MAX DICUT

Feige, U. & Goemans, M.X.

Proceedings of the Third Israel Symposium on

Theory of Computing and Systems

, 1995

Feal66 Warehouse Location Under Continuous Economies of Scale

Feldman, E.; Lehrer, F. & Ray, T.


FeLeRa66 Warehouse Location Under Continuous Economies of Scale

Feldman, E.; Lehrer, F. & Ray, T.


netscope:00 NetScope: Traffic Engineering for IP Networks

Feldmann, A.; Greenberg, A.; Lund, C.; Reingold, N. & Rexford, J.


Feldman-ToN Deriving traffic demands for operational IP networks: methodology and experience

Feldmann, A.; Greenberg, A.; Lund, C.; Reingold, N.; Rexford, J. & True, F.


feldmann:01 Deriving Traffic Demands for Operational IP Networks: Methodology and



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.


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.




fr Greedy randomized adaptive search procedures

Feo, T.A. & Resende, M.G.C.


fr2 A greedy randomized adaptive search procedure for maximum independent set



feo0 A probabilistic heuristic for a computationally difficult set covering problem



FeoBarHol95a Facility-wide planning and scheduling of printed

wiring board assembly

Feo, T.; Bard, J. & Holland, S.


FeoBar89a Flight scheduling and maintenance base planning

Feo, T. & Bard, J.


FeoBar89b The cutting path and tool selection problem

in computer-aided process planning

Feo, T. & Bard, J.

pdf url

pdf url

pdf url



Journal of Manufacturing Systems , Vol. 8 , pp. 17-26 , 1989

FeoGon95a The intermodal trailer assignment problem: Models,

algorithms, and heuristics

Feo, T. & González-Velarde, J.


FeoRes89a A probabilistic heuristic for a computationally

difficult set covering problem

Feo, T. & Resende, M.


Feo94 A greedy randomized adaptive search procedure for maximum independent set

Feo, T.; Resende, M. & Smith, S.


FeoResSmi94a A greedy randomized adaptive search procedure for

maximum independent set

Feo, T.; Resende, M. & Smith, S.


FeoSarMcG96a A GRASP for single machine scheduling with

sequence dependent setup costs and linear delay

penalties

pdf url

pdf url

pdf url



Feo, T.; Sarathy, K. & McGahan, J.


FeoVenBar91a A GRASP for a difficult single machine

scheduling problem

Feo, T.; Venkatraman, K. & Bard, J.


Feremans01 Generalized Spanning Trees and Expansions

C. Feremans

Université Libre de Bruxelles, Institut de Statistique et de Recherche Opérationelle , 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

Fernández, E. & Mart, R.


fernandez1 On the undirected rural postman problem: tight bounds based on a new

pdf url



formulation

Fernández, E.; Meza, O.; Garfinkel, R. & Ortega, M.


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.


fer01 On the Design of Multifiber WDM Network

Ferreira, A.; Pérennes, S.; Richa, A.; Rivano, H. & Stier, N.

2001

FerreiraEtAl03 Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks

Ferreira, A.; Pérennes, S.; Rivano, H.; Richa, A. & Moses, N.


ferreira2



The node capacitated graph partitioning problem: a computational study

Ferreira, C.E.; Martin, A.; de Souza, C.C.; Weismantel, R. & Wolsey, L.A.


ferreira3 The node capacitated graph partitioning problem: formulations and valid inequalities

Ferreira, C.E.; Martin, A.; de Souza, C.C.; Weismantel, R. & Wolsey, L.A.


ferreira1 Solving multiple knapsack problems by cutting planes

Ferreira, C.E.; Martin, A. & Weismantel, R.


FerreiraFilho04 Some Formulations for the Group Steiner Tree Problem

Ferreira, C. & Filho, F.d.O.

Electronic Notes in Discrete Mathematics , Vol. 18 , pp. 127–-132 , 2004

FeLu03 Discrete capacity and flow assignment algorithms with performance guarantee

Ferreira, R. & Luna, H.


FerreiraLuna2003 Discrete capacity and flow assignment algorithms with performance guarantee

Ferreira, R. & Luna, H.


ferris13 Mathematical programs with equilibrium constraints: automatic reformulation and solution via constrained optimization

url



Ferris, M.C.; Dirkse, S.P. & Meeraus, A.

2002

ferris7 Expressing complementarity problems in an algebraic modeling language and communicating them to solvers

Ferris, M.C.; Fourer, R. & Gay, D.M.


ferris4 Partitioning mathematical programming problems for parallel solution

Ferris, M.C. & Horn, J.D.


ferris8 Feasible descent algorithms for mixed complementarity problems

Ferris, M.C.; Kanzow, C. & Munson, T.S.


ferris14 An optimization approach for radiosurgery treatment planning

Ferris, M.C.; Lim, J. & Shepard, D.M.


ferris10 Interior point methods for massive support vector machines

Ferris, M.C. & Munson, T.S.


ferris11 Semismooth Support Vector Machines


2000

url

url



ferris9 Modeling languages and Condor: metacomputing for optimization



ferris6 Linear programming for the emergency broadcast system


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.


FerPhi An interior point method for semi-infinite linear programming

Ferris, M.C. & Philpott, A.B.


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



University of Naples FEDERICO II , February 2000

Fes03a Greedy Randomized Search Procedure

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.


FesParRes01a Algorithm 815: FORTRAN Subroutines for

Computing Approximate Solution to Feedback Set

Problems using GRASP

Festa, P.; Pardalos, P. & Resende, M.


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.

pdf url

pdf url




festa2 An annotated bibliography of GRASP

Festa, P. & Resende, M.G.C.

2004

festa1 GRASP: An annotated bibliography

Festa, P. & Resende, M.G.C.

2001

FesRes01a GRASP: An annotated bibliography

Festa, P. & Resende, M.

pp. 325-367 , 2002

FesRes02a GRASP: An annotated bibliography


pp. 325-367 , 2002

FestaResende01bib GRASP: An annotated bibliography


pp. 325-367 , 2001

FiMcC Nonlinear Programming: Sequential Unconstrained Minimization Techniques

Fiacco, A.V. & McCormick, G.P.

John Wiley and Sons, New York , 1968

filipowski3 On the complexity of solving feasible linear programs specified with

url

url



approximate data

Filipowski, S.


filipowski2 On the complexity of solving sparse symmetric linear programs specified with approximate data

Filipowski, S.


filipowski1 On the complexity of solving feasible systems of linear inequalities specified with approximate data

Filipowski, S.


40fin A practical architecture for implementing end-to-end QoS in an IP network

Fineberg, V.


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.



1998

fischetti1 A branch-and-cut algorithm for the symmetric generalized traveling salesman problem

Fischetti, M.; González, J.J.S. & Toth, P.


fischetti5 Solving the orienteering problem through branch-and-cut

Fischetti, M.; Gonzalez, J.J.S. & Toth, P.


Fischetti:Jacur:Gonzalez Optimisation of the interconnecting network of a UMTS radio mobile telephone system

Fischetti, M.; Jacur, G. & González, J.


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.


fischetti6 Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control

Fischetti, M. & Salazar, J.J.




fischetti2 A branch-and-cut algorithm for the capacitated vehicle routing problem on directed graphs

Fischetti, M.; Toth, P. & Vigo, D.


fischetti3 A branch-and-cut algorithm for the resource-constrained minimum-weight arboresence problem

Fischetti, M. & Vigo, D.

Networks , Vol. 29 , pp. 55-67 , 1997

fishburn1 Induced binary probabilities and the linear ordering polytope: A status report

Fishburn, P.C.


fisher2 Optimal solution of vehicle routing problems using minimum K-trees

Fisher, M.L.


fisher1 Vehicle routing with time windows: Two optimization algorithms

Fisher, M.L.; Jörnsten, K.O. & Madsen, O.B.G.


Fi85 An Application Oriented Guide to Lagrangean Relaxation

Fisher, M.




Fi81 The Lagrangean Relaxation Method for Solving Integer Programming Problems

Fisher, M.


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.


Fisher Optimal Solution of Scheduling Problems Using Lagrangian Multipliers: Part I

Fisher, M.


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.


Fial78b An Analysis of Approximations for Maximizing Submodular Set Functions



II



FiNeWo78a An Analysis of Approximations for Maximizing Submodular Set Functions I



FiNeWo78b An Analysis of Approximations for Maximizing Submodular Set Functions II



Fial75 Using Duality to Solve Discrete Optimization Problems: Theory and Computational Experience

Fisher, M.; Northup, W. & Shapiro, F.


FiNoSh75 Using Duality to Solve Discrete Optimization Problems: Theory and Computational Experience

Fisher, M.; Northup, W. & Shapiro, F.


Fisher:Northup:Shapiro Using Duality to Solve Discrete Optimization Problems: Theory and Computational Experience

Fisher, M.; Northup, W. & Shapiro, J.


Fisher:Shapiro



Constructive Duality in Integer Programming

Fisher, M. & Shapiro, J.

SIAM J. Applied Mathematics , Vol. 27 , pp. 31-52 , 1974

Fishman89 Estimating the s-t reliability function using importance and stratified sampling

Fishman, G.


Fishman87 A Monte Carlo sampling plan for estimating reliability parameters and related functions

Fishman, G.

Networks , Vol. 17 , pp. 169-86 , 1987

Fishman86 A Monte Carlo sampling plan for estimating network reliability

Fishman, G.


Fishman86b A comparison of four Monte Carlo methods for estimating the probability of s-t connectedness

Fishman, G.


Fl90 Fiber Network Survivability

Flanagan, T.


fleischer2 Separating maximmaly violated comb inequalities in planar graphs



Fleischer, L. & Tardos, &.


fleischer1 Efficient continuous-time dynamic network flow algorithms

Fleischer, L. & Tardos, &.


fleischerW2 Fast and simple approximation schemes for generalized flow

Fleischer, L. & Wayne, K.D.


fle00 Approximating fractional multicommodity flow independent of the number of commodities

Fleischer, L.

SIAM J. Discrete Math. , Vol. 13 , 2000

fletcher3 Stable reduced Hessian updates for indefinite quadratic programming

Fletcher, R.


fletcher4 Practical Methods of Optimization, 2nd Edition

Fletcher, R.

John Wiley , 2000

fletcher8 Global convergence of a trust-region SQP-filter algorithm for general nonlinear progamming

Fletcher, R.; Gould, N.I.M.; Leyffer, S.; Toint, P.L. & Wächter, A.




fletcher9 Solving mathematical programs with complementarity constraints as nonlinear programs

Fletcher, R. & Leyffer, S.


fletcher7 Numerical experience with solving MPECs as NLPs


2002

fletcherL1 Nonlinear programming without a penalty function



fletcher5 A bundle filter method for nonsmooth nonlinear optimization


1999

fletcher2 Numerical experience with lower bounds for MIQP branch-and-bound



fletcher6 Local convergence of SQP methods for Mathematical Programs with Equilibrium Constraints

Fletcher, R.; Leyffer, S.; Ralph, D. & Scholtes, S.

2002

fleten1 The performance of stochastic dynamic and fixed mix portfolio

url

url

url

url

url



models

Fleten, S.; H}yland, K. & Wallace, S.W.


FleGlo99 Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory

Fleurent, C. & Glover, F.


FleGlo99a Improved constructive multistart strategies

for the quadratic assignment problem using

adaptive memory

Fleurent, C. & Glover, F.


fliege1 An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems

Fliege, J.

2004

fliege2 A multicriteria approach to bilevel optimization

Fliege, J. & Vicente, L.N.

2003

flippo1 Duality and sensitivity in quadratic optimization over a sphere

Flippo, O.E. & Jansen, B.

1992

url

url



Floren A note on "A faster approximation algorithm for the Steiner problem in graphs"

Floren, R.


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

Floudas, C.A.

1999

floudas6 Deterministic global optimization: theory, methods and applications

Floudas, C.A.


floudas4 Global optimization in design and control of chemical process systems

Floudas, C.A.

Proceedings of DYCOPS-5 on Dynamics and Control of Process Systems , pp. 167-178 , 1998

url

url



floudas2 Nonlinear and Mixed Integer Optimization

Floudas, C.A.


FlAg A decomposition strategy for global optimum search in the pooling problem

Floudas, C.A. & Aggarwal, A.


floudas5 Handbook of test problems in local and global optimization

Floudas, C.A.; Pardalos, P.M.; Adjiman, C.; Esposito, W.R.; Gümüs, Z.H.; Harding, S.T.; Klepeis, J.L.; Meyer, C.A. & Schweiger, C.A.


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.


FloydJacobson1995 Link sharing and resource management models for packet networks

Floyd, S. & Jacobson, V.


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



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. 1895-1898 , 2002

ForFul62 Flows in Networks

Ford, L. & Fulkerson, D.


F56 Network Flow Theory

Ford, L.

1956

FoFu62 Flows in Networks



Ford:Fulkerson_1958 A suggested computation for maximal multicommodity network flows



For56a Network Flow Theory

Ford, L.J.



1956

Forrest:Hirst:Tomlin Practical solution of large mixed integer programming problems with UMPIRE

Forrest, J.; Hirst, J. & Tomlin, J.


forsgren3 Optimality conditions for nonconvex semidefinite programming

Forsgren, A.


forsgren1 Primal-dual interior point methods for nonconvex nonlinear programming

Forsgren, A. & Gill, P.E.


forsgren5 Interior methods for nonlinear optimization

Forsgren, A.; Gill, P.E. & Wright, M.H.


forsgren2 Newton methods for large-scale linear inequality-constrained minimization

Forsgren, A. & Murray, W.


FP02 Dimensioning multicast-enabled communications networks

Forsgren, A. & Prytz, M.

Networks , Vol. 39 , pp. 216-231 , 2002

url

url



forsgren4 On weighted linear least-squares problems related to interior methods for convex quadratic programming

Forsgren, A. & Sporre, G.

2000

forsythe On the stationary values of a second degree polynomial on the unit sphere

Forsythe, G.E. & Golub, G.H.

SIAM J. on Applied Mathematics , Vol. 13 , pp. 1050-1068 , 1965

fortin1 The trust region subproblem and semidefinite programming

Fortin, C. & Wolkowicz, H.


fortz02:reliability On the evaluation of the reliability of OSPF routing in IP networks

Fortz, B.

Proc. SSGRR 2002w International Conference - Advances

in Infrastructure for e-Business, e-Education, e-Science,

and e-Medicine on the Internet

, 2002

fortz00:design Design of Survivable Networks with Bounded Rings

Fortz, B.


des98-3 Design of survivable networks with bounded rings

B. Fortz

Université Libre de Bruxelles, Service de Mathématiques de la Gestion , 1998

url



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.


FL02 Polyhedral results for two-connected networks with bounded rings



FL02a Two-connected networks with rings of bounded cardinality


2002

des99-1 Structural results for two-connected networks with rings

of bounded cardinality


1999

des99-2 Facets for the polyhedron of two-connected networks

with bounded rings




1999

des99-3 Exact and heuristic algorithms for the design of

survivable networks with bounded rings


1999

des95-1 Two-Connected Networks with

Bounded Meshes (Extended abstract)

Fortz, B.; Labbé, M.; Maffioli, F. & Värbrand, P.

1995

des97-2 Methods for designing reliable networks with bounded meshes

Fortz, B.; Labbé, M. & Maffioli, F.

Teletraffic Contributions for the Information Age , Vol. 2a , pp. 341-350 , 1997

fortzL1 Polyhedral results for two-connected networks with bounded rings

Fortz, B. & Labbè, M.

Mathematical Programming , Vol. 93 , 2002

FoLa02 Polyhedral Results for Two-Connected Networks with Bounded Rings

Fortz, B. & Labbe, M.


des00-1 Solving the two-connected network with bounded meshes problem

url





des96-1 Solving the two-connected network with bounded meshes problem



tcbr A branch-and-cut algorithm for designing reliable

networks with bounded rings


FoLaMa00 Solving the two-connected network with bounded meshes problem



FortzLabbeMaffioli00 Solving the two-connected network with bounded meshes problem

Fortz, B.; M.~Labbé & F.~Maffioli


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.




FortzRexfordThorup2002 Traffic engineering with traditional IP routing protocols



FRT02 Traffic Engineering with Traditional IP Routing Protocols



ospfte Traffic Engineering with Traditional IP Routing Protocols



fortz03:rings A Tabu Search Algorithm for Self-Healing Ring Network Design

Fortz, B.; Soriano, P. & Wynants, C.


FoSoWy00 A Tabu Search Algorithm for Self-Healing Ring Network Design

Fortz, B.; Soriano, P. & Wynants, C.


fortzT2 Increasing Internet Capacity Using Local Search

Fortz, B. & Thorup, M.

Computational Optimization andApplications , Vol. 29 , pp. 13-48 , 2004

increasing Increasing Internet Capacity Using Local Search





FT03:inoc Robust optimization of OSPF/IS-IS weights


Proc. INOC 2003 , pp. 225-230 , 2003

robust Robust Optimization of OSPF/IS-IS Weights


Proc. International Network Optimization Conference , pp. 225-230 , 2003

FortzThorup2002 Optimizing OSPF/IS-IS weights in a changing world



FT01 Optimizing OSPF/IS-IS Weights in a Changing World



thorup:02 Optimizing OSPF/IS-IS Weights in a Changing World



fortz Internet Traffic Engineering by Optimizing OSPF weights


Proc. IEEE INFOCOM 2000 -- The Conference on Computer Communications , pp. 519-528 , 2000



Fortz-Thorup Internet Traffic Engineering by optimizing OSPF Weights


Proc. 19th IEEE Conference on Computer Communications (INFOCOM'2000) , pp. 519-528 , 2000

FORTZ1 Internet Traffic Engineering by Optimizing OSPF Weights


Proceedings of IEEE INFOCOM'00 , 2000

fortzT1 Increasing Internet Capacity Using Local Search


2000

FortzThorup2000 Internet traffic engineering by optimizing OSPF weights



FT00 Internet Traffic Engineering by Optimizing OSPF Weights


Proc. 19th IEEE Conf. on Computer Communications (INFOCOM) , pp. 519-528 , 2000

thorup:00 Internet Traffic Engineering by Optimizing OSPF Weights


Proc. IEEE INFOCOM , 2000

des94-3 Heuristics for the Optimum 2-Connected

Spanning Subgraph Problem with Cycle Constraints




1994

FM93 A simple distributed autonomous power control algorithm and its convergence

Foschini, G. & Milzanic, Z.

IEEE Trans. Veh. Techn. , Vol. 40 , pp. 641-646 , 1993

Fou92 Graph theory applications

Foulds, L.


fourer2 Numerical Issues and Influences in the Design of Algebraic Modeling Languages for Optimization

Fourer, R. & Gay, D.M.

Proceedings of the 20th Biennial Conference on Numerical Analysis , 2003

fourer1 AMPL: A modeling language for mathematical programming

Fourer, R.; Gay, D.M. & Kernighan, B.W.

Thomson , 2003

Foal93 AMPL: A Modeling Language for Mathematical Programming

Fourer, R.; Gay, D. & Kernighan, B.

Scientific Press , 1993

fourer3 LPFML: A W3C XML Schema for Linear Programming

Fourer, R.; Lopes, L.B. & Martin, K.

2004

url

url



fox2 Faster simulated annealing

Fox, B.L.


fox1 Integrating and accelerating tabu search, simulated annealing, and genetic algorithms

Fox, B.L.


fragniere1 Structure exploiting tool in algebraic modeling languages

Fragniere, E.; Gondzio, J.; Sarkissian, R. & Vial, J.

1997

fragniere2 Building and Solving Large-scale Stochastic Programs on an Affordable Distributed Computing System

Fragniere, E.; Gondzio, J. & Vial, J.


Fraley1 Linear updates in a single-phase projective method

Fraley, C.


Fraley2 Alternative approaches to feasibility in projective methods for linear programming

Fraley, C. & Vial, J.P.

ORSA Jounal on Computing , Vol. 4(3) , pp. 285-299 , 1992

FrLu82 Solving Stochastic Transportation-Location Problem by Generalized

url

url



Benders Decomposition

França, P. & Luna, H.


FrancisMcginnisWhite Facility Layout and Location: An Analytical Approach

Francis, R.L.; McGinnis, L.F. & White, J.A.


FrancisWhite Facility Layout and Location: An Analytical Approach

Francis, R.L. & White, J.A.


FMcGW92 Facility Layout and Location: An Analytical Approach

Francis, R.; McGinnis Jr., L. & White., J.


FrMcWh83 Locational Analysis

Francis, R.; McGinnis, L. & White, J.


franconi1 Microaggregation and model based methods for disclosure limitation and their application to business microdata

Franconi, L. & Stander, J.

2000

frangioni1 A bundle type dual-ascent approach to linear multicommodity min-cost flow problems

Frangioni, A. & Gallo, G.

url



INFORMS Jounal on Computing , Vol. 11(4) , pp. 370-393 , 1999

des92-5 Augmenting graphs to meet edge-connectivity requirements

Frank, A.

SIAM J. on Discrete Mathematics , Vol. 5 , pp. 22-53 , 1992

frank2 Directed vertex-connectivity augmentation

Frank, A. & Jordan, T.


frank1 Minimal edge-coverings of pairs of sets

Frank, A. & Jordan, T.

Journal of Combinatorial Theory, Series B , Vol. 65 , pp. 73-110 , 1995

FWB85 Multicast communication on network computers

Frank, A.; Wittie, L. & Bernstein, A.

IEEE Software , Vol. 2 , pp. 49-61 , 1985

des70-2 Connectivity considerations in the design of

survivable networks

Frank, H. & Chou, W.


fraw56 An algorithm for quadratic programming

Frank, M. & Wolfe, P.




FW56 An algorithm for quadratic programming

Frank, M. & Wolfe, P.


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.


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.


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.



Networks , Vol. 3 , pp. 97-133 , 1973

Fra73 The flow deviation method. An approach to store-and-forward communication network design

Fratta, L.; Gerla, M. & Kleinrock, L.

Networks , Vol. 3 , pp. 97-133 , 1973

fragk73 The flow deviation method: an approach to store-and-forward computer-communication network design


Networks , Vol. 3 , 1973

FrattaGerlaKleinrock1973 The flow deviation method: An approach to store-and-forward computer communication network design


Networks , Vol. 3 , pp. 97-133 , 1973

frauendorfer1 Barycentric scenario trees in convex multistage stochastic programming

Frauendorfer, K.


des82-1 On the relationship between the biconnectivity

augmentation and traveling salesman problems

Frederickson, G. & Já Já, J.


des81-2 Approximation algorithms for se-ve-ral graph

augmentation problems



Frederickson, G. & Já Já, J.


FreTar87a Fibonacci heaps and their uses in improved networkoptimization algorithms

Fredman, M. & Tarjan, R.


frenk1 An interior point subgradient method for linearly constrained nondifferentiable convex programming

Frenk, H.; Sturm, J. & Zhang, S.


freund8 Complexity of Convex Optimization using Geometry-based Measures and a Reference Point

Freund, R.M.


freund7 On the Primal-Dual Geometry of Level Sets in Linear and Conic Optimization

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.


Freund180 Projective transformations for interior--point algorithms,

url

url

url



and a superlinearly convergent algorithm for the w--center problem

Freund, R.M.


Freund3559 An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution

Freund, R.M.

1993

Freund1 Theoretical efficiency of a shifted-barrier-function algorithm for linear programming

Freund, R.M.


Freund182 Polynomial Algorithms for Linear Programming Based only on Primal Scaling and Projected Gradients of a Potential Function

Freund, R.M.


Freund201 A potential--function reduction algorithm for solving a linear

program directly from an infeasible ``warm start''

Freund, R.M.


Freund179 Projective Transformations for Interior Point Methods, Part I: Basic Theory and Linear Programming

Freund, R.M.

1988



freund2 Interior Point Methods: Current Status and Future Directions

Freund, R.M. & Mizuno, S.

Optima , Vol. 51 , pp. 1-9 , 1996

freund4 On the complexity of four polyhedral set containment problems

Freund, R.M. & Orlin, J.B.


Freund192 A Method for the Parametric Center Problem, with a Strictly Monotone Polynomial-Time Algorithm for Linear Programming

Freund, R.M. & Tan, K.


freund3 Condition-based complexity of convex optimization in conic linear form via the ellipsoid algorithm

Freund, R.M. & Vera, J.


freund5 Measures of a conic linear system

Freund, R.M. & Vera, J.R.

1999

freund6 Some charactirizations and properties of the ``distance to ill-posedness'' and the condition measure of a conic linear system

Freund, R.M. & Vera, J.R.


rwfreund4

url

url

url

url



Solving the Sum-of-Ratios Problem by an Interior-Point Method

Freund, R.W. & Jarre, F.

1999

rwfreund3 A QMR-based interior-point algorithm for solving linear programs



rwfreund1 An Interior-Point Method For Multifractional Programs With Convex Constraints


Journal Of Optimization Theory And Applications , Vol. 85 , pp. 125-161 , 1995

rwfreund5 An interior-point method for fractional programs with convex constraints



rwfreund2 Convergence of a Class of Inexact Interior-Point Algorithms for Linear Programs

Freund, R.W.; Jarre, F. & Mizuno, S.


rwfreund6 On self-concordant barrier functions for conic hulls and fractional programming

Freund, R.W.; Jarre, F. & Schaible, S.


Freud97 A decision-theoretic generalization of on-line learning and an application to boosting

url



Freund, Y. & Schapire, R.E.


FridenA89 STABULUS: A technique for finding stable sets in large graphs with tabu search

Friden, C.; Hertz, A. & de Werra, D.

Computing , Vol. 42 , pp. 35-44 , 1989

FriHorProStrStr03a The footprint sorting problem

Fried, C.; Hordijk, W.; Prohaska, S.; Stradler, C. & Stradler, P.

2003

frieze On the independence number of random graphs

Frieze, A.


frieze1 Improved approximation algorithms for MAX $k$-CUT and MAX BISECTION

Frieze, A. & Jerrum, M.

Proceedings of the Fourth IPCO Conference , pp. 1-13 , 1995

fmc Algorithmic theory of random graphs

Frieze, A. & McDiarmid, C.


fm Broadcasting in random graphs

Frieze, A. & Molloy, M.




Fri83 Complexity of a 3-dimensional assignment problem

Frieze, A.


FriIanMag94 A wavelength-division-multiplexed passive optical network with cost-shared 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.


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.


fujie1



Relaxation by semidefinite programs

Fujie, T. & Kojima, M.

1995

FC99 The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic Multicast Trees

Fujinoki, H. & Christensen, K.

24th Conference on Local Computer Networks , pp. 204-211 , 1999

fujisawa3 Numerical evaluation of SDPA (Semidefinite Programming algorithm)

Fujisawa, K.; Fukuda, M.; Kojima, M. & Nakata, K.

1997

fujisawa4 Preprocessing sparse semidefinite programs via matrix completion

Fujisawa, K.; Fukuda, M. & Nakata, K.

2004

fujisawa2 Exploiting Sparsity in Primal-Dual Interior-Point Methods for Semidefinite Programming

Fujisawa, K.; Kojima, M. & Nakata, K.

1997

fujisawa1 SDPA (Semidefinite Programming Algorithm)

Fujisawa, K.; Kojima, M. & Nakata, K.

1996

Fujishige-Yang-2003 A note on Kelso and Crawford's gross substitutes condition

url

url

url

url



Fujishige, S. & Yang, Z.


fukuda1 On the existence of a short admissible pivot sequences for feasibility and linear optimization problems

Fukuda, K. & Terlaky, T.

1999

fukuda3 Interior-Point Methods for Lagrangian Duals of Semidefinite Programs

Fukuda, M. & Kojima, M.

2000

fukuda2 Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework

Fukuda, M.; Kojima, M.; Murota, K. & Nakata, K.


fukuda4 Lagrangian dual Interior-Point Methods for Semidefinite Programs

Fukuda, M.; Kojima, M. & Shida, M.


Fukunaga90 Statistical pattern recognition

Fukunaga, K.


fukushima2 A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints

Fukushima, M.; Luo, Z. & Pang, J.S.

url

url

url

url




tseng28 A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization

Fukushima, M.; Luo, Z. & Tseng, P.

2001

tseng26 Smoothing Functions for Second-Order-Cone Complementarity Problems

Fukushima, M.; Luo, Z. & Tseng, P.

2000

fukushima1 An Implementable Active-Set Algorithm for Computing a B-Stationary Point of the Mathematical Program with Linear Complementarity Constraints

Fukushima, M. & Tseng, P.

1999

fulkerson1 Two computationally difficult set convering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems

Fulkerson, D.R.; Nemhauser, G.L. & Trotter Jr, L.E.


des71-1 Minimal (k)-arc connected graphs

Fulkerson, D. & Shapley, L.

Networks , Vol. 1 , pp. 91-98 , 1971

FumBalVal98 Optimal Amplifier Placement in Multi-Wavelength Optical Network Based on Simulated Annealing

Fumagalli, A.; Balestra, G. & Valcarenghi, L.

url

url

url



SPIE International Symposium on Voice, Video, and Data Communications , Vol. 3531 , pp. 268-279 , 1998

Fumagalli:Cerutti:Tacca Optimal design of survivable mesh networks based on line switched WDM self-healing rings

Fumagalli, A.; Cerutti, I. & Tacca, M.


fum99 Survivable Networks Based on Optimal Routing and WDM Self-healing Rings

Fumagalli, A.; Cerutti, I.; Tacca, M.; Masetti, F.; Jagannathan, R. & Alagar, S.

IEEE INFOCOM , Vol. 2 , pp. 726-733 , 1999

Fuma2000 IP Restoration vs. WDM Protection: Is There an Optimal

Choice?

Fumagalli, A. & Valcarenghi, L.


furman1 An exact parallel algorithm for the maximum satisfiability problem

Furman, J.

Mathematics Department, New Mexico Tech , 1996

FossmeierKaufmann Solving rectilinear Steiner tree problems exactly in theory and practice

Fö}meier, U. & Kaufmann, M.

Proceedings of the European Symposium on Algorithms , 1997

FossmeierKaufmannZelikovsky Faster approximation algorithms for the rectilinear Steiner tree problem



Fö}meier, U.; Kaufmann, M. & Zelikovsky, A.Z.

Proceedings of the 4th Annual International Symposium on Algorithms and Computation , Vol. ?? , pp. ?? , 1993

DahlFoldnesGouveia2003 A note on hop-constrained walk polytopes

G., D.; Foldnes, N. & Gouveia, L.

2003

DahlGouveia2003 On the directed hop-constrained shortest path problem

G., D. & Gouveia, L.

Operations Research Letters , 2003

gunluk2 Vehicle routing and staffing for sedan service

Günlük, O.; Kimbrel, T.; Ladanyi, L.; Schieber, B. & Sorkin, G.B.

2004

gunluk1 Mixing mixed-integer inequalities

Günlük, O. & Pochet, Y.


guler7 On the Self-Concordance of the Universal Barrier Function

Güler, O.


guler8 Hyperbolic Polynomials and Interior Point Methods for Convex Programming

Güler, O.


url



guler4 Barrier functions in interior point methods

Güler, O.

Mathemtics of Operations Research , Vol. 21 , pp. 860-885 , 1996

guler5 Limiting behavior of weighted central paths in linear programming

Güler, O.


guler9 Ergodic convergence in proximal point algorithms with Bregman functions

Güler, O.

pp. 155-165 , 1994

guler6 Characterization of the Barrier Parameter of Homogeneous Convex Cones

Güler, O. & Tunçel, L.


GulerYe Convergence behaviour of interior point algorithms

Güler, O. & Ye, Y.


gomez1 Solving some special cases of Inexact Linear Programming problems via cutting plane methods

Gómez, W. & Gómez, J.A.

2004

Gabowetal Efficient algorithms for finding minimum spanning trees in undirected

url



and directed graphs

Gabow, H.; Galil, Z.; Spencer, T. & Tarjan, R.


des93-6 An efficient approximation algorithm for the

survivable network design problem

Gabow, H.; Goemans, M. & Williamson, D.

Proceedings of the Third MPS Conference on Integer

Programming and Combinatorial Optimization

, pp. 57-74 , 1993

gabknimin03a A comparison of heuristics for the discrete cost multicommodity network optimization problem

Gabrel, V.; Knippel, A. & Minoux, M.


gabknimin03b Exact solution of survivable network problems with step-increasing cost functions


2003

gabknimin00 Exact solution of survivable network problems with step-increasing cost functions


ALGOTEL 2 , 2000

gabknimin99 Exact solution of multicommodity network optimization problems with general step cost functions





gabrel1 Exact solution of multicommodity network optimization problems with general step cost functions



Gabrel:Knippel:Minoux Exact solution of multicommodity network optimization problems with general step cost functions



GabKniMin03 A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem

Gabrel, V.; Knippel,; A. & Minoux, M.


gabmin97 LP relaxations better than convexification for multicommodity network optimization problems with step-increasing cost functions

Gabrel, V. & Minoux, M.

Acta Mathematica Vietnamica 22 , pp. 128-145 , 1997

gabmin96 Large scale LP relaxations for minimum cost multicommodity network flow problems with step-increasing cost functions and computational results

Gabrel, V. & Minoux, M.

1996

Gab99 Nonadditive shortest paths



Gabriel, S. & Bernstein, D.

1999

Gab97 The traffic equilibrium problem with nonadditive costs

Gabriel, S. & Bernstein, D.


gai86lm Linearization methods for optimization of functionals which depend on probability measures

Gaivoronski, A.


gai88io Implementation of stochastic quasigradient methods

Gaivoronski, A.A.

pp. 313-352 , 1988

GalHao99 Hybrid evolutionary algorithms for graph coloring

Galinier, P. & Hao, J.


Gal77 A minimum delay routing algorithm using distributed computation

Gallager, R.


GHS83 A distributed algorithm for minimum-weight spanning trees

Gallager, R.; Humblet, P. & Spira, P.

ACM Trans. Programming Languages and Systems , Vol. 5 , pp. 66-77 , 1983



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. Eötvös 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.


gallo1 Network Optimization: Algorithms and Applications (Foreword)

Gallo, G. & Grigoriadis, M.D.


GalPal88a Shortest Path Methods

Gallo, G. & Pallottino, S.

Ann. Oper. Res. , Vol. 7 , pp. 3-79 , 1988

GalPal86a Shortest Path Methods: A Unified Approach




Math. Programming Study , Vol. 26 , pp. 38-64 , 1986

GalPal84a Shortest Path Methods in Transportation Models


pp. 227-256 , 1984

galluccio1 Optimization via enumeration: a new algorithm for the Max Cut problem

Galluccio, A.; Loebl, M. & Vondrák, J.


Gal00 A Polynomial-Time Approximation Scheme for Base Station Positioning in UMTS Networks

Galota, M.; Glasser, C.; Reith, S. & Vollmer, H.

Proceedings of the 5th International Workshop on

Discrete Algorithms and Methods for Mobile Computing and

Communications (DIAL-M)

, pp. 52-59 , 2001

gamache1 A column generation approach for large-scale aircrew rostering problems

Gamache, M.; Soumis, F.; Marquis, G. & Desrosiers, J.


gambardella1 An ant colony system hybridized with a new local search for the sequential ordering problem

Gambardella, L.M. & Dorigo, M.


GaRa82 On frequency assignment in mobile automatic telephone systems



Gamst, A. & Rave, W.

Proceedings of GLOBECOM'82 , pp. 309-315 , 1982

GanVanTuy98a A first making use of GRASP for solving MOCO problems

Gandibleux, X.; Vancoppenolle, D. & Tuyttens, D.

1998

Ganley Geometric Interconnection and Placement Algorithms

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


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


Proceedings of the Sixth Canadian Conference on Computational Geometry , pp. 308-313 , 1994

GanleyCohoonGreatLakes A faster dynamic programming algorithm for exact rectilinear Steiner minimal trees


Proceedings of the Fourth Great Lakes Symposium on VLSI , pp. 238-241 , 1994

pdf url



GanleyCohoonISCAS Routing a multi-terminal critical net: Steiner tree construction in the presence of obstacles


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.


Gao2001b Inherently Safe Backup Routing with BGP

Gao, L.; Griffin, T.G. & Rexford, J.


gao:01a Stable Internet Routing Without Global Coordination

Gao, L. & Rexford, J.


Gar01a Algorithmic approach for the single source capacitated

plant location problem

J.A. Daz Garca

Departamento d'Estadstica i Investigació Operativa,

Univarsitat Politécnica de Catalunya

, 2001

GarLozSmiGue01a A comparison of GRASP and an exact method for solving a production and delivery scheduling problem



Garca, J.; Lozano, S.; Smith, K. & Guerrero, F.

First International Workshop on Hybrid Intelligent Systems (HIS'01), Adelaide, Australia , 2001

garcia1 A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints

Garcia, B.; Potvin, J. & Rousseau, J.


GZ94 Area-based, loop-free Internet routing

Garcia-Luna-Aceves, J. & Zaumen, W.


gaw Clique-detection algorithms for matching three-dimensional molecular structures

Gardiner, E.; Artymiuk, P. & Willett, P.

Journal of Molecular Graphics and Modelling , Vol. 15 , pp. 245-253 , 1997

gwa00 Graph-theoretic techniques for macromolecular docking

Gardiner, E.; Willett, P. & Artymiuk, P.

J. Chem. Inf. Comput. , Vol. 40 , pp. 273-279 , 2000

GareyGrahamJohnson The complexity of computing Steiner minimal trees

Garey, M.R.; Graham, R.L. & Johnson, D.S.


gar79 Computers and Intractability: A Guide to the Theory of NP--Completeness

Garey, M.R. & Johnson, D.S.



Freeman, San Francisco , 1979

GareyJohnsonRST The rectilinear Steiner tree problem is NP-complete

Garey, M.R. & Johnson, D.S.


garey1 Some simplified NP-Complete graph problems

Garey, M.R.; Johnson, D.S. & Stockmeyer, L.


garjs76 Some simplified NP-complete graph problems

Garey, M.R.; Johnson, D.S. & Stockmeyer, L.

Theor. Computer Science , Vol. 1 , pp. 237-267 , 1976

gj76 The complexity of near-optimal coloring

Garey, M. & Johnson, D.


garfinkel1 Privacy protection of binary confidential data against deterministic, stochastic, and insider threat

Garfinkel, R.; Gopal, R. & Goes, P.


gark98 Faster and simpler algorithms for multicommodity flow and other fractional packing problems

Garg, N. & Könemann, J.

Proc. 39th Ann. Symp. on Foundations of Computer Science , 1998

GargEtAl00



A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem

Garg, N.; Konjevod, G. & Ravi, R.


GarHellPer97 Colouring Paths in Directed Symmetric Trees with Applications to WDM Routing

Gargano, L.; Hell, P. & Perennes, S.

Automata, Languages and Programming, 24th International Colloquium , Vol. 1256 , pp. 505-515 , 1997

GarVac00 Routing in All-Optical Networks: Algorithmic and Graph--Theoretic Problems

Gargano, L. & Vaccaro, U.

Numbers, Information and Complexity , pp. 555-578 , 2000

garille1 Stigler's diet problem revisited

Garille, S.G. & Gass, S.I.


DBLP:conf/antalg/GarlickB02 Dynamic Wavelength Routing in WDM Networks via Ant Colony Optimization.

Garlick, R. & Barr, R.

Ant Algorithms , pp. 250-255 , 2002

Ga80 Optimal traffic assignment with elastic demands: A review. Part I: Analysis framework, Part II: Algorithmic approaches

Gartner, N.


Ga77



Analysis and control of transportation networks by Frank-Wolfe decomposition

Gartner, N.

Proceedings of the 7th International Symposium on Transportation and Traffic Flow , pp. 591-623 , 1977

gatermann1 Symmetry groups, semidefinite programs, and sums of squares

Gatermann, K. & Parrilo, P.A.

2002

Gauthier:Ribiere Experiments in Mixed Integer Programming Using Pseudo-Costs

Gauthier, J. & Ribiere, G.


Gaviano2003 Algorithm 829: Software for generation of classes of test functions with known local and global minima for global optimization

Gaviano, M.; Kvasov, D.E.; Lera, D. & Sergeyev, Y.D.

ACM Transactions on Mathematical Software , Vol. 29 , 2003

Ga92 Topological Design of Computer Communication Networks - The Overall Design Problem

Gavish, B.


Gavish1992 Topological design of computer communication networks -- The overall design problem

Gavish, B.


Gavish92

url



Topological design of computer communication networks

Gavish, B.


Ga91 Topological Design of Telecommunication Networks - Local Access Design Methods

Gavish, B.


Gavish1991 Topological design of telecommunications networks -- Local access design methods

Gavish, B.


Gavish1985 Augmented Lagrangean based algorithms for centralized network design

Gavish, B.

IEEE Transactions on Communications , Vol. COM--33 , pp. 1247-1257 , 1985

Ga83 Formulations and Algorithms for the Capacitated Minimal Directed Tree

Gavish, B.


Ga82 Topological Design of Centralized Computer Networks - Formulations and Algorithms

Gavish, B.

Networks , Vol. 12 , pp. 355-377 , 1982

Gav82 Topological Design of Centralized Computer Networks - Formulations and Algorithms



Gavish, B.

Networks , Vol. 12 , pp. 355-377 , 1982

GaAl90 Backbone Network Design Tools with Economic Tradeoffs

Gavish, B. & Altinkemer, K.


GavishAltinkemer1990 Backbone network design tools with economic tradeoffs

Gavish, B. & Altinkemer, K.


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.


GavishNeuman1989 A system for routing and capacity assignment in computer communication networks

Gavish, B. & Neuman, I.


GavPir85 Efficient Algorithms for Solving Multiconstraint Zero-One Knapsack Problems to Optimality

Gavish, B. & Pirkul, H.




Gavril-1974 The intersection graphs of subtrees in trees are exactly the chordal graphs

Gavril, F.

Journal Combinatorial Theory B , Vol. 16 , pp. 47-56 , 1974

GawandeKlincewiczLuss1999 Design of SONET ring networks for local access

Gawande, M.; Klincewicz, J.G. & Luss, H.

Advances in Performance Analysis , Vol. 2 , pp. 159-173 , 1999

GaKlLu99 Design of SONET Ring Networks for Local Access

Gawande, M.; Klincewicz, J. & Luss, H.

Advances in Performance Analysis , Vol. 2 , pp. 159-173 , 1999

GFK93 AMPL (A Modeling Language for Mathematical Programming)

Gay, D.; Fourer, R. & Kernighan, B.

Scientific Press , 1993

Gay3 Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers

Gay, D.M.


Gay8911 Stopping tests that compute optimal solutions for interior-point linear programming algorithms

Gay, D.M.

1989

Gay1



A Variant of Karmarkar's Linear Programming Algorithm for Problems in Standard Form

Gay, D.M.


Gay2 Electronic mail distribution of linear programming test problems

Gay, D.M.

Mathematical Programming Society Committee on Algorithms Newsletter , Vol. 13 , pp. 10-12 , 1985

gay5 A primal-dual interior method for nonconvex nonlinear programming

Gay, D.M.; Overton, M.L. & Wright, M.H.

pp. 31-56 , 1998

Gencata:Mukherjee Virtual-topology adaptation for WDM mesh networks under dynamic traffic

Gençata, A. & Mukherjee, B.


gll95 Efficient heuristics for the design of ring networks

Gendreau, M.; Labbé, M. & Laporte, G.


GeLaLa95 Efficient Heuristics for the Design of Ring Networks

Gendreau, M.; Labbe, M. & Laporte, G.


GenLapMusTai99 A tabu search heuristic for the heterogeneous fleet vehicle routing

url



problem

Gendreau, M.; Laporte, G.; Musaraganyi, C. & Taillard, E.


gendreau1 A tabu search heuristic for the vehicle routing problem with stochastic demands and customers

Gendreau, M.; Laporte, G. & Séguin, R.


gendreau2 An exact algorithm for the vehicle routing problem with stochastic demands and customers



gendreau3 A tabu search heuristic for the vehicle routing problem



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.



Networks , Vol. 34 , pp. 162-172 , 1998

GendronCrainicFrangioni1999 Multicommodity capacitated network design

Gendron, B.; Crainic, T. & Frangioni, A.

1999

Gendron:Crainic Parallel branch-and-bound algorithms: survey and synthesis

Gendron, B. & Crainic, T.G.


Gendron:Crainic_1994 Parallel branch-and-bound algorithms: survey and synthesis

Gendron, B. & Crainic, T.


gencrafra99 Multicommodity capacitated network design

Gendron, B.; Crainic, T. & Frangioni, A.

Telecommunications Network Planning , pp. 1-19 , 1999

GenPotSor02a Diversification strategies in local search for a nonbifurcated network loading problem

Gendron, B.; Potvin, J. & Soriano, P.


Ge78 An Industrial Application of the Traveling

Salesman Subtour Problem

Gensch, D.




Geoffrion1974 Lagrangian relaxation for integer programming

Geoffrion, A.


geogra74 Multicommodity distribution system design by Benders decomposition

Geoffrion, A. & Graves, G.


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.


Ge72 Generalized Benders decomposition

Geoffrion, A.


Ge71 Duality in Nonlinear Programming

Geoffrion, A.




Ge70 Elements of large-scale mathematical programming

Geoffrion, A.


GeGr74 Multicommodity Distribution System Design by Benders Decomposition

Geoffrion, A. & Graves, G.


GeMa72 Integer Programming Algorithms: A Framework and State-of-the-Art Survey

Geoffrion, A. & Marsten, R.


GeMc78 Lagrangean Relaxation Applied to Capacitated Facility Location Problems

Geoffrion, A. & McBride, R.


Geoffrion:McBride Lagrangian Relaxation Applied to Capacitated Facility Location Problems

Geoffrion, A. & McBride, R.

AIIE Transaction , Vol. 10 , pp. 40-47 , 1978

GeorgakopoulosPapadimitriou The 1-Steiner tree problem

Georgakopoulos, G. & Papadimitriou, C.H.


GeHe



Solution of Sparse Linear Least Squares Problems Using Givens Rotations

George, J.A. & Heath, M.T.


george1 Computer Solution of Large Sparse Positive Definite Systems

George, J.A. & Liu, J.W.H.


GeNg2 Orthogonal Reduction of Sparse Matrices to Upper Triangular Form Using Householder Transformations

George, J.A. & Ng, E.G.Y.

SIAM Journal on Scientific and Statistical Computing , Vol. 7 , pp. 460-472 , 1986

GeNg3 Symbolic Factorization for Sparse Gaussian Elimination with Partial Pivoting


1984

GeNg4 SPARSPAK: Waterloo sparse matrix package user's guide for SPARSPAK-B


1984

GeNg1 On Row and Column Orderings for Sparse Least Squares Problems



Gerber03 Supply web co-ordination by an agent-based trading network with integrated logistics services



Gerber, A.; Russ, C. & Klusch, M.

Electronic Commerce research and Applications , Vol. 2 , pp. 133-146 , 2003

gerb Broadcasting in random graphs

Gerbessiotis, A.


Ge81 Routing and flow control

Gerla, M.

pp. 122-173 , 1981

Ger75 Approximations and bound for the topological design of distributed computer networks

Gerla, M.

4th Data Communications Symposium , Vol. 4 , pp. 9-15 , 1975

Ge73 The Design of Store-and-Forward (S/F) Networks for Computer Communications

M. Gerla

UCLA , 1973

ger73 The design of store-and-forward networks for computer communications

M. Gerla

School of Eng. and Appl. Sci., University of California, Los Angeles , 1973

Gerla1973 The design of store-and-forward networks for computer communications

M. Gerla

School of Engineering and Applied Science, University of California, Los Angeles , 1973



Ge77 Topological design of distributed computer networks

Gerla, M. & Kleinrock, L.


GeKl77 On the Topological Design of Distributed Computer Networks



GerlaKleinrock1977 On the topological design of distributed computer networks



GeMoPa89 Topology design and bandwidth allocation in ATM nets

Gerla, M.; Monteiro, J. & Pazos, R.


GerlaTsai95 Multicluster, mobile, multimedia radio network

Gerla, M. & Tsai, J.T.C.


GerTsa95 Multicluster, Mobile, Multimedia Radio Network

Gerla, M. & Tsai, J.


Gerla95 Multicluster, mobile, multimedia radio network

Gerla, M. & Tsai, J.




GeLu81 Projection and Duality Techniques in Economic Equilibrium Models

Geromel, J. & Luna, H.

IEEE Trans. on Systems, Man and Cybernetics , Vol. 11 , pp. 329-338 , 1981

Gersho75 A Simple Growth Model for the Diffusion of a New Communication Service

Gersho, A. & Mitra, D.

IEEE Transactions on Systems, Man, and Cybernetics , Vol. 5 , pp. 209-216 , 1975

Gersht:Weihmayer Joint optimization of data network design and facility selection

Gersht, A. & Weihmayer, R.


GershtWeihmayer1990 Joint optimization of data network design and facility selection

Gersht, A. & Weihmayer, R.


Ger96 On the future of wavelength routing networks

Gerstel, O.

IEEE Network Magazine , Vol. 10 , pp. 14-20 , 1996

02gerstel Combined WDM and SONET network design

Gerstel, O.; Lin, P. & Sasaki, G.

IEEE , Vol. 2 , pp. 734 - 743 , 1999

00gers Cost Effective Traffic Grooming in WDM Rings



Gerstel, O.; Ramaswami, R. & Sasaki, G.


01grs Cost effective traffic grooming in WDM rings


Proceedings of IEEE INFOCOM 1998 , pp. 69 - 77 , 1998

08ger Cost-effective traffic grooming in WDM rings


IEEE/ACM Transactions on Networking , Vol. 8 , pp. 618 - 630 , 2000

ger00 Cost-Effective Traffic Grooming in WDM Rings



Geunes03 Network optimization in supply chain management and financial engineering: An annotated bibliography

Geunes, J. & Pardalos, P.

Networks , Vol. 42 , pp. 66-84 , 2003

19ghs Effective wavelength assignment algorithms for optimizing design costs in SONET/WDM rings

Ghafouri-Shiraz, H.; Zhu, G. & Fei, Y.


ghamlouche1 Cycle-based neighbourhoods for fixed-charge capacitated multicommodity network design

Ghamlouche, I.; Crainic, T.G. & Gendreau, M.




ghandforoush1 Optimal allocation of time in a hospital pharmacy using goal programming

Ghandforoush, P.


elghaoui2 Worst-case value-at-risk and robust portfolio optimization: a conic programming approach

Ghaoui, L.E.; Oks, M. & Oustry, F.


dGhVl2 An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex

de Ghellinck, G. & Vial, J.


dGhVl A polynomial Newton method for Linear Programming

de Ghellinck, G. & Vial, J.


ghiani1 A branch-and-cut algorithm for the undirected rural postman problem

Ghiani, G. & Laporte, G.


GhoH93 Location-allocation models in the private sector: progress, problems and prospects

Ghosh, A. & Harche, F.

Location Science , Vol. 1 , pp. 81-106 , 1993



Gho96a Computational aspects of the maximum diversity problem

Ghosh, J.


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.


jcgilbert1 Examples of ill-behaved central paths in convex optimization

Gilbert, J.C.; Gonzaga, C.C. & Karas, E.

pdf url

url



2001

gilbert1 An efficient algorithm to compute row and column counts for sparse Cholesky factorization

Gilbert, J.R.; Ng, E.G. & Peyton, B.W.


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.


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.; Poncéleon, D.B. & Saunders, M.A.


gill8 SNOPT: An SQP algorithm for large-scale constrained optimization

Gill, P.E.; Murray, W. & Saunders, M.A.


url



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.


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



GMSWopt Constrained Nonlinear Programming


pp. 171-210 , 1989

GMSW Sparse Matrix Methods in Optimization



gill4 Numerical Linear Algebra and Optimization

Gill, P.E.; Murray, W. & Wright, M.H.


GMW Practical Optimization

Gill, P.E.; Murray, W. & Wright, M.H.




gilg63 A linear programming approach to the cutting stock problem: Part II

Gilmore, P.C. & Gomory, R.E.


gilg61 A linear programming approach to the cutting stock problem

Gilmore, P.C. & Gomory, R.E.


Gilmore:Gomory A Linear Programming Approach to the Cutting-Stock Problem -- Part II

Gilmore, P. & Gomory, R.


Gilmore:Gomory_1963 A linear programming approach to the cutting-stock problem -- Part II



Gilmore:Gomory_1961 A linear programming approach to the cutting-stock problem



Giortzis:Turner:Barria Decomposition technique for fixed channel assignment problems in mobile radio networks

Giortzis, A.; Turner, L. & Barria, J.

IEE Proceedings: Communications , Vol. 147 , pp. 187-194 , 2000

Gir90



Routing and Dimensioning in Circuit-Switched Networks

Girard, A.


GirSanDad01 A tabu search algorithm for access network design

Girard, A.; Sansó, B. & Dadjo, L.


Girard98 Multicommodity flow models, failure propagation, and reliable loss network design

Girard, A. & Sanso, B.

IEEE-ACM transactions on Networking , Vol. 6 , pp. 82-93 , 1998

GirardSansoDadjo2001 A tabu search algorithm for access network design

Girard, A.; Sanso, B. & Dadjo, L.


GiGe93 Performance evaluation and routing optimization of ISDN networks with nonhierarchical and alternate routing

Girard, A. & St-Georges, S.

pp. 454-461 , 1993

girlich1 On the relaxation polytope of the linear ordering problem

Girlich, E. & Nalivaiko, V.

1998

Giv Computation of Plane Unitary Rotations transforming a general matrix to triangular form

url



Givens, W.


glashoff1 Linear Optimization and Approximation

Glashoff, K. & Gustafson, S.


Gla78 A quadratic network optimization model for equilibrium single commodity trade flows

Glassey, C.


glineur2 Topics in Convex Optimization: Interior-Point Methods, Conic Duality and Approximations

F. Glineur

Service MATHRO, Faculté Polytechnique de Mons , 2001

glineur1 Proving strong duality for geometric optimization using a conic formulation

Glineur, F.

1999

GlineurPhD01 Topics in Convex Optimization: Interior-Point methods, Conic Duality and Approximations

Fr. Glineur

Faculté Polytechnique de Mons , 2001

Image0101 Conic optimization: an elegant framework for convex optimization

Glineur, F.

url

url

url

url



2001

Glineur00 An extended conic formulation for geometric optimization

Glineur, F.

Foundations of Computing and Decision Sciences , Vol. 25 , pp. 161-174 , 2000

Image0001 Polyhedral approximation of the second-order cone: computational experiments

Glineur, F.

2000

Image0006 An extended conic formulation for geometric optimization

Glineur, F.

2000

Image0007 Self-concordant functions in structured convex optimization

Glineur, F.

2000

Image0008 Approximating geometric optimization with $l_p$-norm optimization

Glineur, F.

2000

Image9901 Interior-point methods for linear programming: a guided tour

Glineur, F.

1999

Image9903

url

url

url

url

url

url



Proving strong duality for geometric optimization using a conic formulation

Glineur, F.

1999

Glineur98 Interior-point methods for linear programming: a guided tour

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

Glineur, Fr.


Glineur97 Etude des méthodes de point intérieur appliquées à la programmation linéaire et à la programmatiuon semidéfinie

Glineur, Fr.


Image0005 A conic formulation for $l_p$-norm optimization

Glineur, F. & Terlaky, T.

2000

Image9904 Deriving duality for lp-norm optimization using conic optimization

Glineur, F. & Terlaky, T.

1999

glockner2 Dynamic network flow with uncertain arc capacities: decomposition algorithm and computational results

url

url

url

url

url

url



Glockner, G. & Nemhauser, G.L.


glockner1 A dynamic network flow problem with uncertain arc capacities: formulation and problem structure

Glockner, G. & Nemhauser, G.L.


Glo00a Multi-start and strategic oscillation methods -- Principles to exploit adaptive memory

Glover, F.

pp. 1-24 , 2000

gloverScatterSearch Scatter search and path relinking

Glover, F.

pp. 297-316 , 1999

eject2 Ejection chains, reference structures and alternating path methods for traveling salesman problems

Glover, F.


Glo96a Tabu search and adaptive memory programming -- Advances, applications and challenges

Glover, F.

pp. 1-75 , 1996

glover1 Tabu thresholding: Improved search by nonmonotonic trajectories

Glover, F.




Glo90 Tabu search - Part II

Glover, F.


Glover90 Tabu Search - Part II

Glover, F.

ORSA J. Comput. , Vol. 2 , pp. 4-32 , 1990

Glo89 Tabu Search, Part I

Glover, F.


Glover89 Tabu Search - Part I

Glover, F.

ORSA J. Comput. , Vol. 1 , pp. 190-260 , 1989

Glo86 Future paths for integer programming and links to artificial intelligence

Glover, F.


tabu86-1 Future paths for integer programming and links to artificial intelligence

Glover, F.

Computers & Operations Research , Vol. 13 , pp. 533-549 , 1986

GloKarKli74 Implementation and computational comparisons of primal, dual, and



primal-dual computer codes for minimum cost network flow problems

Glover, F.; Karney, D. & Klingman, D.

Networks , Vol. 4 , pp. 191-212 , 1974

GloKarKliNap74 A computational study on start procedures, basis change criteria, and solution algorithms for transportation problems

Glover, F.; Karney, D.; Klingman, D. & Napier, A.


glover3 New practical advances from a system that combines simulation and optimization

Glover, F.; Kelly, J.P. & Laguna, M.

??

GloKliPhi85a New Polynomially Bounded on finding Shortest Path Trees

Glover, F.; Klingman, D. & Phillips, N.


GloKliPhi85b Network Models in Optimization and Their Applications in

Practice

Glover, F.; Klingman, D. & Schneider, N.P.R.

Wiley , 1985

GloKliStu74 Augmented threaded index method for network optimization

Glover, F.; Klingman, D. & Stutz, J.

INFOR , Vol. 12 , pp. 293-298 , 1974

GloL97



Tabu search

Glover, F. & Laguna, M.

Kluwer Publishers , 1997

GloLag97 Tabu Search


Kluwer , 1997

glover4 Tabu Search



GloverLaguna97 Tabu Search



tabu97-1 Tabu Search



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



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.


glover5 Foundation-penalty cuts for mixed-integer programming

Glover, F. & Sherali, H.D.

2002

glover2 A user's guide to tabu search

Glover, F.; Taillard, E. & de Werra, D.


GTW93 A User's Guide to Tabu Search



meta92-1 A user's guide to tabu search


ORWP , 1992

glom75 Sur l'approximation par éléments finis d'ordre 1 et la résolution par pénalisation-dualité d'une classe de problèmes de Dirchlet non linéaires

url



Glowinski, R. & Marocco, A.

RAIRO , Vol. 2 , 1975

glunt1 Molecular conformations from distance matrices

Glunt, W.; Hayden, T.L. & Raydan, M.

Journal of Computational Chemistry , Vol. 14 , pp. 114-120 , 1993

goberna1 Linear semi-infinite programming theory: an updated survey

Goberna, M.A. & López, M.A.


godfrey1 An adaptive, distribution-free approximation method for the newsvendor problem with censored demands, with applications to inventory and distribution problems

Godfrey, G.A. & Powell, W.B.


Goel1999 Algorithms for network routing, multicasting, switching, and design

A. Goel

Stanford University, Department of Computer Science , 1999

Goemans1994 The Steiner polytope and related polyhedra

Goemans, M.


goeber93 Survivable networks, linear programming relaxations and the parsimonious property

Goemans, M. & Bertsimas, D.

url




GoemansWilliamson A general approximation technique for constrained forest problems

Goemans, M. & Williamson, D.


goemans3 Semidefinite programming in combinatorial optimization

Goemans, M.X.


goemans2 Worst-case comparison of valid inequalities for the TSP

Goemans, M.X.


Go94 The Steiner tree polytope and related polyhedra

Goemans, M.X.


Goemans The Steiner tree polytope and related polyhedra

Goemans, M.X.


goemans4 The Steiner tree polytope and related polyhedra

Goemans, M.X.


GoMy93 A Catalogue of Steiner Tree Formulations

url



Goemans, M.X. & Mying, Y.

Networks , Vol. 23 , pp. 19-28 , 1993

GoemansMyung A catalog of Steiner tree formulations

Goemans, M.X. & Myung, Y.S.

Networks , Vol. 23 , pp. 19-28 , 1993

goemans6 When does the positive semidefiniteness constraint help in lifting procedures?

Goemans, M.X. & Tunçel, L.


GoemansWilliamson95 Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Goemans, M.X. & Williamson, D.P.


goemans5 New $34$-approximation algorithms for MAX SAT



goemans7 Approximating minimum-cost graph problems with spanning tree edges



des94-6 Arborescence polytopes for series-parallel graphs

Goemans, M.




des93-5 Survivable networks, LP relaxations and the

parsimonious property

Goemans, M. & Bertsimas, D.


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


Approximation Algorithms for NP-Hard Problems , 1996

GoeWil96 The primal dual method for approximation algorithms and its application to network design problems


pp. 144-191 , 1996

des95-8 A general approximation technique for

constrained forest problems





GW95 A General Approximation Technique for Constrained Forest Problems


SIAM J. Comp. , Vol. 24 , pp. 296-317 , 1995

goemans1 Improved Approximation Algorithms for Maximum Cut and

Satisfiability Problems Using Semidefinite Programming


J. of the ACM , Vol. 42 , pp. 1115-1145 , 1995

00gds Long-haul transparent network architectures and applications

Goeringer, S.; Dietz, D.; Sprenger, M. & Straub, D.

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. Tul3-33 - Tul3-34 , 2002

goetschalckx1 Modeling and design of global logistics systems: A review of integrated strategic and tactical models and design algorithms

Goetschalckx, M.; Vidal, C.J. & Dogan, K.


Gof2 Affine and projective transformations in non-differentiable optimization

Goffin, J.

pp. 79-91 , 1988

Gof1

url



Affine methods in non-differentiable optimization

Goffin, J.

1987

goffin3 Solving nonlinear multicommodity network flow problems by the analytic center cutting plane method

Goffin, J.; Gondzio, J.; Sarkissian, R. & Vial, J.


GHV Decomposition and nondifferentiable optimization with the projective algorithm

Goffin, J.; Haurie, A. & Vial, J.


goffhauvia92 Cutting planes and column generation techniques with the projective algorithm

Goffin, J.; Haurie, A. & Vial, J.


GofLuoYe On the Complexity of a Column Generation Algorithm for Convex or Quasiconvex Problems

Goffin, J.; Luo, Z. & Ye, Y.

1993

GofVial Cutting planes and column generation techniques with the projective algorithm

Goffin, J. & Vial, J.

Journal of Optimization Theory and Applications , Vol. 65(3) , pp. 409-429 , 1990

goffin11



Convergence of a simple subgradient level method

Goffin, J. & Kiwiel, K.


goffin5 Complexity analysis of an interior cutting plane method for convex feasibility problems



goffin6 Further complexity analysis of a primal-dual column generation algorithm for convex or quasiconvex feasibility problems


1993

goffin4 An analytic center cutting plane method for pseudomonotone variational inequalities

Goffin, J.; Marcotte, P. & Zhu, D.


goffin12 Using the Primal Dual Infeasible Newton Method in the Analytic Center Method for Problems Defined by Deep Cutting Planes

Goffin, J. & Mokhtarian, F.S.


goffin10 Convex nondifferentiable optimization: a survey focussed on the analytic center cutting plane method



goffin9

url

url

url



Multiple cuts in the analytic center cutting plane method



goffin7 Shallow, deep and very deep cuts in the analytic center cutting plane method



goffin8 A two-cut approach in the analytic center cutting plane method



Go77 On Convergence Rates of Subgradient Optimization Methods

Goffin, J.


Goffin On the Convergence Rates of Subgradient Optimization Methods

Goffin, J.


Gol97 An efficient implementation of a scaling minimum-cost flow algorithm

Goldberg, A.


Gol92 An efficient implementation of a scaling minimum cost flow algorithm,

Goldberg, A.

1992

url

url



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.


Gol89 Genetic algorithms in search, optimization, and machine learning

Goldberg, D.


Goldberg:book



Genetic algorithms in search, optimization, and machine learning

Goldberg, D.


GoldbergSpencer89 A new parallel algorithm for the maximal independent set problem

Goldberg, M. & Spencer, T.


GldMeh A relaxed revision of Karmarkar's algorithm

Goldfarb, D. & Mehrotra, S.


goldfarb6 The simplex method for conic programming

Goldfarb, D.

2002

goldfarb5 Robust convex quadratically constrained programs

Goldfarb, D. & Iyengar, G.


goldfarb4 Robust portfolio selection problems

Goldfarb, D. & Iyengar, G.

2001

goldfarb2 An $O(mn)$-time network simplex algorithm for the shortest path problem

Goldfarb, D. & Jin, Z.


url

url

url



goldfarb7 A polynomial dual simplex algorithm for the generalized circulation problem

Goldfarb, D.; Jin, Z. & Lin, Y.


goldfarb8 Combinatorial interior point methods for generalized network flow problems

Goldfarb, D. & Lin, Y.


GldLiu An O$(n^3L)$ primal interior point algorithm for convex quadratic programming

Goldfarb, D. & Liu, S.


GldLiuWang A logarithmic barrier function algorithm for quadratically constrained convex quadratic programming

Goldfarb, D.; Liu, S. & Wang, S.


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

Goldfarb, D. & Scheinberg, K.


GoldTodd

url



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.


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.


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



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.


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



Multi terminal network flows

Gomory, R.E. & Hu, T.C.

Journal of the Society for Industrial and Applied Mathematics , Vol. 9 , pp. 551-571 , 1961

gomory5 An approach to integer programming

Gomory, R.E. & Johnson, E.L.

Mathematical Programming , Vol. 96 , pp. 181 , 2003

gomory7 T-space and cutting planes

Gomory, R.E. & Johnson, E.L.


gomory6 Corner polyhedra and their connection with cutting planes

Gomory, R.E.; Johnson, E.L. & Evans, L.


Gom1963 An algorithm for integer solutions to linear programs

Gomory, R.

pp. 269-302 , 1963

Gomory_1958 Outline of an algorithm for integer solution to linear programs

Gomory, R.

Bulletin American Mathematical Society , Vol. 64 , pp. 275-278 , 1958

gomhu62 An application of generalized linear programming to network flows

Gomory, R. & Hu, T.




gra61-1 Multi-terminal network flows

Gomory, R. & Hu, T.


gonmin95 Graphs and Algorithms

Gondran, M. & Minoux, M.

John Wiley & Sons , 1995

GoMi79 Graphes et Algorithms


Eyrolles , 1979

gon79 Graphes et algorithmes


Eyrolles , 1979

gondzio1 Warm Start of the Primal-Dual Method Applied in the Cutting Plane Scheme

Gondzio, J.


gondzio11 Presolve analysis of linear programs prior to applying an interior point method

Gondzio, J.


gondzio0 Multiple centrality corrections in a primal-dual method for linear

url



programming

Gondzio, J.


gondzio7 HOPDM (ver 2.12) --- A fast LP solver based on a primal-dual interior point method

Gondzio, J.


gondzio13 Solving nonlinear portfolio optimization problems with the primal-dual interior point method

Gondzio, J. & Grothey, A.

2004

gondzio10 Re-optimization with the Primal-Dual Interior Point Method



gondzio12 Parallel interior point solver for structured quadratic programming: application to financial planning problems


2003

gondzio8 High-Performance Computing for Asset-Liability Management

Gondzio, J. & Kouwenberg, R.


gondzio6 ACCPM --- A library for convex optimization based on an analytic center cutting plane method

url

url

url

url



Gondzio, J.; Merle, O.d.; Sarkissian, R. & Vial, J.


gondzio9 Parallel Interior Point Solver for Structured Linear Programs

Gondzio, J. & Sarkissian, R.


gondzio2 Column generation with a primal-dual method

Gondzio, J. & Sarkissian, R.

1996

gondzio4 Parallel implementation of a central decomposition method for solving large scale planning problems

Gondzio, J.; Sarkissian, R. & Vial, J.


gondzio5 Using an interior point method for the master problem in a decomposition approach

Gondzio, J.; Sarkissian, R. & Vial, J.


gondzio3 Warm start and $$-subgradients in cutting plane scheme for block-angular linear programs

Gondzio, J. & Vial, J.

1997

Gon96a GRASP

González, J.

url

url

url

url



pp. 143-161 , 1996

gonzaga11 Complexity of predictor-corrector algorithms for LCP based on a large neighborhood of the central path

Gonzaga, C.C.


gonzaga13 The largest step path following algorithm for monotone linear complementarity problems

Gonzaga, C.C.


Gon7 Path Following Methods for Linear Programming

Gonzaga, C.C.


Gon227 On lower bound updates in primal potential reduction methods for linear programming

Gonzaga, C.C.


Gon4 Large Step Path following methods for linear programming, Part I: Barrier function method

Gonzaga, C.C.


Gon44 Search directions for interior linear-programming methods

Gonzaga, C.C.


url



Gon5 Large Step Path following methods for linear programming, Part II: Potential reduction method

Gonzaga, C.C.


Gon6 Interior Point Algorithms For Linear Programming With Inequality Constraints

Gonzaga, C.C.


Gon3 Polynomial affine algorithms for linear programming

Gonzaga, C.C.


Gon1 Conical Projection Algorithms for Linear Programming

Gonzaga, C.C.


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.


gonzaga14 url



Properties of the central points in linear programming problems

Gonzaga, C.C. & Cardia, M.

2002

gonzaga15 Using the central path for computing the analytic center of a polytope

Gonzaga, C.C. & Cardia, M.

2002

gonzaga16 A globally convergent filter method for nonlinear programming

Gonzaga, C.C.; Karas, E. & Vanti, M.

2002

gonzaga10 A note on properties of condition numbers

Gonzaga, C.C. & Lara, H.J.

1996

GonTodd862 An $O(sqrtnL)$-iteration large-step primal-dual affine algorithm for linear programming

Gonzaga, C.C. & Todd, M.J.

1989

gonzalezlima1 On effectively computing the analytic center of the solution set by primal-dual interior-point methods

Gonzalez-Lima, M.D.; Tapia, R.A. & Potra, F.A.


GooKobVec90 The LAMBDANET multiwavelenth network: architecture, application and demonstration

url

url

url



Goodman, M.; Kobrinsk, H.; Vecchi, M.; Bulley, R. & Gimlett, J.


Gopal80 A new method for solving reliability optimization problem

Gopal, K.; Aggarwal, K. & Gupta, J.


gopal2 Confidentiality via comouflage: the CVC approach to disclosure limitation when answering queries to databases

Gopal, R.; Garfinkel, R. & Goes, P.


gopal1 Interval protection of confidential information in a database

Gopal, R.; Goes, P. & Garfinkel, R.


goral97 SONET: A Guide to Synchronous Optical Network

Goralski, W.

McGraw-Hill , 1997

gordon1 Train control optimization

Gordon, S.P. & Williams, P.J.


GosselinBejan05 Tree networks for minimal pumping power

Gosselin, L. & Bejan, A.

International Journal of Thermal Sciences , Vol. 44 , pp. 53-63 , 2005



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.


gould2 On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization

Gould, N.I.M.; Hribar, M. & Nocedal, J.

1998

gould3 Solving the trust-region subproblem using the Lanczos method

Gould, N.I.M.; Lucidi, S.; Roma, M. & Toint, P.L.


gould1 The modified absolute-value factorization norm for trust-region minimization

Gould, N.I.M. & Nocedal, J.

1997

gould5 Superlinear convergence of primal-dual interior point algorithms for nonlinear programming

Gould, N.I.M.; Orban, D.; Sartenaer, A. & Toint, P.

2000

gould6 Componentwise fast convergence in the solution of full-rank

url

url

url

url



systems of nonlinear equations

Gould, N.I.M.; Orban, D.; Sartenaer, A. & Toint, P.

2000

gould4 A note on the convergence of barrier algorithms to second-order necessary points

Gould, N.I.M. & Toint, P.L.


gould8 SQP methods for large-scale nonlinear programming

Gould, N.I.M. & Toint, P.L.

1999

Gou88 Graph Theory

Gould, R.

The Benjamin/Cummings Publishing Company, Inc. , 1988

gouj83 Combinatorial enumeration

Goulden, I.P. & Jackson, D.M.


Go97 Economie des Télécoms

Goulvestre, J.

Hermes , 1997

gourdin1 The uncapacitated facility location problem with client matching

Gourdin, &.; Labbè, M. & Laporte, G.


url



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.


Gouveia1998 Using variable redefinition for computing lower bounds for minimum spanning and Steiner trees with hop constraints

Gouveia, L.


Gouveia3 Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints

Gouveia, L.


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



Gouveia, L.


Gouveia_1996 Multicommodity flow models for spanning trees with hop constraints

Gouveia, L.


gouveia1 A result on projection for the vehicle routing problem

Gouveia, L.


Gouveia1995 Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints

Gouveia, L.


Gouveia_1995 Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints

Gouveia, L.


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.




GouveiaLopes1997 Using generalized capacitated trees for designing the topology of local access networks

Gouveia, L. & Lopes, M.J.


gouveia03 Network flow models for designing diameter-constrained minimum-spanning and Steiner trees

Gouveia, L. & Magnanti, T.

Networks , Vol. 41 , pp. 159-173 , 2003

GouveiaMagnanti03 Network Flow Models for Designing Diameter-Constrained Minimum-Spanning 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.




GouveiaRequejo01 A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem

Gouveia, L. & Requejo, C.


GouveiaRequejo2001 A new Lagrangian relaxation approach for the hop-constrained minimum spanning tree problem

Gouveia, L. & Requejo, C.


goux1 Solving large MINLPs on computational grids

Goux, J. & Leyffer, S.

2001

gr An analysis of Internet interdomain topology and route stability

Govindan, R. & Reddy, A.

Proceedings of INFOCOM , 1997

Graf98 On coloring unit disk graphs

Gräf, A.; Stumpf, M. & enfels, G.W.


GraMcK02 Ensemble planning for digital audio broadcasting

Gräf, A. & McKenney, T.

pp. 267-288 , 2002

grotschel16 The Steiner tree packing problem in VLSI design

url



Grötschel, M.; Martin, A. & Weismantel, R.


grotschel12 Packing Steiner trees: polyhedral investigations



grotschel13 Packing Steiner trees: a cutting plane algorithm and computational results



gromon90 Integer polyhedron associated with certain network design problems with connectivity constraints

Grötschel, M. & Monma, C.


gromonsto95 Design of survivable networks

Grötschel, M.; Monma, C. & Stoer, M.

Handbook in OR and MS , Vol. 27 , pp. 617-672 , 1995

gromonsto92 Computational results with a cutting-plane algorithm for designing communication networks with low connectivity constraints



GrMo90 Integer polyhedra arising from certain network design problems with connectivity constraints

Grötschel, M. & Monma, C.L.



SIAM J. Disc. Math. , Vol. 3 , pp. 502-523 , 1990

GrStMo92 Facets of polyhedra arising in the design of communication networks with low-connectivity constraints

Grötschel, M.; Stoer, M. & Monma, C.L.


GLS Geometric Algorithms and Combinatorial Optimization

Grötschel, M.; Lovász, L. & Schrijver, A.


Grotschel:Monma:Stoer_1995 Polyhedral and computational investigations for designing communication networks with high survivability requirements



Grotschel:Monma:Stoer_1992 Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints



01hsw Spectrum scavenging for indoor microcells

Grandhi, S.; Chen, K.; Madhavapeddy, S.; Basu, K.; Shaheen, K.; Willhoff, S.; Staley, H. & Homayoun, F.

'Mobile Technology for the Human Race' , Vol. 1 , pp. 462 - 466 , 1996

Gra95 Constrained power control

Grandhi, S.; Zander, J. & Yates, R.

Journal of Wireless Personal Communications , Vol. 1 , pp. 257-270 , 1995



greenberg6 Simultaneous primal-dual right-hand-side sensitivity analysis from a strictly complementary solution of a linear program

Greenberg, H.J.


greenberg4 A Simplified Introduction to LaTeX

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.


greenberg1 Rim sensitivity analysis from an interior solution

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

url

url



Greenberg, H.J.

1990

greenberg2 On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance

Greenberg, H.J.; Holder, A.G.; Roos, C. & Terlaky, T.


OB1.wrip A Workbench for Research in (linear) Programming (WRIP), Version 1.0

Greenberg, H.J. & Marsten, R.E.

1990

greenberg3 Approaches to diagnosing infeasible linear programs

Greenberg, H.J. & Murphy, F.H.


Gregg Auction advisor: An agent-based online-auction decision support system

Gregg, D.G. & Walczak, S.

Decision Support Systems , 2004

Gri86 An efficient implementation of the network simplex method

Grigoriadis, M.


grigoriadis2 Approximate minimum-cost multicommodity flows in $O(-2KNM)$ time

Grigoriadis, M.D. & Khachiyan, L.G.


url



grigoriadis1 Coordination complexity of parallel price-directive decomposition



grigoriadis3 An interior point method for bordered block-diagonal linear programs



grik96 Approximate minimum-cost multicommodity flows in $O( -2KNM)$ time



grik94 Fast approximation schemes for convex programs with many blocks and coupling constraints



grik91 Fast approximation schemes for convex programs with many blocks and coupling constraints


1991

griwhi72 A partitioning algorithm for the multicommodity network flow problem

Grigoriadis, M. & White, W.


gm On coloring random graphs



Grimmett, G.R. & McDiarmid, C.J.H.

Mathematical Proceedings of Cambridge Phil. Society , Vol. 77 , pp. 313-324 , 1975

Grimwood The Euclidean Steiner tree problem: Simulated annealing and other heuristics

Grimwood, G. R.

Victoria University , 1994

grone1 Positive definite completions of partial Hermitian matrices

Grone, B.; Johnson, C.; de Sa, E.M. & Wolkowicz, H.


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.

url



IEEE Communications Letters , Vol. 5 , pp. 172-174 , 2001

grover1 Fast interior point methods for bipartite matching

Grover, L.K.


GroverPcycle2000 Bridging the Ring-Mesh Dichotomy with p-Cycles

Grover, W. & Stametaelakis, D.

Proc. Design of Reliable Communication Networks (DRCN'2000), Munich , pp. 92-104 , 2000

Grov04 The Protected Working Capacity Envelope Concept: An Alternative Paradigm for Automated Service Provisioning

Grover, W.D.

IEEE Communications Magazine , Vol. 42(1) , pp. 62-69 , 2004

Grover-book Mesh-based Survivable Networks:

Options and Strategies for Optical, MPLS, SONET and ATM

Networking

Grover, W.D.


grover04 Mesh-Based Survivable Networks

Grover, W.D.

Prentice Hall PTR , 2004

Grov03 Mesh-Based Survivable Networks: Options and Strategies for Optical, MPLS, SONET, and ATM Networking



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 Mesh-like 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.


web_grover www.ee.ualberta.ca/$~$grover/

Grover, W.

2005

grover Mesh-Based Survivable Networks

Grover, W.


Wayne02 Design of a meta-mesh of chain subnetworks: Enhancing the attractiveness of mesh-restorable WDM networking on low connectivity graphs



Grover, W.


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.


Grover:Doucette Topological design of survivable mesh-based transport networks

Grover, W. & Doucette, J.


gruber3 On semidefinite programming and applications in combinatorial optimization

G. Gruber

University of Technology, Graz , 2000

gruber2 Computational experience with Stable Set Relaxations

Gruber, G. & Rendl, F.

2000

gruber1 Semidefinite Programs without feasible interior points

Gruber, G. & Rendl, F.

1999

gra93-1 Packing Steiner trees: separation algorithms


1993

url

url

url



GrMoSt94 Design of survivable networks


1994

GrMoSt92a Computational results with a cutting plane algorithm for designing

communication networks with low-connectivity constraints



GrMoSt92b Facets for polyhedra arising in the design of communication networks

with low-connectivity constraints



GrMoSt91 Polyhedral approaches to network survivability


Vol. 5 , 1991

Grot1 Grötschel, M.

1987

GH3 Solution of large-scale travelling salesman problems

Grötschel, M. & Holland, O.


GH2



A cutting plane algorithm for minimum perfect 2-matchings


Computing , Vol. 39 , pp. 327-344 , 1987

GH1 Solving matching problems with linear programming



GJR2 On the acyclic subgraph polytope

Grötschel, M.; Jünger, M. & Reinelt, G.


GJR3 Facets of the linear ordering polytope



grotschel15 Calculating exact ground states of spin glasses: A polyhedral approach


Proceedings of the Heidelberg Colloquium on Glassy Dynamics , pp. 325-353 , 1985

GJR1 A cutting plane algorithm for the linear ordering problem



GJR4 Optimal triangulation of large real-world input-output matrices


Statistiche Hefte , Vol. 25 , pp. 261-295 , 1984



GLSbook Geometric Algorithms and Combinatorial Optimization

Grötschel, M.; Lovasz, L. & Schrijver, A.


GLS81 The ellipsoid method and its consequences in combinatorial optimization

Grötschel, M.; Lovasz, L. & Schrijver, A.


grotschel11 Polyhedral and computational investigations for designing communication networks with high survivability requirements

Grötschel, M.; Monma, C.L. & Stoer, M.


GrMonma Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints

Grötschel, M.; Monma, C.L. & Stoer, M.


des90-3 Integer polyhedra arising from certain

design problems with connectivity constraints

Grötschel, M. & Monma, C.


des95-2 Polyhedral and computational investigations

for designing communication networks with

high survivability requirements





des95-4 In: Design of Survivable Networks


North-Holland , Vol. 7 on Network models , pp. 617-672 , 1995

des93-1 A polyhedral approach to network

connectivity problems


1993

des92-2 Facets for polyhedra arising in the design of

communication networks with low-connectivity

constraints



des92-3 Computational results with a cutting plane algorithm

for designing communication networks with low-connectivity

constraints



GrPa Polyhedral Theory



Grötschel, M. & Padberg, M.

pp. 251-305 , 1985

GrPy Clique-tree inequalities and the symmetric travelling salesman problem

Grötschel, M. & Pulleyblank, W.R.


grotschel14 Facets of the clique partitioning polytope

Grötschel, M. & Wakabayashi, Y.


grotschel10 A cutting plane algorithm for a clustering problem

Grötschel, M. & Wakabayashi, Y.


GroeplEtAl01 Lower Bounds for Approximation Algorithms for the Steiner Tree Problem

Gröpl, C.; Hougardy, S.; Nierhoff, T. & Prömel, H.

pp. 217-228 , 2001

GroeplEtAl00 Approximate Algorithms for the Steiner Tree Problem in Graphs

Gröpl, C.; Hougardy, S.; Nierhoff, T. & Prömel, H.

2000

mgu1 Primal-Dual Interior Point Methods for Semidefinite Programming in finite precision

Gu, M.


url



zgu2 Lifted cover inequalities for 0--1 integer programs: complexity

Gu, Z.; Nemhauser, G.L. & Savelsbergh, M.W.P.


zgu3 Lifted cover inequalities for mixed 0--1 integer programs



zgu1 Lifted cover inequalities for 0--1 integer programs: computation



guan1 A Branch-and-Cut Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem

Guan, Y.; Ahmed, S. & Nemhauser, G.L.

2004

GudmundssonEtAl99 Approximating Minimum Manhattan Networks

Gudmundsson, J.; Levcopoulos, C. & Narasimhan, G.

pp. 28-38 , 1999

GuenPar Network Optimization in Supply Chain Management and Financial Engineering: An Annotated Bibliography

Guenes, J. & Pardalos, P.M.

Networks , Vol. 42 , pp. 66-84 , 2003

tseng30 Implementation and Testing of Auction Methods for Solving Separable Convex Cost Generalized Network Flow Problems

url

url



Guerriero, F. & Tseng, P.

2001

GK98 Approximation algorithms for connected dominating sets

Guha, S. & Khuller, S.


Guha98 Approximation Algorithms for Connected Dominating Sets



GuhaKhuller98a Approximation Algorithms for Connected Dominating Sets



GuhaKhuller98b Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets


pp. 54-66 , 1998

Guha96 Approximation Algorithms for Connected Dominating Sets


Proceedings of the Annual European Symposium on Algorithms , pp. 179-193 , 1996

GuiMoh03 Efficient Overlay Multicast for Mobile and Ad Hoc Networks

Gui, C. & Mohapatra, P.

Proc. IEEE WCNC 2003 , Vol. 2 , pp. 1118-1123 , 2003



Guig2003 Lagrangean relaxation

Guignard, M.

TOP , Vol. 11 , pp. 151-199 , 2004

Guig1998 Efficient cuts in Lagrangean relax-and-cut schemes

Guignard, M.


guignard1 An improved dual-based algorithm for the generalized assignment problem

Guignard, M. & Rosenwein, M.B.


Guignard:Spielberg Logical reduction methods in zero-one programming

Guignard, M. & Spielberg, K.


GuSp79 A Direct Dual Method for the Mixed Plant Location Problem with some Side Constraints

Guignard, M. & Spielberg, K.


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



Guitart, P. & Basart, J.

Springer , pp. 280-293 , 1998

Guitart2 A genetic algorithm approach for the Steiner problem in graphs

Guitart, P. & Basart, J.

EUFIT ´98 Proceedings , pp. 508-512 , 1998

guiue1 Analyzing infeasible mixed integer and integer linear programs

Guiue, O. & Chinneck, J.W.


Gul-Stacchetti-2000 The English Auction with differentiated commodities

Gul, F. & Stacchetti, E.


Gul-Stacchetti-1999 Walrasian equilibrium with gross substitutes

Gul, F. & Stacchetti, E.


gulpinar1 Multistage stochastic programming in computational finance

Gulpinar, N.; Rustem, B. & Settergren, R.

Vol. 74 , 2002

gulpinar2 Multistage stochastic mean-variance portfolio analysis with transaction costs

Gulpinar, N.; Rustem, B. & Settergren, R.

2001

url

url



Gunasekaran04 Information systems in supply chain integration and management

Gunasekaran, A. & Ngai, E.


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 Interior-Point Algorithms

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

url



Gupta, A.; Stahl, D.O. & Whinston, A.B.


Gupta97 A Stochastic Equilibrium Model of Internet Pricing



Gupta95 A priority pricing approach to manage multiservice class network in real time


Journal of Electronic Publishing , 1995

Gu97 A system and traffic dependent adaptive routing algorithm for ad hoc networks

Gupta, P. & Kumar, P.

Proceedings of the 36th IEEE Conference on Decision and Control , pp. 2375-2380 , 1997

GuptaPirkul2000 Hybrid fiber co-axial CATV network design with variable capacity optical network units

Gupta, R. & Pirkul, H.


GuptaWalrand04 Approximating Maximal Cliques in Ad-Hoc Networks

Gupta, R. & Walrand, J.

Proceedings of the PIMRC 2004 , 2004

Gupta96 Design of centralized telecommunication networks

Gupta, S. & Pirkul, H.



International Transactions in Operational Research , Vol. 3 , pp. 1-21 , 1996

GurbaniLiu03 Session Initiation Protocol: Service Residency and Resiliency

Gurbani, V. & Liu, K.


01guru A Two-Stage Approach for Virtual Topology Reconfiguration Using Path-Add Heuristics

Gurucharan, B.H.; Sreenath, N.; Mohan, G. & Murthy, C.S.R.

Optical Network Magazine , Vol. to appear , 2001

gutin1 TSP tour domination and Hamiltonian cycle decompositions of regular graphs

Gutin, G. & Yeo, A.


Gun99 A branch-and-cut algorithm for capacitated network design problems

Günlük, O.

Math. Program. , Vol. 86 , pp. 17-39 , 1999

Gu96 A branch-and-cut algorithm for capacitated network design problem

Günlük, O.

1996

gunluk-etal-2004 A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions

Günlük, O.; Ladänyi, L. & Vries, S.D.

Management Science , Vol. (to appear) , 2004



Guler2 Interior point approach to the theory of linear programming

Güler, 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.


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.


haeberly1 Extending Mehrotra and Gondzio Higher Order Methods to Mixed Semidefinite-Quadratic-Linear Programming

Haeberly, J.; Nayakkankuppam, M. & Overton, M.


hager

url



Minimizing a quadratic over a sphere

Hager, W.

SIAM J. on Optimization , Vol. 12 , pp. 188-208 , 2001

HagerKrylyuk99 Graph partitioning and continuous quadratic programming

Hager, W. & Krylyuk, Y.


hager2 Multiset graph partitioning

Hager, W.M. & Krylyuk, Y.


hager1 Graph partitioning and continuous quadratic programming

Hager, W.M. & Krylyuk, Y.


HaghighatFaezDehghanMowlaeiGhahremani04 GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing

Haghighat, A.; Faez, K.; Dehghan, M.; Mowlaei, A. & Ghahremani, Y.


HaghighatFaezDehghanMowlaeiGhahremani03 GA-Based Heuristic Algorithms for QoS Based Multicast Routing

Haghighat, A.; Faez, K.; Dehghan, M.; Mowlaei, A. & Ghahremani, Y.

Knowledge-Based Systems , Vol. 16 , pp. 305–-312 , 2003

Hagstrom84 Using the decomposition tree for directed-network reliability computation

Hagstrom, J.


url

url



haight1 An integer optimization approach to a probabilistic reserve site selection problem

Haight, R.G.; Revelle, C. & Snyder, S.A.


Hajek85 Extremal splittings of point processes

Hajek, B.


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.


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



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.


Ha64 Optimal locations of switching centers and the absolute

centers and median of a graph

Hakimi, S.


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.




halicka2 Two simple proofs of analyticity of the central path in linear programming

Halická, M.


halicka4 Analyticity of the central path at the boundary point in semidefinite programming

Halická, M.

2001

halicka1 Analytical properties of the central path at boundary point in linear programming

Halická, M.


halicka3 On the convergence of the central path in semidefinite optimization

Halická, M.; de Klerk, E. & Roos, C.


hall3 Approximability of job shop scheduling

Hall, L.


hall1 Experience with a cutting plane algorithm for the capacitated spanning tree problem

Hall, L.


url

url

url



hall2 Scheduling to minimize average completion time: off-line and on-line approximation algorithms

Hall, L.; Schulz, A.S.; Shmoys, D.B. & Wein, J.


hall4 Two-thirds is sharp for affine scaling

Hall, L. & Vanderbei, R.J.


nghall1 Supply chain scheduling: batching and delivery

Hall, N.G. & Potts, C.N.


HalldorssonEtAl98 Approximating Steiner Trees in Graphs with Restricted Weights

Halldórsson, 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

Halldórsson, 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

Halldórsson, 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



WDM technique and OADM: the 'coloured section'

ring

Electronics Letters , Vol. 32 , pp. 234-235 , 1996

hammer1 Roof duality, complementation and persistency in quadratic 0-1 optimization

Hammer, P.L.; Hansen, P. & Simeone, B.


HamRad01a Maximally disjoint solutions of the set

covering problem

Hammer, P. & D.J. Rader, ~.


JamRad99a Maximally disjoint solutions of the set covering problem

Hammer, P. & D.J. Rader, ~.


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

pdf url



Han01 Data mining, concepts and techniques

Han, J. & Kamber, M.


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

Han, Q.; Ye, Y.; Zhang, H. & Zhang, J.

2000

han1 Approximation of Dense-$k$-Subgraph

Han, Q.; Ye, Y. & Zhang, J.

2000

han3 An Improved Rounding Method and Semidefinite Programming Relaxation for Graph Partition

Han, Q.; Ye, Y. & Zhang, J.

2000

Hanan On Steiner's problem with rectilinear distance

Hanan, M.


HaMi79 Location on Networks - Theory and Algorithms

url

url



Handler, G. & Mirchandani, P.

The MIT Press , 1979

hane1 The fleet assignment problem: solving a large-scale integer program

Hane, C.A.; Barnhart, C.; Johnson, E.L.; Marsten, R.E.; Nemhauser, G.L. & Sigismondi, G.


haneveld1 Stochastic integer programming: General models and algorithms

Haneveld, W.K.K. & van der Vlerk, M.H.


Hanly95 An algorithm for combined cell-site selection and power control to maximize cellular spread spectrum capacity

Hanly, S.

IEEE J. Sel. Areas Commun. , Vol. 13 , pp. 1332-1340 , 1995

Han86 The steepest ascent mildest descent heuristic for combinatorial programming

Hansen, P.

Congress on Numerical Methods in Combinatorial Optimization , 1986

hanjau97 A Stabilized Column Generation Algorithm for the Multisource Weber Problem

Hansen, P.; Jaumard, B.; Krau, S. & Merle, O.d.

1997

hansen1 Constrained nonlinear 0--1 Programming

Hansen, P.; Jaumard, B. & Mathon, V.




quad01 An Efficient Algorithm for Unconstrained 0-1 Quadratic Programming

Hansen, P.; Jaumard, B. & Meyer, C.

1999

Han03 Variable neighborhood search

Hansen, P. & Mladenovi, N.

pp. 145-184 , 2003

Han02 Developments of variable neighborhood search


pp. 415-439 , 2002

HanMla01 Developments of variable neighborhood search


pp. 415-439 , 2002

HanMla99 An introduction to variable neighbourhood search


pp. 433-458 , 1999

hansen3 An introduction to variable neighborhood search


1998

hansen2 Heuristic solution of the multisource Weber problem as a $p$-median



problem

Hansen, P.; Mladenovi, N. & Taillard, &.


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.


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.


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



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.


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.


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.




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.


Hardin:Lee:Leung On the Boolean-quadric packing uncapacitated facility-location polytope

Hardin, J.; Lee, J. & Leung, J.


harlp52 Inequalities

Hardy, G.H.; Littlewood, J.E. & Polya, G.


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.


hbg01 Uniform integration of genome mapping data using intersection graphs



Harley, E.; Bonner, A. & Goodman, N.

Bioinformatics , Vol. 17 , pp. 487-494 , 2001

Harms:Hu Physical network design to facilitate capacity reallocation

Harms, J. & Hu, C.


HarSho87a Semi-greedy heuristics: An empirical study

Hart, J. & Shogan, A.


Har98a Sequential stopping rules for random optimization methods with applications to multistart local search

Hart, W.

SIAM Journal on Optimization , pp. 270-290 , 1998

HasOsmAlK01a A meta-heuristic procedure for the three dimension

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

pdf url



Hasselberg, J.; Pardalos, P.M. & Vairaktarakis, G.


HassinLevin03 Minimum spanning tree with hop restrictions

Hassin, R. & Levin, A.


hassin1 Approximation algorithms for the metric maximum clustering problem with given cluster sizes

Hassin, R. & Rubinstein, S.


Hata80 Empirical formula for propagation loss in land mobile radio service

Hata, M.


haugen1 Market mechanisms and stochastic programming

Haugen, K. & Wallace, S.W.

2001

haughton1 Quantifying the benefits of route optimization under stochastic customer demands

Haughton, M.


hauser6 Self-Scaled Barriers for Semidefinite Programming

Hauser, R.

2000

url

url



hauser1 Self-Scaled Barrier Functions: Decomposition and Classification

Hauser, R.

1999

hauser2 Square-Root Fields and the "V-Space" Approach to Primal-Dual Interior-Point Methods for Self-Scaled Conic Programming

Hauser, R.

1999

hauser3 Target Directions for Primal-Dual Interior-Point Methods for Self-Scaled Conic Programming

Hauser, R.

1999

hauser4 Primal-Dual Symmetric Scale-Invariant Square-Root Fields for Isotropic Self-Scaled Barrier Functionals

Hauser, R.

1999

hauser5 Nesterov-Todd directions are Newton directions

Hauser, R.

1999

hauser8 Self-scaled barrier on symmetric cones and their classification

Hauser, R. & Guler, O.

2001

hauser7

url

url

url

url

url

url

url



Self-scaled barriers for irreducible symmetric cones

Hauser, R. & Lim, Y.

2001

Hayase01 Exact Location of the Steiner Point of the Three-Point Steiner Minimum Tree in $$-Geometry

Hayase, M.

Electronics and Communications in Japan, Part 3 , Vol. 84 , pp. 84-94 , 2001

hayes1 Graph Theory in Practice

Hayes, B.

American Scientist , Vol. 88 , pp. 9-13 (Part I), 104-109 (Part II) , 2000

Haynes98funda Fundamentals of Domination in Graphs

Haynes, T.W.; Hedetniemi, S.T. & P.J.Slater

Marcel Dekker Inc. , 1998

HeMor00 Hybrid genetic algorithms for telecommunications network back-up routeing

He, L. & Mort, N.

BT Technol. J. , Vol. 18 , pp. 42-50 , 2000

He82 The gap function of a convex program

Hearn, D.

Operations Research Letter , Vol. 1 , pp. 67-71 , 1982

He87 Restricted simplicial decomposition: Computation and extensions

Hearn, D.; Lawphongpanich, S. & Ventura, J.




He85 Finiteness in restricted simplicial decomposition

Hearn, D.; Lawphongpanich, S. & Ventura, J.


He81 Convergence of the Frank-Wolfe method for certain bounded variable traffic assignment problems

Hearn, D. & Ribeira, J.


hjm Bond pricing and the term structure of interest rates --- a new methodology for contingent claims valuation

Heath, D.C.; Jarrow, R.A. & Morton, A.J.


Hea1 Numerical Methods for Large Sparse Linear Least Squares Problems

Heath, M.T.


He83 Optimization of Alternative Routing Networks with Regard to Existing Equipment and Modularities

Hedberg, I.

Vol. Session 4.3A , 1983

hedetneimi91dom-bib Bibliography on domination in graphs and some basic definitions of domination parameters

Hedetniemi, S.T. & Laskar, R.C.




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.


HeldK The travelling salesman problem and minimum spanning trees

Held, M. & Karp, R.M.


HeKa71 The Traveling Salesman Problem and Minimum Spanning Trees: Part II

Held, M. & Karp, R.


Held:Karp:2 The Traveling Salesman Problem and Minimum Spanning Trees: Part II

Held, M. & Karp, R.


HK71 The traveling salesman problem and minimum spanning trees: Part II

Held, M. & Karp, R.


HeKa70 The Traveling Salesman Problem and Minimum Spanning Trees



Held, M. & Karp, R.


Held:Karp The Traveling Salesman Problem and Minimum Spanning Trees

Held, M. & Karp, R.


HK70 The traveling salesman problem and minimum spanning trees

Held, M. & Karp, R.


HeldWolfeCrowder1974 Validation of subgradient optimization

Held, M.; Wolfe, P. & Crowder, H.


Held:Wolfe:Crowder Validation of Subgradient Optimization



HeWoCr74 Validation of Subgradient Optimization



NETFLO NETFLO

Helgason, R.V. & Kennington, J.L.

1985

HeHe00



A new heuristic method for frequency assignment

Hellebrandt, M. & Heller, H.

Jan. 2000

helmberg13 Numerical evaluation of SBmethod

Helmberg, C.


helmberg10 A Cutting Plane Algorithm for Large Scale Semidefinite Relaxations

Helmberg, C.

2001

helmberg11 SBmethod: a C++ implementation of the spectral bundle method

Helmberg, C.

2000

helmberg4 Fixing variables in semidefinite relaxations

Helmberg, C.


helmberg8 Semidefinite Programming for Combinatorial Optimization

Helmberg, C.

2000

sdp_webpage Semidefinite Programming Homepage

Helmberg, C.

1996

url

url

url

url



helmberg7 A Spectral Bundle Method with Bounds

Helmberg, C. & Kiwiel, K.


helmberg12 Bundle methods to minimize the maximum eigenvalue function

Helmberg, C. & Oustry, F.

pp. 307-337 , 2000

helmberg3 Combining semidefinite and polyhedral relaxations for integer programs

Helmberg, C.; Poljak, S.; Rendl, F. & Wolkowicz, H.

Vol. 920 , pp. 124-134 , 1995

helmberg6 A spectral bundle method for semidefinite programming

Helmberg, C. & Rendl, F.


helmberg1 Solving Quadratic (0,1)-Problems by Semidefinite Programs and Cutting Planes

Helmberg, C. & Rendl, F.


helmberg2 An interior point method for semidefinite programming

Helmberg, C.; Rendl, F.; Vanderbei, R.J. & Wolkowicz, H.


helmberg9 A semidefinite programming approach to the quadratic knapsack problem

url

url

url



Helmberg, C.; Rendl, F. & Weismantel, R.


helmberg5 Quadratic knapsack relaxations using cutting planes and semidefinite programming

Helmberg, C.; Rendl, F. & Weismantel, R.

Vol. 1084 , pp. 175-189 , 1996

Hel89 Designing satellite communication networks by zero-one quadratic programming

Helme, M. & Magnanti, T.

Networks , Vol. 19 , pp. 427-450 , 1989

Helme:Magnanti Designing satellite communication networks by zero-one quadratic programming

Helme, M. & Magnanti, T.

Networks , Vol. 19 , pp. 427-450 , 1989

HelvigEtAL01 An Improved Approximation Scheme for the Group Steiner Problem

Helvig, C.; Robins, G. & Zelikovsky, A.

Networks , Vol. 37 , pp. 8-20 , 2001

DarJacJoh03 The theory and practice of simulated annealing

Henderson, D.; Jacobson, S. & Johnson, A.

pp. 287-319 , 2003

hendrickson1 The molecule problem: Exploiting structure in global optimization

Hendrickson, B.




00hen Beyond-tera-bit-per-second-capacity optical core networks

Henmi, N.

Optical Sensing in Semiconductor Manufacturing, Electro-Optics in Space, Broadband Optical Networks , pp. IV49 - IV50 , 2000

MathiasPhD Ring Network Design in Telecommunications: Optimization Based Solution Approaches

M. Henningsson

Linköping University , 2003

HeHo-RR03-17 Lagrangean Price Directive Ring Generation for Network Design

Henningsson, M. & Holmberg, K.

2003

HeHo-RR03-18 Calculating Cost Coefficients for Generation of Rings in Network Design


2003

HeHo-RR03-19 A Ring Generation Problem Based on the Traveling Salesman Sub tour Problem


2003

HeHoRoVa02 Ring Network Design by Lagrangean Based Column Generation

Henningsson, M.; Holmberg, K.; Rönnqvist, M. & Värbrand, P.




HeHoRoVa-RR03-16 A Ring Network Design Problem and Heuristics for Generating a Set of Feasible Rings


2003

HeHoRoVa-RR03-20 A Ring Network Design Problem Solved by a Ring Generation and Allocation Approach


2003

HeHoRoVa-RR03-21 A Column Generation Approach for a Ring Network Design Problem


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.


Heragu1 Recent models and techniques for solving the layout problem

Heragu, S.S.


Heragu2 Experimental analysis of simulated annealing based algorithms for the layout problem



Heragu, S.S. & Alfa, A.S.


Heragu3 Efficient models for the facility layout problem

Heragu, S.S. & Kusiak, A.


Hernandex:Khoshnevis Optimization of telephone wire gauges for transmission standards

Hernandez, L. & Khoshnevis, B.


HeIoMiPr96 Fixed-charge capacitated network design problem

Herrmann, J.; Ioannou, G.; Minis, I. & Proth, J.M.


Hershberger-Suri-2001 Vickrey Prices and Shortest Paths: What is an Edge Worth?

Hershberger, J. & Suri, S.

Proceedings of the 42nd IEEE symposium on Foundations of Computer Science , pp. 255-262 , 2001

hershenson1 Optimal design of a CMOS op-amp via geometric programming

Hershenson, M.d.M.; Boyd, S.P. & Lee, T.H.


dhertog7 Interior Point Approach to Linear, Quadratic and Convex

Programming, Algorithms and Complexity

D. den Hertog

url



Faculty of Mathematics and Informatics, TU Delft , 1992

dhertog5 A sufficient condition for self-concordance, with applications to some classes of structured convex programming problems

Hertog, D.d.; Jarre, F.; Roos, C. & Terlaky, T.


dhertog6 A logarithmic barrier cutting plane method for convex programming problems

Hertog, D.d.; Kaliski, J.; Roos, C. & Terlaky, T.


dHerRoos A survey of search directions in interior point methods for linear programming

Hertog, D.d. & Roos, C.


dhertog8 Adding and deleting constraints in the logarithmic barrier method for LP

Hertog, D.d.; Roos, C. & Terlaky, T.

pp. 166-185 , 1994

dHertog9147 A build-up variant of the path-following method for LP



dHerRoosTer1 A potential-reduction variant of Renegar's short-step path-following method for linear programming





hertz2 A tabu search heuristic for the capacitated arc routing problem

Hertz, A.; Laporte, G. & Mittaz, M.


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.


HrzRcZir A quadratically convergent method for linear programming

Herzel, S.; Recchioni, M.C. & Zirilli, F.


herzel2 Two interior-point algorithms for a class of convex programming problems



Herzel, S. & Todd, M.J.

1994

Herzog97 Sharing the ``cost'' of multicast trees: An axiomatic analysis

Herzog, S.; Shenker, S. & Estrin, D.


HesserMannerStucky Optimisation of Steiner trees using genetic algorithms

Hesser; Manner & Stucky

Proceedings of the Third International Conference on Genetic Algorithms , 1989

hettich1 Semi-infinite programming: theory, methods and applications

Hettich, R. & Kortanek, K.O.


Heuvel03 Coloring the Square of a Planar Graph

Heuvel, J.v.d. & McGuinness, S.


Heyman2003 Sizing Internet backbone links

Heyman, D.

2003

HeymanLakshmanNeidhardt2003 A new method for analyzing feedback-based protocols with applications to engineering Web traffic over the Internet

Heyman, D.; Lakshman, T. & Neidhardt, A.




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.


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.


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.


higle6 An introductory tutorial on stochastic linear programming models



Higle, J.L. & Sen, S.

Interfaces , Vol. 29(2) , pp. 33-61 , 1999

higle5 Statistical approximations for stochastic linear programming problems



higle3 Duality and statistical tests of optimality for two stage stochastic programs



higle2 Finite master programs in regularized stochastic decomposition



higle1 Stochastic decomposition: an algorithm for two-stage linear programs with recourse



HilWhi60a A method for finding the shortest route through a road

network

Hillier, J. & Whiting, P.

Operation Research Quarterly , Vol. 11 , pp. 37-40 , 1960

hipolito1 A weighted least squares study of robustness in interior point linear programming



Hipolito, A.


hirl91 Convex Analysis and Minimization Algorithms I

Hiriart-Urruty, J.B. & Lemarechal, C.


hiriarturruty1 Convex analysis and minimization algorithms I

Hiriart-Urruty, J. & Lemaréchal, C.


hiriarturruty1and2 Convex analysis and minimization algorithms, Volumes I and II



hiriarturruty2 Convex analysis and minimization algorithms II



HUL93II Convex Analysis and Minimization Algorithms II, Advanced Theory and Bundle Methods



Hjo95a The vehicle routing problem and local search

metaheuristics

C.A. Hjorring



University of Auckland , 1995

HoVijayanWong New algorithms for the rectilinear Steiner tree problem

Ho, J.; Vijayan, G. & Wong, C.K.


ho1 Reconciliation of Various Complexity and Condition Measures for Linear Programming Problems and a Generalization of Tardos' Theorem

Ho, J.C.K. & Tunçel, L.

2000

Ho:Mouftah:Wu A scalable design of multigranularity optical cross-connects for the next-generation optical Internet

Ho, P.; Mouftah, H. & Wu, J.


HoLeongMedardKoetterChangEffros04 On the utility of network coding in dynamic environments

Ho, T.; Leong, B.; Medard, M.; Koetter, R.; Chang, Y. & Effros, M.

2004

hosten1 Gomory integer programs

Hoten, S. & Thomas, R.R.


hoa82 Topological optimization of networks: a nonlinear mixed integer model employing generalized Benders decomposition

Hoang, H.

IEEE Trans. Automatic Control , Vol. ACC-27 , pp. 164-169 , 1982

url



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.


Hochbaum83:Efficient Efficient bounds for the stable set, vertex cover, and set packing problems

Hochbaum, D.


HS Test Examples for Nonlinear Programming Codes

Hock, W. & Schittkowski, K.




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. & Müller, 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.


HoPa3 Solving Airline Crew Scheduling Problems by Branch-and-Cut

Hoffman, K.L. & Padberg, M.


HoPa2 Improving LP-Representation of Zero-One Linear Programs for Branch-



and-Cut



HoPa LP-based combinatorial problem solving



Hoffman:Padberg2 Solving airline crew-scheduling problems by branch-and-cut

Hoffman, K. & M.~Padberg


Hoffman:Padberg1 Improving LP-representations of zero-one linear programs for branch-and-cut

Hoffman, K. & M.~Padberg


Hofri87 Packet Delay under the Golden Ratio Weighted TDM Policy in a Multiple-Acces 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.


holder1 Analytic central path, sensitivity analysis and parametric linear programming



Holder, A.G.; Sturm, J.F. & Zhang, S.

1998

Holland75 Adaption in Natural and Artificial Systems

Holland, J.H.

University of Michigan Press , 1975

Hol92 Genetic algorithms

Holland, J.

Scientific American , Vol. 267 , pp. 44-50 , 1992

Hol75 Adaptation in natural and artificial systems

Holland, J.

University of Michigan Press , 1975

Hol74 An extension of the Frank and Wolfe method of feasible directions

Holloway, C.


holw88 Column/Constraint Generation for Quadratic Assignment Problems

Holm, S. & Walukiewicz, S.


Holma WCDMA for UMTS

Holma, H. & Toskala, A.


HoHe98



Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound

Holmberg, K. & Hellstrand, J.


holmberg1 Solving the uncapacitated network design problem by a Lagrangean heuristic and branch-and-bound

Holmberg, K. & Hellstrand, J.


Holmberg:Ronnqvist:Yuan An exact algorithm for the capacitated facility location problems with single sourcing

Holmberg, K.; Rönnqvist, M. & Yuan, D.


Holmberg:Yuan_2004 Optimization of Internet protocol network design and routing

Holmberg, K. & Yuan, D.

Networks , Vol. 43 , pp. 39-53 , 2004

HolmbergYuan04 Optimization of Internet Protocol Network Design and Routing


Networks , Vol. 43 , pp. 39-53 , 2004

Holmberg:Yuan_2003 A multicommodity network-flow problem with side constraints on paths solved by column generation



Holmberg:Yuan_2000 A Lagrangian heuristic based branch-and-bound approach for the



capacitated network design problem



HY00 A Lagrangean heuristic based branch-and-bound approach for the capacitated network design problem



Holmberg:Yuan_1998 A Lagrangian approach to network design problems



HY98 A Lagrangean approach to network design problems



HolmbergYuan1996 A Lagrangean heuristic Based branch-and-Bound approach for the capacitated network design problem


1996

HolMigPar98a A GRASP algorithm for the single source uncapacitated minimum concave-cost network flow problem

Holmqvist, K.; Migdalas, A. & Pardalos, P.

Vol. 40 , pp. 131-142 , 1998

HolMigPar97a Greedy randomized adaptive search for a location

problem with economies of scale



Holmqvist, K.; Migdalas, A. & Pardalos, P.

pp. 301-313 , 1997

Holte-2001 Combinatorial auctions, knapsack problems, and hill-climbing search

Holte, R.C.

Proc. AI'2001, the 14th Biennial Conference of the Canadian Society for Computational Studies of Intelligence , Vol. 2056 , pp. 57-66 , 2001

HomerPeinado96 Experiments with polynomial-time CLIQUE approximation algorithms on very large graphs

Homer, S. & Peinado, M.

Vol. 26 , pp. 147-167 , 1996

HLP98 An efficient multicast routing algorithm for delay-sensitive applications with dynamic membership

Hong, S.; Lee, H. & Park, B.

Proceedings of IEEE INFOCOM'98 , pp. 1433-1440 , 1998

Hong99 Advances in predictive data mining methods

Hong, S.J. & Weiss, S.M.

Proceedings of First International Workshop in Machine Learning, Data Mining and Pattern Recognition , Vol. 1715 , 1999

hong1 Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra

Hong, S. & Tunçel, L.

2004

HongXueKuhChengHuang Performance-driven Steiner tree algorithms for global routing

url



Hong, X.; Xue, T.; Kuh, E.S.; Cheng, C. & Huang, J.


Hooker Solving nonlinear multiple-facility network location problems

Hooker, J.N.

Networks , Vol. 19 , pp. 117-133 , 1989

hooker_opt1 Logic-based Benders decomposition

Hooker, J.N. & Ottosson, G.


HooStu99a Towards a characterisation of the behaviour of stochastic local search algorithms for SAT

Hoos, H. & Stützle, T.

Artificial Intelligence , Vol. 112 , pp. 213-232 , 1999

Hoos00:Solving Solving combinatorial auctions using stochastic local search

Hoos, H. & Boutilier, C.

in Proceedings of the National Conference on Artificial Intelligence (AAAI) , pp. 22-29 , 2000

Hopfield82 Neural networks and physical systems with emergent collective computational abilities

Hopfield, J.J.


HopfieldTank85 ``Neural'' computation of decisions in optimization problems

Hopfield, J.J. & Tank, D.W.



Biological Cybernetics , Vol. 52 , pp. 141-152 , 1985

hoppe1 The quickest transshipment problem

Hoppe, B. & Tardos, E.


horn2 Topics in Matrix Analysis

Horn, R.A. & Johnson, C.


horn1 Matrix Analysis

Horn, R.A. & Johnson, C.


Ho76 An Algorithm for Nonconvex Programming Problems

Horst, R.


HorstA2000 Introduction to Global Optimization

Horst, R.; Pardalos, P.M. & Thoai, N.V.


horst1 Concave minimization via conical partitions and polyhedral outer approximation

Horst, R.; Thoai, N.V. & Benson, H.P.


horst2



Global Optimization

Horst, R. & Tuy, H.


hor90 Global Optimization - Deterministic Approaches

Horst, R. & Tuy, H.


hort93 Global Optimization (Deterministic Approaches)

Horst, R. & Tuy, H.


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 CHKS-functions for monotone linear complementarity problems

Hotta, K.; Inaba, M. & Yoshise, A.

1998

hotta1 Global convergence of a class of non-interior-point algorithms using Chen-Harker-Kanzow functions for nonlinear complementarity problems

Hotta, K. & Yoshise, A.

1996

HouTsai01 An access-based clustering protocol for multihop wireless ad hoc networks

url

url



Hou, T.C. & Tsai, T.J.

IEEE Journal on Selected Areas in Commnications , Vol. 19 , pp. 1201-1210 , 2001

HougardyKirchner Lower Bounds for the Relative Greedy Algorithm for Approximating Steiner Trees

Hougardy, S. & Kirchner, S.

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.


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.




des93-7 On finding a minimum augmentation to biconnect a graph

Hsu, T. & Ramachandran, V.


des91-4 A linear time algorithm for triconnectivity augmentation

Hsu, T. & Ramachandran, V.

Proc. 32nd Annual IEEE Symposium on Foundations of Computer Science , pp. 548-559 , 1991

HsuEtAL05 Two Variations of the Minimum Steiner Problem

Hsu, T.; Tsai, K.; Wang, D. & Lee, D.


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.


huleida04 Traffic grooming, routing, and wavelength assignment in optical WDM mesh networks

Hu, J.Q. & Leida, B.


Hu_2003



Diverse routing in optical mesh networks

Hu, J.


hu02 Traffic Grooming in Wavelength-division-multiplexing Ring Networks: A Linear Programming Solution

Hu, J.


Hu_2002 Traffic grooming in wavelength-division-multiplexing ring networks: a linear programming solution

Hu, J.


huModiano04 Traffic Grooming in WDM Networks

Hu, J. & Modiano, E.

Vol. II , 2005

Hu74 Optimum communication spanning tree

Hu, T.

SIAM J. Comput. , Vol. 3 , pp. 188-195 , 1974

Hu63 Multi-commodity network flows

Hu, T.


HuShuaiJiaZhang04 Multicast Routing and Wavelength Assignment in WDM Networks with Limited Drop-offs



Hu, X.; Shuai, T.; Jia, X. & Zhang, M.

2004

00hon Hamiltonian cycle protection: a novel approach to mesh WDM optical network protection

Huang, H. & Copeland, J.

High Performance Switching and Routing, 2001 IEEE Workshop on , pp. 31 - 35 , 2001

04hco Hybrid wavelength and sub-wavelength routed optical networks

Huang, H. & Copeland, J.


HuangRicha04 Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks

Huang, H.; Richa, A.W. & Segal, M.

Mobile Networks and Applications , Vol. 9 , pp. 151-161 , 2004

huang00survey A survey on web information retrieval technologies

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.

url



Nature , Vol. 401 , pp. 131 , 1999

Hui:Ou:Mukherjee Path-protection routing and wavelength assignment (RWA) in WDM mesh networks under duct-layer constraints

Hui, Z.; Ou, C. & Mukherjee, B.


05hui Traffic grooming in WDM networks with multi-layer switches

Huiban, G.; Perennes, S. & Syska, M.

ICC 2002 , Vol. 5 , pp. 2896 - 2901 , 2002

Hung2 An asymptotical $O(nL)$-iteration path-following linear programming algorithm that uses wide neighborhoods

Hung, P. & Ye, Y.


Hung1 An asymptotical $O(nL)$-iteration path-following linear programming algorithm that uses long steps

Hung, P. & Ye, Y.

1994

HAU58 Studies in linear and non-linear programming

Hurwicz, L.; Arrow, K. & Uzawa, H.

Stanford University Press , 1958

huston:99b Interconnection, Peering, and Settlements

Huston, G.

Proc. INET , 1999



huygens04 Two Edge-Disjoint Hop-Constrained Paths and Polyhedra

Huygens, D.; Mahjoub, A. & Pesneau, P.


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.


HwangEuclidean A linear time algorithm for full Steiner trees

Hwang, F.K.


Hwa79a An $O(n log n)$ algorithm for rectilinear minimal spanning trees

Hwang, F.K.



J. of the ACM , Vol. 26 , pp. 177-182 , 1979

Hwang On Steiner minimal trees with rectilinear distance

Hwang, F.K.


HwangDu Steiner minimal trees on the Chinese checkerboard

Hwang, F.K. & Du, D.Z.

Mathematics Magazine , Vol. 64 , pp. 332-339 , 1991

HwangRichards Steiner tree problems

Hwang, F.K. & Richards, D.S.

Networks , Vol. 22 , pp. 55-89 , 1992

HwangRichardsWinter The Steiner Tree Problem

Hwang, F.K.; Richards, D.S. & Winter, P.


Hwangetal92 The Steiner Tree Problem

Hwang, F.K.; Richards, D. & Winter, P.


HY90 Comments on Bern's probabilistic results on rectilinear Steiner trees

Hwang, F.K. & Yao, Y.C.


HwangChangLee The searching over separators strategy to solve some NP-hard problems in



subexponential time

Hwang, R.Z.; Chang, R.C. & Lee, R.C.T.


Hwang99 Adaptive multicast routing in multirate loss networks

Hwang, R.


hyy98 Wavelength Assignment and Routing in WDM Networks

Hyytiä, E. & Virtamo, J.

Fourteenth Nordic Teletraffic Seminar, NTS-14 , 1998

HyyVir98 Wavelength assignment and routing in WDM networks

Hyytiã, E. & Virtamo, J.

Nordic Teletraffic Seminar 14 , pp. 31-40 , 1998

Hastad-1999 Clique is hard to approximate within $n^1-$

H stad, J.

Acta Mathematica , Vol. 182 , pp. 105-142 , 1999

hastad Clique is hard to approximate within $n^1-$

H}stad, J.

Acta Mathematica , Vol. 182 , pp. 105-142 , 1999

Iannaccone-IP-restore Feasibility of IP Restoration in a Tier-1 Backbone

Iannaccone, G.; Chuah, C.; Bhattacharyya, S. & Diot, C.


url



Ibarra:Kim Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

Ibarra, O. & Kim, C.


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



The complexity of approximating the class Steiner tree problem

Ihler, E.

1991

IhlerApprox The complexity of approximating the class Steiner tree problem

Ihler, E.

1991

Ihler90 Bounds on the quality of approximate solutions to the group Steiner problem

Ihler, E.

1990

IhlerGroup Bounds on the quality of approximate solutions to the group Steiner problem

Ihler, E.

1990

IhlerReichWidmayer99 Class Steiner trees and VLSI-design

Ihler, E.; Reich, G. & Widmayer, P.


ilhan1 An Efficient Exact Algorithm for the Vertex p-Center Problem

2001

illes2 Polynomial Affine-Scaling Algorithms for $P_*()$ Linear Complementarity Problems

Illés, T.; Peng, J.; Roos, C. & Terlaky, T.

url

url



1998

illes1 Polynomial Affine-Scaling Algorithms for $P_*()$ Linear Complementarity Problems

Illés, T.; Roos, C. & Terlaky, T.

1997

ILC97 A Delay Constrained Distributed Multicast Routing Algorithm

Im, Y.; Lee, Y.; Wi, S. & Choi, Y.


ImLeeWiChoi97 Delay constrained distributed multicast routing algorithm

Im, Y.; Lee, Y.; Wi, S. & Choi, Y.


ImaseWaxman The dynamic Steiner tree problem

Imase, M. & Waxman, B.

SIAM Journal of Discrete Mathematics , Vol. 4 , pp. 369-384 , 1991

IW91 Dynamic Steiner tree problems

Imase, M. & Waxman, B.


imielinska1 A greedy heuristic for a minimum-weight forest problem

Imieliska, C.; Kalantari, B. & Khachiyan, L.


infanger2 Monte Carlo (importance) sampling within a Bender's decomposition for

url



stochastic linear programs

Infanger, G.


infanger1 Cut sharing for multistage stochastic linear programs with interstage dependency

Infanger, G. & Morton, D.P.


Ingelrest04 A dominating sets and target radius based localized activity scheduling and minimum energy broadcast protocol for ad hoc and sensor networks

Ingelrest, F.; Simplot-Ryl, D. & Stojmenovic, I.

Proceedings of the 3rd IFIP Mediterranean Ad Hoc Networking Workshop (MED-HOC-NET) , pp. 351-359 , 2004

Inmon93 Building the data warehouses

Inmon, W.H.


pew2005 Search Engine Users

Internet, P. & Project, A.L.

January 2005

IorTriLiaWal99a Predicting muscle fatigue via electromyography: a

comparative study

Iorvik, V.; Triantaphyllou, E.; Liao, T. & Waly, <.

Proceedings of the 25th International Conference

on Computers and Industrial Engineering

url



, pp. 277-280 , 1999

Iraschko-Grover Optimal capacity placement for path restoration in STM or ATM mesh survivable networks

Iraschko, R.R.; MacGregor, M. & Grover, W.D.

IEEE/ACM Trans. on Networking , Vol. 6 , pp. 325-336 , 1998

IrMa90 Optimal Capacity Placement for Path Restoration in STM or ATM Mesh-Survivable Networks

Iraschko, R.R.; MacGregor, M.H. & Grover, W.D.


Iraschko:Grover A highly efficient path-restoration protocol for management of optical network transport integrity

Iraschko, R. & Grover, W.


Iraschko:MacGregor:Grover Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks

Iraschko, R.; MacGregor, M. & Grover, W.


IriImai A multiplicative barrier function method for linear programming

Iri, M. & Imai, H.


Momentum IST-EC Momentum project: Models and simulations for network planning and control of UMTS

IST-EC website ,



1999

istrail1 Statistical Mechanics, Three-Dimensionality and NP-completeness. 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

Iusem, A. & Monteiro, R.D.C.

1997

IvanovTuzhelin Minimal networks: The Steiner problem and its generalizations

Ivanov, A.O. & Tuzhelin, A.A.

CRC Press , 1994

IvanovTuzhelinCieslik03 Steiner Ratio for Manifolds

Ivanov, A.; Tuzhelin, A. & Cieslik, D.

Mathematical Notes , Vol. 74 , pp. 367–-374 , 2003

IvanovTuzhilin01 Extreme Networks

Ivanov, A. & Tuzhilin, A.

Acta Applicandae Mathematicae , Vol. 66 , pp. 251-317 , 2001

url

url



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.


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

Jünger, M. & Kaibel, V.


junger7 On the SQAP-polytope



junger8 A basic study of the QAP polytope

url

url




1996

junger10 Maximum planar subgraphs and nice embeddings --- practical layout tools

Jünger, M. & Mutzel, P.


junger12 The traveling salesman problem

Jünger, M.; Reinelt, G. & Rinaldi, G.

Vol. 7 , 1995

junger4 Practical performance of efficient minimum cut algorithms

Jünger, M.; Rinaldi, G. & Thienel, S.

1997

junger9 Solving large-scale traveling salesman problems with parallel branch-and-cut

Jünger, M. & Störmer, P.

1995

junger5 Introduction to ABACUS --- A Branch-And-CUt System

Jünger, M. & Thienel, S.


jun97 Introduction to ABACUS - A Branch-And-Cut System


1997

url

url

url



junger6 The design of the branch-and-cut system ABACUS


1997

junger11 Provably good solutions for the traveling salesman problem

Jünger, M.; Thienel, S. & Reinelt, G.

ZOR -- Mathematical Methods of Operations Research , Vol. 40 , pp. 183-217 , 1994

junt98 Introduction to ABACUS - a branch-and-cut system



judice1 A study of preconditioners for network interior point methods

Júdice, J.J.; Patrício, J.M.; Portugal, L.F.; Resende, M.G.C. & Veiga, G.


judice2 A truncated interior point method for the solution of minimum cost flow problems on an undirected multicommodity network

Júdice, 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.


99jmk Optical Cross Connects for Optical Networking

url

url



Jackman, N.A.; Patel, S.H.; Mikkelsen, B.P. & Korotky, S.K.

Bell Labs Technical Journal , Vol. Jan , pp. 262-281 , 1999

Jackson-1976 Technology for spectrum markets.

C. Jackson

Department of Electrical Engineering,Massachusetts Institute of Technology,Cambridge,MA , 1976

Ja83 Heuristics for the Capacitated Plant Location Model

Jacobsen, S.


JaegerGoldberg1994 A polynomial algorithm for the equal capacity $p$-center problem on trees

Jaeger, M. & Goldberg, J.


JagadeeschEtAl02 Combining hierarchical and heuristic techniques for high-speed route computation on road networks

Jagadeesch, G.; Srikanthan, T. & Quek, K.

Computing & Control Engineering Journal , pp. 120-126 , 2002

Jagerman75 Nonstationary Blocking in Telephone Traffic

Jagerman, D.L.

Bell System Technical Journal , pp. 625-661 , 1975

Jagota95 Approximating maximum clique with a Hopfield network

Jagota, A.

IEEE Trans. Neural Networks , Vol. 6 , pp. 724-735 , 1995



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.


Jaillet:Song:Yu Airline network design and hub location problems

Jaillet, P.; Song, G. & Yu, G.


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.


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



Design of reliable networks

Jan, R.


Jan93 Topological optimization of a communication network subject to a reliability constraint

Jan, R.; Hwang, F. & Chen, S.


jansen4 A family of polynomial affine scaling algorithms for for positive semidefinite linear complementary problems

Jansen, B.; Roos, C. & Terlaky, T.


jansen5 Primal-dual target following algorithms for linear programming

Jansen, B.; Roos, C.; Terlaky, T. & Vial, J.


Jansen1 Interior-point methodology for linear programming: duality, sensitivity analysis and computational aspects

Jansen, B.; Roos, C.; Terlaky, T. & Vial, J.

1993

jansen3 Improved complexity using higher-order correctors for primal-dual Dikin affine scaling

Jansen, B.; Roos, C.; Terlaky, T. & Ye, Y.


Jansen2 Polynomiality of primal-dual affine scaling algorithms for url



nonlinear complementarity problems

Jansen, B.; Roos, C.; Terlaky, T. & Yoshise, A.

Mathematical Programming , pp. 315-345 , 1997

Jan97 Approximation results for wavelength routing in directed trees

Jansen, K.

Proceedings of the 2nd Workshop on Optics and Computer Science , pp. ??-?? , 1997

jlr Random Graphs

Janson, S.; }uczak, T. & Ruciski, A.

John Wiley & Sons Incorporated , 2000

JaKi99 An optimal solution to the ``Philadelphia'' channel assignment problem

Janssen, J. & Kilakos, K.


JaWe00 Lower bounds from tile covers for the channel assignment problem

Janssen, J. & Wentzell, T.

2000

JarKoe O minimalnich grafech, obsahujicich n danych bodu

Jarnik, V. & Kössler, M.

Casopis pro Pestovani Matematiky a Fysiky , pp. 223-235 , 1934

jarre10 On an Approximation of the Hessian of the Lagrangian

Jarre, F.

2003

url



jarre8 Comparing two interior point approaches for semi-infinite programs

Jarre, F.

1999

jarre6 A QQP-Minimization Method for Semidefinite and Smooth Nonconvex Programs

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.


Jarre On the convergence of the method of analytic centers when applied to convex quadratic programs

Jarre, F.


jarre7 Optimal truss design by interior point methods

Jarre, F.; Kocvara, M. & Zowe, J.

SIAM Journal on Optimization , to appear

jarre2 A Practical Interior-Point Method For Convex Programming

Jarre, F. & Saunders, M.


jarre5

url

url

url



Extending Mehrotra's corrector for linear programs

Jarre, F. & Wechs, M.

1996

jarre9 Interior-point methods

Jarre, F. & Wright, S.

2000

jarre4 On the role of the objective function in barrier methods

Jarre, F. & Wright, S.

1994

jau-web Network and Traffic Data Sets for Optical Network Optimization

Jaumard, B.

2005

jau_web nsf and eon traffic data sets of Krishnaswamy (1998)

Jaumard, B.

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

url



JaMaMeVo02 Comparison of column generation models for channel assignment in cellular networks

Jaumard, B.; Marcotte, O.; Meyer, C. & Vovor, T.


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


2004

jau04c Comparison of ILP Formulations for the RWA Problem


2004

jau04d Decomposition Methods for the RWA Problem


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



Jaumard, B. & Yu, X.

jeffcoat1 Simulated annealing for resource-constrained scheduling

Jeffcoat, D.E. & Bulfin, R.L.


Jendrol01 Local structures in plane maps and distance colorings

Jendrol', S. & Skupie, Z.


JeongLeeParkPark02 A branch-and-price algorithm for the Steiner tree packing problem

Jeong, G.; Lee, K.; Park, S. & Park, K.


jmbo Lethality and certainty in protein networks

Jeong, H.; Mason, S.; Barabási, 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. & Barabási, 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



On the local convergence of a predictor-corrector method for semidefinite programming

Ji, J.; Potra, F.A. & Sheng, R.


JiCor01 Differential Destination Multicast -- A MANET Multicast Routing Protocol for Small Groups

Ji, L. & Corson, M.S.

Proc. IEEE INFOCOM 2001 , pp. 1192-1201 , 2001

jia01efficient An efficient distributed algorithm for constructing small dominating sets

Jia, L.; Rajaraman, R. & Suel, T.

Distributed Computing , Vol. 15 , pp. 193-205 , 2002

J98 A Distributed Algorithm of Delay-Bounded Multicast Routing for Multimedia Applications in Wide Area Networks

Jia, X.


JiaHuDu02 Multiwavelength Optical Networks

Jia, X.; Hu, X. & Du, D.


JPM97 A real-time multicast routing algorithm for multimedia applications

Jia, X.; Pissinou, N. & Makki, K.

Computer Commun. J. , Vol. 20 , pp. 1098-1106 , 1997

JiaWang97 A group multicast routing algorithm by using multiple minumum Steiner trees

url



Jia, X. & Wang, L.


JiaDuHuHuLi02 Placement of Wavelength Converters for Minimal Wavelength Usage in WDM Networks

Jia, X.; Du, D.; Hu, X.; Huang, H. & Li, D.


jia01 Optimization of Wavelength Assignment for QoS Multicast in WDM Network

Jia, X.; Du, D.; Hu, X.; Lee, M. & Gu, J.


Jordon96 A Pricing Model for High Speed Networks with Guaranteed Quality of Service

Jiang, H. & Jordon, S.

Proceedings of IEEE INFOCOM , pp. 888-895 , 1996

hjiang1 Smooth SQP methods for mathematical programs with nonlinear complementarity constraints

Jiang, H. & Ralph, D.


jiang1 A Long Step Primal-Dual Path Following Method for Semidefinite Programming

Jiang, J.


tjiang1 Optimization problems in molecular biology



Jiang, T. & Li, M.

pp. 195-216 , 1994

JiangZhong04 A Multicast Routing Algorithm for P2P Networks

Jiang, T. & Zhong, A.

pp. 452-455 , 2004

J92 Routing broadband multicast streams

Jiang, X.


JiangZhang05 Applying Multi-medians Location and Steiner Tree Methods into Agents Distributed Blackboard Architecture Construction

Jiang, Y. & Zhang, S.

pp. 923-929 , 2005

JiangYiZhangZhong05 Constructing agents blackboard communication architecture based on graph theory

Jiang, Y.; Yi, P.; Zhang, S. & Zhong, Y.

Computer Standards & Interfaces , Vol. 27 , pp. 285-301 , 2005

jibetean1 Converging Semidefinite Bounds for Global Unconstrained Polynomial Optimization

Jibetean, D. & Laurent, M.

2004

JinNahrstedt MC-SPF: AN APPLICATION-LEVEL MULTICAST SERVICE PATH FINDING PROTOCOL FOR MULTIMEDIA APPLICATIONS

Jin, J. & Nahrstedt, K.

url



JinGalHab00a Métaheuristiques 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.


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.


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

Johnson, C.A. & Sofer, A.

1997

url



crjohnson1 An interior-point method for approximate positive semidefinite completions

Johnson, C.R.; Kroschel, B. & Wolkowicz, H.


JMHJ01 The dynamic source routing protocol for mobile ad hoc networks

Johnson, D.B.; Maltz, D.A.; Hu, Y. & Jetcheva, J.G.

2001

Johnson74 Approximation algorithms for combinatorial problems

Johnson, D.S.

J. Comput. Syst. Sci. , Vol. 9 , pp. 256-278 , 1974

dsjohnson2 Experimental Analysis of Heuristics for the ATSP

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

Johnson, D.S. & McGeoch, L.A.

pp. 369-443 , 2002

JLR78 The complexity of the network design problem

Johnson, D.; Lenstra, J. & Kan, A.R.

Networks , Vol. 8 , pp. 279-285 , 1978

JLK78 The complexity of the network design problem

url

url

url



Johnson, D.; Lenstra, J. & Kan, A.R.

Networks , Vol. 8 , pp. 279-285 , 1978

JMP00 The prize collecting Steiner tree problem: Theory and practice

Johnson, D.; Minkoff, M. & Phillips, S.

pp. 760-769 , 2000

joh89 Modeling and Strong Linear Programs for Mixed Integer Programming

Johnson, E.L.

Vol. 51 , pp. 1-41 , 1989

johnson3 Min-cut clustering

Johnson, E.L.; Mehrotra, A. & Nemhauser, G.L.


johnson1 Recent developments and future directions in mathematical programming

Johnson, E.L. & Nemhauser, G.L.

IBM Systems Journal , Vol. 31 , pp. 79-93 , 1992

johnson2 Progress in linear programming-based algorithms for integer programming: an exposition

Johnson, E.L.; Nemhauser, G.L. & Savelsbergh, M.W.P.


Johnson Modeling and strong linear programs for mixed integer programming

Johnson, E.

Algorithms and Model Formulations in Mathematical Programming , 1989



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.


jones1 Multicommodity Network Flows --- The Impact Of Formulation On Decomposition

Jones, K.L.; Lustig, I.J.; Farvolden, J.M. & Powell, W.B.


JUNOSroute JUNOS Internet Software Configuration Guide: Routing and Routing Protocols, Release 4.3

Jones, M. & Mitchell, D.

Juniper Networks Inc. , 2001

JoJi95 Connection Establishment in High-Speed Networks

Jordan, S. & Jiang, H.


JothiRaghavachari04a Approximation Algorithms for the Capacitated Minimum Spanning Tree

url



Problem and Its Variants in Network Design

Jothi, R. & Raghavachari, B.

pp. 805-818 , 2004

JothiRaghavachari04b Improved Approximation Algorithms for the Single-Sink Buy-at-Bulk Network Design Problems


pp. 336-348 , 2004

JothiRaghavachari01 Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design


pp. 805-818 , 2001

joy1 A branch-and-cut algorithm for MAX-SAT and weighted MAX-SAT

Joy, S.; Borchers, B. & Mitchell, J.E.

Vol. 35 , pp. 519-536 , 1997

joy2 Applying clique cuts to MAX-SAT and weighted MAX-SAT problems

Joy, S.; Borchers, B. & Mitchell, J.E.

1997

joy3 Solving MAX-SAT and weighted MAX-SAT problems using branch-and-cut

Joy, S.; Mitchell, J.E. & Borchers, B.

1998

faria1 Power transmission network design by a greedy randomized adaptive path relinking approach

url

url



Faria Jr., H.; Binato,; S. & Resende, M.G.C.

2001

JuiPol98a A sampling-based heuristic for tree search applied

to grammar induction

Juillé, H. & Pollack, J.

Proceedings of the Fifteenth National Conference

on Artificial Intelligence

, 1998

Julstrom A genetic algorithm for the rectilinear Steiner problem

Julstrom, B.A.

Proceedings of the Fifth International Conference on Genetic Algorithms , 1993

Julstrom01 Encoding Rectilinear Steiner Trees as Lists of Edges

Julstrom, B.

pp. 356-360 , 2001

JungEtAl04 Modeling change requests due to faults in a large-scale telecommunication system

Jung, H.; Lim, Y. & Chung, C.

The Journal of Systems and Software , Vol. 72 , pp. 235-247 , 2004

juttner:00 On Solvability of an OSPF Routing Problem

Juttner, A.; Szentesi, A.; Harmatos, J.; Pioro, M. & Gajowniczek, P.

Proc. Nordic Teletraffic Seminar , 2000

Jun1



Polyhedral Combinatorics and the Acyclic Subdigraph Problem

Jünger, M.

Heldermann , 1985

Junger3 Solving the maximum weight planar subgraph problem by branch and cut

Jünger, M. & Mutzel, P.

1993

Junger2 Practical problem solving with cutting plane algorithms in combinatorial optimization

Jünger, M.; Reinelt, G. & Thienel, S.

Vol. 20 , pp. 111-152 , 1995

koppe1 Cutting planes from a mixed integer Farkas lemma

Köppe, M. & Weismantel, R.


KaPa98 Interconnecting LANs and a FDDI Backbone Using Transparent Bridges: A Model and Solution Algorithms

Kaefer, F. & Park, J.


KahngRobinsBook On Optimal Interconnections for VLSI

Kahng, A.B. & Robins, G.


KahngRobins A new class of iterative Steiner tree heuristics with good performance





KahngRobinsBounds On performance bounds for a class of rectilinear Steiner tree heuristics in arbitrary dimension


IEEE Transactions on Computer-Aided Design , Vol. 11 , 1992

02kai Joint operation in multi-hop WDM networks under dynamic data traffic

Kai, W.; Qingji, Z. & Yizhi, X.

WCC - ICCT 2000 , Vol. 2 , pp. 1205 - 1208 , 2000

CaragiannisEtAl04 Power Consumption Problems in Ad-Hoc Wireless Networks

Kaklamanis, I.C.C. & Kanellopoulos, P.

pp. 252-255 , 2004

Kalakota97 Electronic commerce: A manager's guide

Kalakota, R. & Whinston, A.B.


KalYe9111 A decomposition variant of the potential reduction algorithm for linear programming

Kaliski, J.A. & Ye, Y.


haglin1 Logarithmic barrier decomposition methods for semi-infinite programming

Kaliski, J.; Haglin, D.; Roos, C. & Terlaky, T.

International Transactions in Operations Research , Vol. 4 , pp. 285-303 , 1997

url



kall1 SLP-IOR: An interactive model management system for stochastic linear programs

Kall, P. & Mayer, J.


kawa94 Stochastic programming

Kall, P. & S.~Wallace


kall2 Stochastic Programming

Kall, P. & Wallace, S.W.

John Wiley , 1994

kallio1 An interior point method for solving systems of linear equations and inequalities

Kallio, M. & Salo, S.


KalpakisSherman Probabilistic analysis of an enhanced partitioning algorithm for the Steiner problem in $R^d$

Kalpakis, K. & Sherman, A.T.

Networks , Vol. 24 , pp. 147-159 , 1994

kalvelagen1 On Solving The Progressive Party Problem as a MIP

Kalvelagen, E.

2001

kalvenes05 Hierarchical Cellular Network Design with Channel Allocation

url

url

url



Kalvenes, J.; Kennington, J. & Olinick, E.V.

To appear in European Journal of Operational Research , Vol. 160 , pp. 3-18 , 2005

kamath6 Efficient Continuous Algorithms for Combinatorial Optimization

A. P. Kamath

Department of Computer Science, Stanford University , 1995

Kamath1 An $O(nL)$ iteration algorithm for computing bounds in quadratic optimization problems

Kamath, A.P. & Karmarkar, N.K.

pp. 254-268 , 1993

Kamath2 A continuous approach to compute upper bounds in quadratic maximization problems with integer constraints


pp. 125-140 , 1992

kamath7 A continuous method for computing bounds in integer quadratic optimization problems



kamath5 Computational and Complexity results for an Interior Point Algorithm on Multi-Commodity Flow Problem

Kamath, A.P.; Karmarkar, N.K. & Ramakrishnan, K.G.

1993

kamath8 Tail bounds for occupancy and the satisfiability threshold conjecture

url



Kamath, A.P.; Motwani, R.; Palem, K. & Spirakis, P.


kamath4 Improved Interior Point Algorithms for Exact and Approximate solution of Multi-commodity Flow Problems

Kamath, A.P. & Palmon, O.

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms , pp. 502-511 , 1995

Kameda00 Braess-like paradoxes in distributed computer systems

Kameda, H.; Altman, E.; Kozawa, T. & Hosokawa, Y.

2000

kamin1 Optimal portfolio revision with a proportional transaction cost

Kamin, J.H.


Kamvar03 Extrapolation methods for accelerating PageRank computations

Kamvar, S.; Haveliwala, T.; Manning, C. & Golub, G.


KangTan1997 Design of packet switched network with unreliable links

Kang, C. & Tan, H.


KaTa97 Combined channel allocation and routing algorithms in packet switched networks

Kang, C. & Tan, H.




KaLePaPaKi00 Design of Local Networks Using USHRs

Kang, D.; Lee, K.; Park, S.; Park, K. & Kim, S.


Kang:Park:Park ATM VP-based network design

Kang, J.; Park, K. & Park, S.


kantor1 The orienteering problem with time windows

Kantor, M.G. & Rosenwein, M.B.


Kaplan-IPOM Resilient IP Network Design

Kaplan, H.

2003

kapoor2 Speeding up Karmarkar's algorithm for multicommodity flows

Kapoor, S. & Vaidya, P.


KapVai Fast algorithms for convex programming and multicommodity flows

Kapoor, S. & Vaidya, P.

Proceedings of the 18th annual ACM symposium on the theory of computing , pp. 147-159 , 1988

KapsalisRaywardsmithSmith



Solving the graphical Steiner tree problem using genetic algorithms

Kapsalis, F.; Rayward-Smith, V.J. & Smith, F.

Journal of the Operational Research Society , Vol. 44 , 1993

Kar05 Efficient minimization over products of simplices and its application to nonlinear multicommodity network problems

Karakitsiou, A.; Mavrommati, A. & Migdalas, A.

ORIJ , Vol. 4 , pp. GET PAGES <<<>>>> GET PAGES , 2005

KarasanEtAl02 Mesh topology design in overlay virtual private networks

Karasan, E.; Ekin-Karasan, O.; Akar, N. & Pinar, M.


Kar02a Solving the cutting stock problem in the steel industry

Karelahti, J.

Department of Engineering Physics and Mathematics,

Helsinki University of Technology

, 2002

karger4 A randomized fully polynomial time approximation scheme for the all-terminal network reliability problem

Karger, D.


karger2 Random sampling in cut, flow, and network design problems

Karger, D.


karger1



Randomization in graph optimization problems: A survey

Karger, D.

Optima , Vol. 58 , pp. 1-11 , 1998

karger3 Approximate graph coloring by semidefinite programming

Karger, D.; Motwani, R. & Sudan, M.

J. of the ACM , Vol. 45(2) , pp. 246-265 , 1998

CDMA2000 W-CDMA and CDMA2000 for 3G Mobile Networks

Karim, M.R.; Sarraf, M. & Lawrence, V.B.

McGraw Hill Professional , 2002

karisch4 Semidefinite programming: Theory and applications

Karisch, S.E.

1997

karisch1 Semidefinite Programming and Graph Equipartition

Karisch, S.E. & Rendl, F.

Vol. 18 , pp. 77-95 , 1998

karisch2 Lower bounds for the quadratic assignment problem

Karisch, S.E. & Rendl, F.


karisch5 Soving graph bisection problems with semidefinite programming

Karisch, S.E.; Rendl, F. & Clausen, J.


url

url

url



qzhao1 Semidefinite programming relaxations for the quadratic assignment problem

Karisch, S.E.; Rendl, F.; Wolkowicz, H. & Zhao, Q.


karisch3 Semidefinite programming relaxations for the quadratic assignment problem

Karisch, S.E.; Rendl, F.; Wolkowicz, H. & Zhao, Q.

1996

KH79 An algorithmic approach to network location problems, Part II: The $p$-medians

Kariv, O. & Hakimi, L.

SIAM Journal of Applied Mathematics , Vol. 37 , pp. 539-560 , 1979

KarivHakimi1979 An algorithmic approach to network location problems. I: The $p$-centers

Kariv, O. & Hakimi, S.

SIAM Journal of Applied Mathematics , Vol. 37 , pp. 513-538 , 1979

KarlinStudden66 Tchebycheff systems: With applications in analysis and statistics

Karlin, S. & Studden, W.

Interscience Publishers , 1966

karloff1 How good is the Goemans-Williamson MAX CUT algorithm?

Karloff, H.

SIAM Journal on Computing , Vol. 29(1) , pp. 336-350 , 1999

Ka96

url

url

url



Some aspects of charging in ATM networks

Karlsson, J.

pp. 567-573 , 1996

Karmarkar84 A new polynomial-time algorithm for linear programming

Karmarkar, N.

Combinatorica , pp. 373-395 , 1984

Kar2 An interior-point approach to NP-complete problems --- Part I

Karmarkar, N.K.

pp. 297-308 , 1991

Kar1 A New Polynomial-Time Algorithm for Linear Programming

Karmarkar, N.K.


KARMARKAR1 A New Polynomial Time Algorithm for Linear Programming

Karmarkar, N.K.


KARMARKAR2 Implementation and Computational Results of the Karmarkar Algorithm for Linear Programming, Using an Iterative Method for Computing Projections

Karmarkar, N.K. & Ramakrishnan, K.G.

1988

karmarkar5 Computation Optimizer

Karmarkar, N.K. & Ramakrishnan, K.G.



1987

KRR2 An interior point algorithm to solve computationally difficult set covering problems

Karmarkar, N.K.; Resende, M.G.C. & Ramakrishnan, K.G.


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.




KarpinskiZelikovsky97 New Approximation Algorithms for the Steiner Tree Problems

Karpinski, M. & Zelikovsky, A.


KZ95 New approximation algorithms for the Steiner tree problems

Karpinski, M. & Zelikovsky, A.


KarpinskiEtAl05 Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem

Karpinski, M.; andoiu, I.M.; Olshevsky, A. & Zelikovsky, A.


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



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.


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

Karypis, G.

1999

karypis1 Multilevel $k$-way hypergraph partitioning

Karypis, G. & Kumar, V.

VLSI Design , Vol. 11 , pp. 285-300 , 2000

karypis3 A parallel algorithm for multilevel graph partitioning and sparse matrix ordering

Karypis, G. & Kumar, V.

url

url

url



Journal of Parallel and Distributed Computing , Vol. 48(1) , pp. 71-95 , 1998

Kaski04 Packing Steiner trees with identical terminal sets

Kaski, P.


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.


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



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.


Kawatra:Bricker_2004 Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs

Kawatra, R. & Bricker, D.


KawatraBricker04 Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs



Kawatra:Bricker_2000 A multiperiod planning model for the capacitated minimal spanning tree problem



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



nodes

Ke, W. & Wang, S.


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.


Kellerer-etal-2004 Knapsack Problems

Kellerer, H.; Pferchy, U. & Pirsinger, D.


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.




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.


Kel97 Charging and rate control for elastic traffic

Kelly, F.


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

Kelly, T.E. & Ecker, J.G.

1997

kelly2 Numerical verification of second-order sufficiency conditions for

url



nonlinear programming

Kelly, T.K. & Kupferschmid, M.


Kelso-Crawford-1982 Job Matching, Coalition formation and Gross Substitutes

Kelso, A.S. & Crawford, V.P.


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.


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



Kennington, J. & Lewis, M.


KenMoh97 An Efficient Dual Simplex Optimizer for Generalized Networks

Kennington, J. & Mohamed, R.

pp. 153-182 , 1997

KenOli03 Wavelength Routing and Assignment in a Survivable WDM Mesh Network

Kennington, J. & Olinick, E.


KeOl03 Robust Solutions for the DWDM Routing and Provisioning Problem: Models and Algorithms

Kennington, J.; Olinick, E.; Lewis, K.; Ortynski, A. & Spiride, G.


kensha77 An effective subgradient procedure for minimal cost multicommodity flow problems

Kennington, J. & Shalaby, M.


KenWhi98 Simplex versus cost scaling algorithms for pure networks: An empirical analysis

Kennington, J. & Whitler, J.

1998

Ke78 A survey of linear cost multicommodity network flows

Kennington, J.F.




kenn04 Wavelength Translation in WDM networks: optimization models and solution procedures

Kennington, J.L. & Olinick, E.V.


kennington1 An efficient decomposition algorithm to optimize spare capacity in a telecommunications network

Kennington, J.L. & Whitler, J.E.


KeNaRa99 Optimization Based Algorithms for Finding Minimal Cost Ring Covers in Survivable Networks

Kennington, J.; Nair, V. & Rahman, M.


KenOli02 Wavelength Routing and Assignment in a Survivable WDM Mesh Network

Kennington, J. & Olinick, E.

2002

kenyon Options in leasing: the effect of idle time

Kenyon, C. & Tompaidis, S.


Keon03 Optimal Pricing for Multiple Services in Telecommunications Networks Offering Quality-of-Service Guarantee

Keon, N. & Anandalingam, G.




Keon:Anandalingam Optimal pricing for multiple services in telecommunications networks offering quality-of-service guarantees

Keon, N. & Anandalingam, G.


kerivin1 A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems

Kerivin, H. & Mahjoub, A.R.


kerivin02 Separation of the partition inequalities for the (1,2)-survivable network design problem

Kerivin, H. & Mahjoub, A.


Kerivin:Mahjoub Separation of partition inequalities for the (1,2)-survivable network design problem

Kerivin, H. & Mahjoub, A.


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.


kerlin70



An efficient heuristic procedure for partitioning graphs

Kernighan, B. & Lin, S.

Bell Syst. Techn. J. , Vol. 49 , pp. 291-307 , 1970

Ke93 Telecommunication network design algorithms

Kershenbaum, A.

Mc Graw Hill , 1993

Ker93 Telecommunications network design algorithms

Kershenbaum, A.

McGraw Hill , 1993

Ker81a A note on finding Shortest Path Trees

Kershenbaum, A.

Networks , Vol. 11 , pp. 399-400 , 1981

kesavan1 The decomposition heuristic partI: convex problems

Kesavan, P. & Barton, P.I.

1999

Keskinocak01 Decision support for managing an electronic supply chain

Keskinocak, P.; Goodwin, R.; Wu, F.; Akkiraju, R. & Murthy, S.

Electronic Commerce Research , Vol. 1 , pp. 15-31 , 2001

Khachian79 A polynomial algorithm in linear programming

Khachian, L.G.

Soviet Mathematics Doklady , Vol. 20 , pp. 1093-1096 , 1979



Khachiyan3 Rounding of polytopes in the real number model of computation

Khachiyan, L.G.


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.


KhouryPardalos96 A heuristic for the Steiner problem in graphs



Khoury, B. & Pardalos, P.


des96-4 Approximation algorithms for finding highly

connected subgraphs

Khuller, S.

Approximation Algorithms for NP-Hard Problems , 1996

des93-4 Approximation algorithms for graph augmentation

Khuller, S. & Thurimella, R.


des94-7 Biconnectivity approximations and graph car-vings

Khuller, S. & Vishkin, U.


KhullerZhu02 The General Steiner Tree-Star problem

Khuller, S. & Zhu, A.


Kh74 An Efficient Heuristic Procedure for the Capacitated Warehouse Location Problem

Khumawala, B.

Naval Research Logist. Quarterly , Vol. 20 , pp. 609-623 , 1974

Kh72 An Efficient Branch and Bound Algorithm for the Warehouse Location Problem



Khumawala, B.


kilakos1 Fractional and integer colourings

Kilakos, K. & Marcotte, O.


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.


Kim:Chung:Tcha Optimal design of the two-level distributed network with dual homing local connections

Kim, H.; Chung, S. & Tcha, D.


KCCJ02 A Polynomial Time Approximation Scheme for the Grade of Service Steiner Minimum Tree Problem

Kim, J.; Cardei, M.; Cardei, I. & Jia, X.




KimNaz1 The decomposition principle and algorithms for linear programming

Kim, K. & Nazareth, J.L.


KimEtAl04a On Core Selection Algorithm for Reducing Delay Variation of Many-to-Many Multicasts with Delay-Bounds

Kim, M.; Bang, Y. & Choo, H.

pp. 200-210 , 2004

KimEtAl04b Efficient Algorithm for Reducing Delay Variation on Bounded Multicast Trees

Kim, M.; Bang, Y. & Choo, H.

pp. 440-450 , 2004

KimChaKim00 A channel allocation for cellular mobile radio systems using simulated annealing

Kim, S.; Chang, K. & Kim, S.


skim2 Exact Solutions of Some Nonconvex Quadratic Optimization Problems via SDP and SOCP Relaxations

Kim, S. & Kojima, M.


skim3 CMPSm : A Continuation Method for Polynomial Systems (MATLAB version)


url

url



2002

skim1 Second Order Cone Programming Relaxation of Nonconvex Quadratic Optimization Problems



skim4 Second order cone programming relaxation of a positive semidefinite constraint

Kim, S.; Kojima, M. & Yamashita, M.


Kim:Lee Modeling and analysis of the dynamic location registration and paging in microcellular systems

Kim, S. & Lee, C.


Kim:Kim Exact algorithm for the surrogate dual of an integer programming problem: subgradient method approach

Kim, S. & Kim, S.


KK02 A new traffic-load shedding scheme in the WCDMA mobile communication systems

Kim, W. & Kang, C.

Proc. of Veh. Tech. Conf. , Vol. 4 , pp. 2405-2409 , 2002

KindStam An Introduction to Variational Inequalities and Their Applications

Kinderlehrer, D. & Stampacchia, G.

url

url




king2 Duality and martingales: a stochastic programming perspective on contingent claims

King, A.


king1 Issues in Risk Modeling for Multi-Stage Systems

King, A.J.; Takriti, S. & Ahmed, S.

1997

Kingman68 The Ergodic Theory of Subadditive Stochastic Processes

Kingman, J.

Journal of the Royal Statistical Society. Ser. B , Vol. 30 , pp. 499-510 , 1968

KingstonSheppard03 On reductions for the Steiner Problem in Graphs

Kingston, J. & Sheppard, N.

Journal of Discrete Algorithms , Vol. 1 , pp. 77–-88 , 2003

RaghuKiran:SivaRamMurthy QoS based survivable logical topology design in WDM optical networks

Kiran, G.R. & Murthy, C.S.R.


KirGelVec83 Optimization by simulated annealing

Kirkpatrick, S.; Gelatt Jr., C. & Vecchi, M.

Science , Vol. 220 , pp. 671-680 , 1983

KGV83

url



Optimization by Simulated Annealing

Kirkpatrick, S.; Gelatt, C. & Vecchi, M.

Science , Vol. 220 , pp. 671-680 , 1983

KirkpatrickA83 Optimization by simulated annealing

Kirkpatrick, S.; Gellat Jr., C.D. & Vecchi, M.P.

Science , Vol. 220 , pp. 671-680 , 1983

kiwiel11 Convergence and efficiency of subgradient methods for quasiconvex minimization

Kiwiel, K.C.


kiwiel6 A bundle Bregman proximal method for convex nondifferentiable minimization

Kiwiel, K.C.


kiwiel3 Efficiency of the analytic center cutting plane method for convex minimization

Kiwiel, K.C.


kiwiel4 Free-steering relaxation methods for problems with strictly convex costs and linear constraints

Kiwiel, K.C.


kiwiel2 Complexity of some cutting plane methods that use analytic centers



Kiwiel, K.C.


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.


kiwiel9 Proximity control in bundle methods for convex nondifferentiable minimization

Kiwiel, K.C.


kiwiel10 Methods of Descent of Nondifferentiable Optimization

Kiwiel, K.C.

Springer , 1985

kiwiel12 An aggregate subgradient method for nonsmooth convex minimization

Kiwiel, K.C.


kiwiel5 The efficiency of ballstep subgradient level methods for convex optimization

Kiwiel, K.C.; Larsson, T. & Lindberg, P.O.




kiwiel7 Proximal decomposition via alternating linearization

Kiwiel, K.C.; Rosa, C.H. & Ruszczynski, A.


klabjan2 A parallel primal-dual simplex algorithm

Klabjan, D.; Johnson, E.L. & Nemhauser, G.L.


Klabjan:Johnson:Nemhauser_2000 A parallel primal-dual simplex algorithm

Klabjan, D.; Johnson, E. & Nemhauser, G.


klabjan1 The complexity of cover inequality separation

Klabjan, D.; Nemhauser, G.L. & Tovey, C.L.


klabjan3 Airline crew pairing generation in parallel

Klabjan, D. & Schwan, K.

1999

klamroth1 Single-facility location problems with barriers

Klamroth, K.


klarbring1 Existence of solutions to discrete semicoercive frictional contact problems

url



Klarbring, A. & Pang, J.


KlauEtAl04 Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem

Klau, G.; Ljubic, I.; Moser, A.; Mutzel, P.; Neuner, P.; Pferschy, U.; Raidl, G. & Weiskircher, R.

2004

kleel Diameters of random graphs

Klee, V. & Larman, D.

Canadian Journal of Mathematics , Vol. 33 , pp. 618-640 , 1981

KlMi How good is the simplex algorithm?

Klee, V. & Minty, G.J.

pp. 159-175 , 1972

kleijnen1 Optimization versus robustness in simulation: a practical methodology, with a production-management case-study

Kleijnen, J.P.C. & Gaury, E.

2001

KleijnenEtAl04 Response surface methodology's steepest ascent and step size revisited

Kleijnen, J.; Hertog, D.d. & Angün, E.


Kle67a A Primal Method for Minimal Cost Flows with

Applications to the Assignment and Transportation

Problems

url



Klein, M.


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.


KleinRavi A nearly best-possible approximation algorithm for node-weighted Steiner trees

Klein, P. & Ravi, R.


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



MIT, Cambridge , 1996

kleinberg1 The Lovász theta function and a semidefinite programming relaxation of vertex cover

Kleinberg, J. & Goemans, M.X.


KleKum99 Wavelength Conversion in Optical Network

Kleinberg, J. & Kumar, A.

Proc. 10th ACM-SIAM Symposium on Discrete Algorithms (SODA) , pp. 566-575 , 1999

kl The structure of the Web

Kleinberg, J. & Lawrence, S.

Science , Vol. 294 , pp. 1849-1850 , 2001

kleinberg3 The structure of the web

Kleinberg, J. & Lawrence, S.

Science , Vol. 294 , pp. 1849-1850 , 2001

Kle96 Approximation algorithms for disjoint paths problems

J.M. Kleinberg

MIT , 1996

Kl93 On the modeling and analysis of computer networks

Kleinrock, L.


Kl75



Queueing Systems, Vol.II: Computer Applications

Kleinrock, L.

Wiley , 1975

Kleinrock75 Queueing Systems, Vol. I

Kleinrock, L.

Wiley $&$ Sons, New York , 1975

Klei74 Queueing systems, Volume II: Computer applications

Kleinrock, L.


Kleinrock1970 Analytic and simulation methods in computer network design

Kleinrock, L.

Cong. Rec., Spring Joint Comput. Conf., AFIPS Conf Proc. 36 , pp. 568-579 , 1970

Kle64 Communication nets: Stochastic message flow and delay

Kleinrock, L.

McGraw-Hill , 1964

KleinrockKamoun1980 Optimal clustering structures for hierarchical topological design of large computer networks

Kleinrock, L. & Kamoun, F.

Networks , Vol. 10 , pp. 221-248 , 1980

Klemperer99 Auction theory: A guide to the literature

Klemperer, P.

Journal of Economic Surveys , Vol. 13 , pp. 227-186 , 1999



deklerk12 Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications

de Klerk, E.


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

de Klerk, E.; van Maaren, H. & Warners, J.P.

Journal of Automated Reasoning , Vol. 24 , pp. 37-65 , 2000

deklerk9 Approximation of the stability number of a graph via copositive programming

de Klerk, E. & Pasechnik, D.V.


deklerk11 Products of positive forms, linear matrix inequalities, and Hilbert 17-th problem for ternary forms

de Klerk, E. & Pasechnik, D.V.

2001

deklerk8 On approximate graph colouring and MAX-$k$-CUT algorithms based on the $$-function

de Klerk, E.; Pasechnik, D.V. & Warners, J.P.

2000

url

url

url

url

url



deklerk7 A scaled Gauss-Newton Primal-Dual Search Direction for Semidefinite Optimization

de Klerk, E.; Peng, J.; Roos, C. & Terlaky, T.

1999

deklerk1 Polynomial Primal-dual Affine Scaling Algorithms in Semidefinite Programming

de Klerk, E.; Roos, C. & Terlaky, T.


deklerk3 Infeasible start, semidefinite programming algorithms via self-dual embeddings


1997

deklerk4 Initialization in semidefinite programming via a self-dual skew-symmetric embedding



deklerk2 On primal-dual path following algorithms for semidefinite programming


1996

deklerk10 Semidefinite programming approaches for MAX-2-SAT and MAX-3-SAT: computational perspectives

de Klerk, E. & Warners, J.P.

1998

url

url

url

url



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.


KlincewiczLuss1986 A Lagrangian relaxation heuristic for capacitated facility location with single-source constraints

Klincewicz, J.G. & Luss, H.


KlincewiczLussYan1998 Designing tributary networks with multiple ring families

Klincewicz, J.G.; Luss, H. & Yan, D.C.K.


Kli02a Enumeration and search procedures for a hub location

problem with economies of scale

Klincewicz, J.


Klincewicz A dual algorithm for the uncapacitated hub location problem

Klincewicz, J.


Kli92a Avoiding local optima in the $p$-hub location

pdf url

pdf url



problem using tabu search and GRASP

Klincewicz, J.


Kli83 Newton method for convex separable network flow problems

Klincewicz, J.

Networks , Vol. 13 , pp. 427-442 , 1983

KlLuYa98 Designing Tributary Networks with Multiple Ring Families

Klincewicz, J.; Luss, H. & Yan, D.


KliRaj94a Using GRASP to solve the component grouping

problem

Klincewicz, J. & Rajan, A.


KlincewiczSchmittWong2002 Incorporating QoS into IP Enterprise Network Design

Klincewicz, J.; Schmitt, J. & Wong, R.


klingman1 Netgen: A program for generating large scale capacitated assignment, transportation, and minimum cost network flow problems

Klingman, D.; Napier, A. & Stutz, J.


KNEPLEY

pdf url



Minimum Cost Design for Circuit Switched Networks

Knepley, J.E.

1973

kniker1 Itinerary-based airline fleet assignment

Kniker, T.S.; Barnhart, C. & Lohatepanont, M.

2000

KnoHar02 Fast Optimum Routing and Wavelength Assignment for WDM Ring Transport Networks

Knoke, M. & Hartmann, H.

International Conference on Communications , pp. ??-?? , 2002

knox1 Tabu search performance on the symmetric traveling salesman problem

Knox, J.


Knuth94 The sandwich theorem

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

url

url



Kno69 Graphentheoretische Methoden und ihre Anwendungen

Knödel, 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.


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


Networks , Vol. 32 , pp. 207-232 , 1998

KochMartin98 Solving Steiner Tree Problems in Graphs to Optimality


Networks , Vol. 32 , pp. 207-232 , 1998

KochMartin url



Solving Steiner tree problems in graphs to optimality


1996

KMV00 SteinLib: An Updated Library on Steiner Tree Problems in Graphs

Koch, T.; Martin, A. & Vo}, S.

pp. 285-325 , 2001

kocvara2 PENNON -- A code for convex nonlinear and Semidefinite Programming

Kocvara, M. & Stingl, M.

2002

kocvara1 PENNON -- A Generalized Augmented Lagrangian Method for Semidefinite Programming

Kocvara, M. & Stingl, M.

2001

Kodialam:Lakshman Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information

Kodialam, M. & Lakshman, T.


KoGr04 Multiple-Quality of Protection Classes Including Dual-Failure Survivable Services in $p$-Cycle Networks

Kodian, A. & Grover, W.D.

2005

KoGr05 Failure Independent Path Protecting p-Cycles: Efficient and Simple Fully

url

url



Pre-connected Optical Path Protection

Kodian, A. & Grover, W.D.

Journal of Lightwave Technology , 2005

KoGr03 Ring-Mining to $p$-Cycles as a Target Architecture: Riding Demand Growth into Network Efficiency

Kodian, A.; Grover, W.D.; Slevinsky, J. & Moore, D.

Proceedings of the 19th Annual National Fiber Optics Engineers Conference (NFOEC 2003) , pp. 1543-1552 , 2003

Koh Steiner problem in octilinear routing model

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.


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

url



Kohlmorgen, U.; Schmeck, H. & Haase, K.


kojima16 An Extension of Sums of Squares Relaxations to Polynomial Optimization Problems over Symmetric Cones

Kojima, M.

2004

kojima15 A General Framework for Convex Relaxation of Polynomial Optimization Problems over Cones

Kojima, M.

2002

kojima12 Moderate Nonlinearity = Convexity + Quadratic Concavity

Kojima, M.

1999

Koj1 Determining basic variables of optimal solutions in Karmarkar's new LP algorithm

Kojima, M.


kojima7 Linear algebra for semidefinite programming

Kojima, M.; Kojima, S. & Hara, S.

1994

KojMeg1 The relation between the path of centers and Smale's regularization of the linear programming problem

Kojima, M. & Megiddo, N.

url

url

url

url




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.


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.


kojima3 A Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Using the Alizadeh-Haeberly-Overton Search Direction

Kojima, M.; Shida, M. & Shindoh, S.


kojima4 A note on the Nesterov-Todd and the Kojima-Shindoh-Hara Search Directions in Semidefinite Programming



url

url



kojima6 Search Directions in the SDP and the Monotone SDLCP: Generalization and Inexact Computation



kojima2 Local Convergence of Predictor-Corrector Infeasible-Interior-Point Algorithms for SDPs and SDLCPs



kojima5 Interior point methods for the monotone semidefinite linear complementarity problem in symmetric matrices

Kojima, M.; Shindoh, S. & Hara, S.


kojima13 Complexity Analysis of Successive Convex Relaxation Methods for Nonconvex Sets

Kojima, M. & Takeda, A.

Mathematics of Operations Research , Vol. 26 , 2001

kojima14 On the Finite Convergence of Successive SDP Relaxation Methods

Kojima, M. & Tunçel, L.

1999

kojima10 Discretization and Localization in Successive Convex Relaxation Methods for Nonconvex Quadratic Optimization Problems

Kojima, M. & Tuncel, L.


url

url

url

url

url



kojima8 Cones of matrices and successive convex relaxations of nonconvex sets



kojima11 Monotonicity of primal-dual interior-point algorithms for semidefinite programming problems



kojima9 Cones of matrices and successive convex relaxations of nonconvex sets


1998

Kol What if They Closed 42d Street and Nobody Noticed?

Kolata, G.

The New York Times , 1990

kolchin Random Graphs

Kolchin, V.F.


kolda1 Optimization by direct search: new perspectives on some classical and modern methods

Kolda, T.G.; Lewis, R.M. & Torczon, V.


00kom

url

url



IP access service provision for broadband customers

Komisarczuk, P.

Services Over the Internet - What Does Quality Cost? (Ref. No. 1999/099), IEE Colloquium on , pp. 5/1 - 5/4 , 1999

komlosi1 Quasiconvex first-order approximations and Kuhn-Tucker type optimality conditions

Komlósi, S.


KomlosShing Probabilistic partitioning algorithms for the rectilinear Steiner problem

Komlós, J. & Shing, M.T.

Networks , Vol. 15 , pp. 413-423 , 1985

KPP93a Two Distributed Algorithms for the Constrained Steiner Tree Problem

Kompella, V.; Pasquale, J. & Polyzos, G.

Proceedings of the Second International Conference on Computer Communications and Networking (ICCCN'93) , pp. 343-349 , 1993

KPP92 Multicasting for Multimedia Applications


Proceedings of IEEE INFOCOM'92 , pp. 2078-2085 , 1992

JPR96 Optimal multicast routing with quality of service constraints


Journal of Network and Systems Management , Vol. 4 , pp. 107-131 , 1996

KPP93 Multicast routing for multimedia communication





01kon Algorithm for traffic grooming in optical networks to minimize the number of transceivers

Konda, V. & Chow, T.

High Performance Switching and Routing , pp. 218 - 221 , 2001

koning1 Introduction: Sport and computers

Koning, R.H.; Sierksma, G. & van de Velde, S.


KonjevodKrumkeMarathe04 Budget constrained minimum cost connected medians

Konjevod, G.; Krumke, S. & Marathe, M.

Journal of Discrete Algorithms , Vol. 2 , pp. 453–469 , 2004

KonjevodRaviSrinivasan02 Approximation Algorithms for the Covering Steiner Problem

Konjevod, G.; Ravi, R. & Srinivasan, A.

Random Structures & Algorithms , Vol. 20 , pp. 465-482 , 2002

konno1 A cutting plane algorithm for solving bilinear programs

Konno, H.


konno5 Cutting plane algorithms for nonlinear semi-definite programming problems with applications

Konno, H.; Kawadai, N. & Tuy, H.




konno2 Linear multiplicative programming

Konno, H. & Kuno, T.


konno3 Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints

Konno, H. & Wijayanayake, A.


konno4 Minimal concave cost rebalance of a portfolio to the efficient frontier

Konno, H. & Yamamoto, R.


KonBar95a A GRASP for the vehicle routing problem with time

windows

Kontoravdis, G. & Bard, J.


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.


pdf url



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.


KorLazOr Avoiding the Braess Paradox in Non-Cooperative Networks

Korilis, Y.A.; Lazar, A.A. & Orda, A.


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.


Ko97 Capacity allocation under non-cooperative routing

Korillis, Y.; Lazar, A. & Orda, A.


kortanek7 A Decade of Semi-Infinite Programming: 1962--1972 url



Kortanek, K.O.

2000

kortanek6 Observations on Infeasibility Detectors for Classifying Conic Convex Programs

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.


KoShi Convergence results and numerical experiments on a linear programming hybrid algorithm

Kortanek, K.O. & Shi, M.


kortanek4 An infeasible interior-point algorithm for solving primal and dual geometric programs

Kortanek, K.O.; Xu, X. & Ye, Y.


kortanek5 Perfect duality in semi-infinite programming and semidefinite programming

url

url



Kortanek, K.O. & Zhang, Q.


KortePromelSteger Steiner trees in VLSI-layout

Korte, B.; Prömel, H.J. & Steger, A.

pp. 185-214 , 1990

korzak1 Convergence analysis of inexact infeasible-interior-point algorithms for solving linear programming problems

Korzak, J.


koskosidis1 An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints

Koskosidis, Y.A.; Powell, W.B. & Solomon, M.M.


koster1 The partial constraint satisfaction problem: Facets and lifting

Koster, A.M.C.A.; van Hoesel, C.P.M. & Kolen, A.W.J.

Operations Reseach Letters , Vol. 23 , pp. 89-97 , 1998

Kothari03:Solving Solving combinatorial exchanges: Optimality via a few partial bids

Kothari, A.; Sandholm, T. & Suri, S.

Proceedings of the ACM Conference on Electronic Commerce (ACM-EC) , pp. 236-237 , 2003

KMB81 A fast algorithm for Steiner trees

Kou, L.; Markowsky, G. & Berman, L.



Acta Informatica , Vol. 15 , pp. 141-145 , 1981

Kou81 A Fast Algorithm for Steiner Trees



Kouetal A fast algorithm for Steiner trees



Kou90 On efficient implementation of an approximation algorithm for the Steiner tree problem

Kou, L.


Ko05 Optimization in e-commerce

Kourgiantakis, M.; Mandalianos, I.; Migdalas, A. & Pardalos, P.

2005

Kourgiantakis03 E-commerce: A survey for Cretan agro-food sector

Kourgiantakis, M.; Matsatsinis, N. & Migdalas, A.

2003

Kousik:Ghosh:Murthy A heuristic procedure for leasing channels in telecommunications networks

Kousik, I.; Ghosh, D. & Murthy, I.


Kou99



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.


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.


KraPelRusTer98a A GRASP approach to the protein structure

prediction problem

1998

krau



Extensions du problème de Weber

S. Krau

Ecole Polytechnique de Montréal , 1997

Kreidi:Sanso Optimization of an internationally distributed air-ground airline telecommunication system

Kreidi, A. & Sansò, B.


Kriesell03 Edge-disjoint trees containing some given vertices in a graph

Kriesell, M.

Journal of Combinatorial Theory , Vol. Series B 88 , pp. 53–-65 , 2003

krishna95 A Cluster-based Approach for Routing in Ad-Hoc Networks

Krishna, P.; Chatterjee, M.; Vaidya, N.H. & Pradhan, D.K.

Proceedings of the USENIX Symposium on Location Independent and Mobile Computing , pp. 1-8 , 1995

krishna97 A cluster-based approach for routing in dynamic networks

Krishna, P.; Vaidya, N.; Chatterjee, M. & Pradhan, D.

ACM SIGCOMM Computer Communication Review , pp. 49-65 , 1997

krishnamachari03 On the Complexity of Distributed Self-Configuration in

Wireless Networks

Krishnamachari, B.; Wicker, S.; Béjar, R. & Fernández, C.


kartik3



Linear programming approaches to semidefinite programming problems

K. Krishnan


Krishnan02 The Buffer-Bandwidth Tradeoff Curve is Convex

Krishnan, K. & Mandjes, M.

Queueing Systems , Vol. 38 , pp. 471-483 , 2002

Krishnan99 Resource Usage and Charging in a Multi-Service Multi-QoS Packet Network

Krishnan, K.; Mandjes, M.; Mitra, D. & Saniee, I.

Workshop on Internet Service Quality Economics, MIT , 1999

kartik6 Semidefinite cut-and-price approaches for the maxcut problem

Krishnan, K. & Mitchell, J.E.

2004

kartik2 Semi-infinite linear programming approaches to semidefinite programming (SDP) problems


Vol. 37 , pp. 123-142 , 2003

kartik5 Properties of a Cutting Plane Method for Semidefinite Programming


2003

kartik4 A unifying framework for several cutting plane methods for semidefinite programming

url

url

url

url




2002

kartik1 A linear programming approach to semidefinite programming


2001

kartik7 Interior Point and semidefinite approaches in Combinatorial Optimization

Krishnan, K. & Terlaky, T.

2003

kri98 Algorithms for Routing, Wavelength Assignment and Topology Design in Optical Networks

R.M. Krishnaswamy

Dept. of Electrical Commun. Eng., Indian Institute of Science , 1998

kri_apr01 Design of Logical Topologies: A Linear Formulation for Wavelength Routed Optical Networks with no Wavelength Changers

Krishnaswamy, R. & Sivarajan, K.


kri_oct01 Algorithms For Routing and Wavelength Assignment Based on Solutions of LP-Relaxation



Krishnaswamy:Sivarajan_2001_v5 Algorithms for routing and wavelength assignment based on solutions of LP-relaxations

url

url





Krishnaswamy:Sivarajan_2001_v9 Design of logical topologies: a linear formulation for wavelength-routed optical networks with no wavelength changers



KRUITHOF Telefoonverkeersrekening

Kruithof, J.

De Ingenieur , Vol. 52 , pp. E15-E25 , 1937

kruk2 The Gauss-Newton Direction in Semidefinite Programming

Kruk, S.; Muramatsu, M.; Rendl, F.; Vanderbei, R.J. & Wolkowicz, H.


kruk4 Convergence of an infeasible short-step path-following algorithm based on the Gauss-Newton direction

Kruk, S. & Wolkowicz, H.

2000

kruk5 Sequential, quadratic constrained, quadratic programming for general nonlinear programming


pp. 563-575 , 2000

kruk3 Pseudolinear programming


url

url




kruk1 $SQ^2P$, Sequential quadratic constrained quadratic programming


pp. 177-204 , 1998

Krumke01 Models and approximation algorithms for channel assignment in radio networks

Krumke, S.O.; Marathe, M.V. & Ravi, S.S.


KRUPP Stabilization of Alternate Routing Networks

Krupp, R.S.

1982

K56 On the shortest spanning subtree of a graph and the traveling salesman problem

Kruskal, J.

Proceedings of the American Mathematical Society , Vol. 7 , pp. 50 , 1956

Kruskal On the shortest spanning subtree of a graph and the travelling salesman problem

Kruskal, J.

Proc. Amer. Math. Soc. , Vol. 7 , pp. 48-50 , 1956

mst56-1 On the shortest spanning subtree of a graph and the

traveling salesman problem

url

doi



Kruskal, J.

Proc. Amer. Math. Soc. , Vol. 7 , pp. 48-50 , 1956

Kuehn:Hamburger A Heuristic Program for Locating Warehouses

Kuehn, A. & Hamburger, M.


KuHa63 A Heuristic Program for Locating Warehouses

Kuehn, A. & Hamburger, M.


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

Kuhn, F. & Wattenhofer, R.

Proceedings of the Twenty Second Annual Symposium on Principles of Distributed Computing , pp. 25-32 , 2003

KuTu1 Nonlinear Programming

Kuhn, H.W. & Tucker, A.W.

Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, 1950 , pp. 481-492 , 1951

KuhnTuck Nonlinear Programming

Kuhn, H.W. & W., T.A.

Proceedings of Second Berkeley Symposium on Mathematical Statistics and

doi



Probability , pp. 481-492 , 1951

Kuhn:76 Nonlinear programming: a historical view

KUHN, H.

Nonlinear Programming , pp. 1-26 , 1976

KuipersMieghem02 MAMCRA: A constraint-based multicast routing algorithm

Kuipers, F. & Mieghem, P.V.


Kumamoto77 Efficient evaluation of system reliability by Monte Carlo method

Kumamoto, H.; Tanaka, K. & Inoue, K.


Kumamoto80 Dagger-sampling Monte Carlo for system unavailability evaluation

Kumamoto, H.; Tanaka, K.; Inoue, K. & Henley, E.


Kumar95a Genetic-algorithm-based reliability optimization for computer network expansion

Kumar, A.; Pathak, R. & Gupta, Y.


Kumar95 A genetic algorithm for distributed system topology design

Kumar, A.; Pathak, R.; Gupta, Y. & Parsaei, H.


Kumar:Rastogi:Silberschatz:Yener_2002



Algorithms for provisioning virtual private networks in the hose model

Kumar, A.; Rastogi, R.; Silberschatz, A. & Yener, B.


Kumar:Rastogi:Silberschatz:Yener_2001 Algorithms for provisioning virtual private networks in the hose model

Kumar, A.; Rastogi, R.; Silberschatz, A. & Yener, B.


KNR99 Efficient Algorithms for Delay Bounded Multicast Tree Generation for Multimedia Applications

Kumar, G.; Narang, N. & Ravikumar, C.

6th International Conference on High Performance Computing , pp. 169-173 , 1999

Kumar:Kumar Static lightpath establishment in WDM networks-New ILP formulations and heuristic algorithms

Kumar, M. & Kumar, P.


krrstu The Web as a graph

Kumar, R.; Raghavan, P.; Rajagopalan, S.; Sivakumar, D.; Tomkins, A. & Upfal, E.

Proceedings of the Nineteenth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems , pp. 1-10 , 2000

krr99 Trawling the Web for cyber communities

Kumar, R.; Raghavan, P.; Rajagopalan, S. & Tomkins, A.

Proceedings of the Eighth International World Wide Web Conference , 1999

Kum98 Approximating Circular Arc Coloring and Bandwidth Allocation in All-



Optical Ring Networks

Kumar, V.

Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization , pp. 147-158 , 1998

ks Improved algorithms and data structures for solving graph problems in external memory

Kumar, V. & Schwabe, E.

Proceedings of the Eighth IEEE Symposium on Parallel and Distributed Processing , pp. 169-176 , 1996

KumSriWanLanRam01a Efficient algorithms for location and sizing problems in network design

Kumaran, K.; Srinivasan, A.; Wang, Q.; Lanning, S. & Ramakrishnan, K.

Global Telecommunications Conference, 2001 (GLOBECOM '01) , Vol. 4 , pp. 2586-2590 , 2001

KunHengFengYu05 Distributed multicast routing for delay and delay variation-bounded Steiner tree using simulated annealing

Kun, Z.; Heng, W. & Feng-Yu, L.


kuno1 Minimizing a linear multiplicative-type function under network flow constraints

Kuno, T. & Utsonomiya, T.


00kun Effective bandwidth for traffic engineering

Kunz, R.; Nielson, S.; Clement, M. & Snell, Q.

High Performance Switching and Routing, 2001 IEEE Workshop on , pp. 119 - 123 , 2001



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.


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.


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



Cox:Kuehner:Parrish:Qiu Optimal expansion of fiber-optic telecommunications networks in metropolitan areas

L.A. Cox, J.; Kuehner, W.; Parrish, S. & Qiu, Y.


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.


EGM94 A Lagrangian relax and cut approach for the sequential ordering with precedence constraints

L.~Escudero; M.~Guignard & K.~Malik


luthi1 The Analytic Center Quadratic Cut Method (ACQCM) for Strongly Monotone Variational Inequality Problems

Lüthi, H. & Büeller, B.


Laborczi:Cinkler IP over WDM configuration with shared protection

Laborczi, P. & Cinkler, T.


lab91 Logically Rearrangeable Multihop Lightware Networks

Labourdette, J. & Acampora, A.


Labourdette91

url



Logically rearrangeable multihop lightwave networks

Labourdette, J. & Acampora, A.

IEEE transactions on Communications , Vol. {COM-39} , pp. 464-484 , 1991

lab98 Traffic Optimization and Reconfiguration Management of Multiwavelength Multihop Broadcast Lightwave Networks

Labourdette, J.P.


Labovitz-FTCS Experimental Study of Internet Stability and Wide-Area Network Failures

Labovitz, C.; Ahuja, A. & Jahanian, F.

Proceedings of Twenty-Ninth Annual International

Symposium on Fault-Tolerant Computing (FTCS99)

, pp. 278-285 , 1999

Labovit-ToN Internet Routing Instability

Labovitz, C.; Malan, G.R. & Jahanian, F.


Laforest03 Construction of Efficient Communication Sub-structures: Non-approximability Results and Polynomial Sub-cases

Laforest, C.

pp. 903-910 , 2003

lagarias1 Convergence properties of the Nelder-Mead simplex method in low dimensions

Lagarias, J.C.; Reeds, J.A.; Wright, M.H. & Wright, P.E.




La89 Planejamento de Redes de Entroncamento em Áreas Urbanas Multi-Centrais

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.


Laguna92 Optimal design of SONET rings for interoffice telecommunication

Laguna, M.

1992

LagFeoElr94a A greedy randomized adaptive search procedure for the

two-partition problem

Laguna, M.; Feo, T. & Elrod, H.


LagGlo93a Bandwidth packing: A tabu search approach

Laguna, M. & Glover, F.


pdf url



LagGon91a A search heuristic for just-in-time scheduling

in parallel machines

Laguna, M. & González-Velarde, J.

Journal of Intelligent Manufacturing , Vol. 2 , pp. 253-260 , 1991

LagunaMarti01 A GRASP for coloring sparse graphs

Laguna, M. & Martí, R.


LagMar01b A GRASP for coloring sparse graphs

Laguna, M. & Mart, R.


LagMar99a GRASP and path relinking for 2-layer straight line crossing minimization



LagMar98b A GRASP for coloring sparse graphs


1998

Lam86 An improved algorithm for performance analysis of networks with unreliable components

Lam, Y. & Li, V.


Lambert03

pdf url

pdf url



A review of the electronic commerce literature to determine the meaning of the term business model

Lambert, S.

2003

La00 Optimal planning for optical transport networks

Lamming, S.; Mitra, D.; Wang, Q. & Wright, M.

Philosophical Transactions Royal Society London , Vol. A358 , pp. 2183-2196 , 2000

Lancioni00 The role of the Internet in supply chain management

Lancioni, R.; Smith, M. & Oliva, T.


lanckriet2 Learning the kernel matrix with semidefinite programming

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

Lanckriet, G.R.G.; Ghaoui, L.E.; Bhattacharyya, C. & Jordan, M.I.

Journal of Machine Learning Research , Vol. 3 , pp. 555-582 , 2002

LaDg An automatic method of solving discrete programming problems

Land, A.H. & Doig, A.G.


Land:Doig An Automatic Method for Solving Discrete Programming Problems

Land, A. & Doig, A.


url

url



Land:Powell Computer codes for problems of integer programming

Land, A. & Powell, S.


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



Laporte, G.


laporte92 The traveling salesman problem : anoverview of exact and approximate algorithms

Laporte, G.


laporte1 The integer L-shaped method for stochastic integer programs with complete recourse

Laporte, G. & Louveaux, F.V.


laporte3 A branch-and-cut algorithm for the undirected traveling purchaser problem

Laporte, G.; Riera-Ledesma, J. & Salazar-González, J.


lara1 On the limiting properties of the affine-scaling directions

Lara, H.J.; Gonzaga, C.C. & Tunçel, L.

2003

lara2 Condition and complexity measures for infeasibility certificates of systems of linear inequalities and their sensitivity analysis

Lara, H.J. & Tunçel, L.

2002

larknigef03 Efficient algorithms for solving the 2-layered network design problem

Lardeux, B.; Knippel, A. & Geffard, J.

url

url



Proceedings Int. Network Optimization Conf. (INOC'03) , pp. 367-373 , 2003

01lard Traffic Grooming in a Multi-Layer Network

Lardies, A.; Gupta, R. & Patterson, R.


largup01 Traffic Grooming in a Multi-layer Network

Lardies, A.; Gupta, R. & Patterson, R.


La90 An algorithm for nonlinear programs over Cartesian product sets

Larsson, T. & Migdalas, A.


La93 The application of partial linearization algorithm to the traffic assignment problem

Larsson, T.; Migdalas, A. & Patriksson, M.


Larsson92 Simplicial decomposition with disaggregated representation for traffic assignment problem

Larsson, T. & Patriksson, M.


larsson1 Inverse nonlinear multicommodity flow optimization by column generation

Larsson, T.; Patriksson, M. & Rydergren, C.




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.


las70 Optimization Theory for Large Systems

Lasdon, L.

MacMillan , 1970

lasserre12 A discrete Farkas lemma

Lasserre, J.B.


lasserre9 A moment approach to analyze zeros of triangular polynomial sets

Lasserre, J.B.

2004

lasserre11 Generating functions and duality for integer programs

Lasserre, J.B.

url

url



2003

lasserre8 Integer programming, duality, and superadditive functions

Lasserre, J.B.

2003

lasserre4 Semidefinite programming vs LP relaxations for polynomial programming

Lasserre, J.B.


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.


lasserre2 Why the logarithmic barrier function in convex and linear programming

Lasserre, J.B.


lasserre5 Optimality conditions and LMI relaxations for 0--1 programs

Lasserre, J.B.

2000

lasserre1 Having homogeneous or quadratic data in Nonlinear

url

url

url



Programming: What does it change?

Lasserre, J.B. & Hiriart-Urruty, J.

1999

lasserre10 SDP vs. LP relaxations for the moment approach in some performance evaluation problems

Lasserre, J.B. & Prieto-Rumeau, T.

2004

lasserre3 A Laplace transform algorithm for the volume of a convex polytope

Lasserre, J.B. & Zeron, E.S.

J. of the ACM , Vol. 48 , pp. 1126-1140 , 2001

laurent4 A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxations for $0-1$ programming

Laurent, M.


laurent3 Tighter Linear and Semidefinite Relaxations for Max-Cut Based on the Lovász-Schrijver Lift-and-Project Procedure

Laurent, M.


laurent7 Lower bound for the number of iterations in semidefinite relaxations for the cut polytope

Laurent, M.

2002

laurent5 Semidefinite Relaxations for Max-Cut

url

url

url

url

url



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.


laurent2 Connections between semidefinite relaxations of the max-cut and stable set problems

Laurent, M.; Poljak, S. & Rendl, F.


laurent6 Semidefinite programming and integer programming

Laurent, M. & Rendl, R.

2002

laurent1 A characterization of knapsacks with the max-flow--min-cut property

Laurent, M. & Sassano, A.


Lawler76 Combinatorial Optimization: Networks and Matroids

Lawler, E.L.

Holt, Rinehart, and Winston , 1976

url



LaWd Branch-and-bound methods: a survey

Lawler, E.L. & Wood, D.E.


Lawler79 Fast Approximation Algorithms for the Knapsack Problems

Lawler, E.


Law76 Combinatorial Optimization : Networks and Matroids

Lawler, E.

Holt, Rinehart and Wilson , 1976

lawphongpanich2 A nontangential cutting plane algorithm

Lawphongpanich, S.


lawphongpanich1 Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints

Lawphongpanich, S.


lawrence1 A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm

Lawrence, C.T. & Tits, A.L.

1998

lg Accessibility of Information on the Web

url



Lawrence, S. & Giles, C.L.

Nature , Vol. 400 , pp. 107-109 , 1999

LeBlancChiffletMahey1999 Packet routing in telecommunication networks with path and flow restrictions

LeBlanc, L.; Chifflet, J. & Mahey, P.


lebhb85 Improved efficiency of the Frank-Wolfe algorithm for convex network programs

LeBlanc, L.B.J.; Helgason, R. & Boyce, D.

Transportation Sci. , Vol. 19 , pp. 445-462 , 1985

leblanc1 Packet routing in telecommunication networks with path and flow restrictions

LeBlanc, L.J.; Chifflet, J. & Mahey, P.


LebChiMah99a Packet routing in telecommunication networks with path and flow restrictions

LeBlanc, L.; Chifflet, J. & Mahey, P.


Le85 Improved efficiency of the Frank-Wolfe algorithm for convex network

Leblanc, L.; Helgason, R. & Boyce, D.


Le75 An efficient approach to solving the road network equilibrium traffic assignment problem



Leblanc, L.; Morlok, E. & Pierskalla, W.


LeBl96 Topology design and bridge-capacity assignment for interconnecting token ring LANs: A simulated annealing approach

LeBlanc, L.; Park, J.; Sridhar, V. & Kalvenes, J.


LePaSrKa96 Topology Design and Bridge Capacity Assignment for Interconnecting Token Ring LANs: A Simulated Annealing Approach

LeBlanc, L.; Park, J.; Sridhar, V. & Kalvenes, J.


lecoy95 Technologie des telecoms

Lecoy, P.

Hermes , 1995

lederer1 Airline network design

Lederer, P.J. & Nambimadom, R.S.


Lee1993 An algorithm for the design of multitype concentrator networks

Lee, C.


07chie A genetic algorithm for traffic grooming in all-optical mesh networks

Lee, C. & Park, E.

Systems, Man and Cybernetics , Vol. 7 , pp. 6 , 2002



Lee:Hui:Tong:Yum Network dimensioning in WDM-based all-optical networks

Lee, C.; Hui, C.R.; Tong, F.F. & Yum, P.T.


LeCh97 Balancing Loads on SONET Rings with Integer Demand Splitting

Lee, C. & Chang, S.


LeeK00 Cell Planning with Capacity Expansion in Mobile Communications: A Tabu Search Approach

Lee, C. & Kang, H.


Lee:Koh A design of self-healing ATM networks based on backup virtual paths

Lee, C. & Koh, S.


Lee97 A design of the minimum cost ring-chain network with dual-homing survivability: a tabu search approach

Lee, C. & Koh, S.


LeKo97 A Design of the Minimum Cost Ring-Chain Network with Dual-Homing Survivability: A Tabu Search Approach

Lee, C. & Koh, S.


Lee:Sung_2003



Dynamic resource allocation for CDMA-TDD indoor wireless systems

Lee, C. & Sung, K.

Wireless Communications and Mobile Computing , Vol. 3 , pp. 921-931 , 2003

eva6a Generating Cutting Planes for Mixed Integer Programming Problems in a Parallel Distributed Memory Environment

Lee, E.K.

2000

eva4 On facets of knapsack equality problems

Lee, E.K.


Lee_MIPSOL Computational Experience of a General Purpose Mixed 0/1 Integer Programming Solver (MIPSOL)

Lee, E.K.

1997

Lee_radiation A Branch-and-Cut Approach to Treatment Plan Optimization for Permanent Prostate Implants

Lee, E.K.

1997

Sarcoma Automated Tumor Volume Contouring in Soft-Tissue Sarcoma Adjuvant Brachytherapy Treatment

Lee, E.K.; Fung, A.Y.C.; Brooks, J.P. & Zaider, M.

2000

eva9 Prediction of ultrasonic cell membrane disruption using statistical

url

url

url

url

url



analysis and machine learning techniques applied to acoustic spectra

Lee, E.K.; Gallagher, R.J.; Campbell, A. & Prausnitz, M.

2001

Ultrasound Prediction of ultrasound-mediated disruption of cell membranes using machine learning techniques and statistical analysis of acoustic spectra

Lee, E.K.; Gallagher, R.J.; Campbell, A. & Prausnitz, M.

2001

eva11 A Linear Programming Approach to Discriminant Analysis with a Reserved Judgment Region

Lee, E.K.; Gallagher, R.J. & Patterson, D.

2000

eva12 Treatment Planning for Brachytherapy: An Integer Programming Model, Two Computational Approaches and Experiments with Permanent Prostate Implant Planning

Lee, E.K.; Gallagher, R.J.; Silvern, D.; Wuu, C.S. & Zaider, M.

Physics in Medicine and Biology , Vol. 44 , pp. 145-165 , 1999

eva7 Mixed Integer Programming Approaches to Treatment Planning for Brachytherapy -- Application to Permanent Prostate Implants

Lee, E.K.; Gallagher, R.J. & Zaider, M.

2000

eva8 A Matrix Reduction and Perturbation Approach for Solving Dense Mixed Integer Programs and its Applications to MIP Instances Arising from Permanent Prostate Implants

Lee, E.K.; Johnson, E.L. & Nemhauser, G.L.

2000

url

url

url

url



eva6 Branch-and-bound methods for integer programming

Lee, E.K. & Mitchell, J.E.

2001

eva5 Computational experience of an interior point SQP algorithm in a parallel branch-and-bound framework


pp. 329-347 , 2000

eva2 Computational experience in nonlinear mixed integer programming


Proceedings of Symposium on Operations Research, August 1996, Braunschweig, Germany , pp. 95-100 , 1997

eva3 Computational experience of an interior point algorithm in a parallel branch-and-cut framework


Proceedings of the Eighth SIAM Conference on Parallel Processing for Scientific Computing, Minneapolis, March 1997 , 1997

eva14 Determining an Effective Planning Volume for Permanent Prostate Implants

Lee, E.K. & Zaider, M.

International Journal of Radiation Oncology, Biology and Physics , Vol. 49 , pp. 1197-1206 , 2001

Lee:Mitchell:3 Computational Experience of an Interior-Point Algorithm in a Parallel Branch-and-Cut Framework

Lee, E. & Mitchell, J.

Proceedings for SIAM conference on parallel processing for scientific computing , pp.

url

url



1-9 , 1997

Lee:Mitchell:2 Computational Experience of an Interior-Point SQP Algorithm in a Parallel Branch-and-Bound Framework


Proceedings of High Performance Optimization Techniques 1997 , 1997

Lee:Mitchell Computational Experience in Nonlinear Mixed Integer Programming


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.


lee5 Hoffman's circle untangled

Lee, J.


Lee Characterizations of the dimension for classes of concordant polytopes

Lee, J.


Lee2



A spectral approach to polyhedral dimension

Lee, J.


lee4 Subspaces with well-scaled frames

Lee, J.

Linear Algebra and its Applications , Vol. 114/115 , pp. 21-56 , 1989

lee3 On the Boolean quadric forest polytope

Lee, J. & Leung, J.

1993

lee8 A comparison of two edge-coloring formulations

Lee, J. & Leung, J.


lee10 Min-up/min-down polytopes

Lee, J.; Leung, J. & Margot, F.


lee6 Geometric Comparison Of Combinatorial Polytopes

Lee, J. & Morris, W.D.


lee9 A linear integer programming bound for maximum-entropy sampling

Lee, J. & Williams, J.




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.


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



An efficient real-time method for improving intrinsic delay of capacity allocation in interactive GEO Satellite networks

Lee, K.


LeeKD:Chang A real-time algorithm for timeslot assignment in multirate return channels of interactive satellite multimedia networks

Lee, K. & Chang, K.


Lee:Lee:Cho:Oh Throughput-maximizing timeslot scheduling for interactive satellite multiclass services

Lee, K.; Lee, H.; Cho, Y. & Oh, D.


Lee:Yu:Kim:Kang:Park Design of hierarchical crossconnect WDM networks employing a two-stage multiplexing scheme of waveband and wavelength

Lee, M.; Yu, J.; Kim, Y.; Kang, C. & Park, J.


LeeMJ:Yee A logical topology and discrete capacity assignment algorithm for reconfigurable networks

Lee, M. & Yee, J.


LeYe94 An Algorithm for Optimal Minimax Routing in ATM Networks

Lee, M. & Yee, J.


LeeEtAl04 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

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.


Lee:Lee:Park Optimal routing and wavelength assignment in WDM ring networks

Lee, T.; Lee, K. & Park, S.


Lee:Park An integer programming approach to the time slot assignment problem in SS/TDMA systems with intersatellite links

Lee, T. & Park, S.


ylee1 A branch and cut algorithm for a Steiner tree-star problem

Lee, Y.; Chiu, S.Y. & Ryan, J.




Lee:Han:Kang A fiber routing problem in designing optical transport networks with wavelength division multiplexed systems

Lee, Y.; Han, J. & Kang, K.


LeeEtAl03 A fiber routing problem in designing optical transport networks with wavelength division multiplexed systems



LeeHanKang03 A fiber routing problem in designing optical transport networks with wavelength division multiplexed systems



Lee:Kim:Lee:Kang A location-routing problem in designing optical Internet access with WDM systems

Lee, Y.; Kim, S.; Lee, S. & Kang, K.


Lee-Muk04 Traffic Engineering in

Next-Generation Optical Networks

Lee, Y. & Mukherjee, B.

IEEE Communications

Surveys

, Vol. 6 , pp. 16-33 , 2004



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.


LeHu02 Methods and Algorithms for Radio Channel Assignment

Leese, R. & Hurley, S.


Lehmann-etal-2005 The Winner Determination Problem

Lehmann, D.; Müller, 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,



S.


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.


Lema2001 Lagrangian relaxation

Lemaréchal, C.

pp. 115-160 , 2001

lemarechal6 Lagrangian relaxation

Lemaréchal, C.

2001

Lemar Nondifferentiable Optimization

Lemaréchal, C.

pp. 529-572 , 1989

lemarechal2 New variants of bundle methods

Lemaréchal, C.; Nemirovskii, A. & Nesterov, Y.


url



lemarechal4 Semidefinite relaxations and Lagrangian duality with application to combinatorial optimization

Lemaréchal, C. & Oustry, F.

1999

lemarechal5 A geometric study of duality gaps, with applications

Lemaréchal, C. & Renaud, A.


lemarechal3 Variable metric bundle methods: From conceptual to implementable forms

Lemaréchal, C. & Sagastizábal, C.


lemke1 The constrained gradient method of linear programming

Lemke, C.E.


Lengauer Combinatorial algorithms for integrated circuit layout

Lengauer, T.

Wiley & Sons , 1990

lengauer1 Provably good global routing of integrated circuits

Lengauer, T. & Lügering, M.


Lens Integer programming with a fixed number of variables

url



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.


letchford1 Separating a superclass of combs inequalities in planar graphs

Letchford, A.


letchford3 Totally tight Chvátal-Gomory cuts

Letchford, A.N.


letchford2 Multistars, partial multistars, and the capacitated vehicle routing problem

Letchford, A.N.; Eglese, R.W. & Lysgaard, J.


letchford4 Strengthening Chvátal-Gomory cuts and Gomory fractional cuts

Letchford, A.N. & Lodi, A.


LeGr04a

url

url



Restorable Mesh Network Design under Demand Uncertainty: Toward ``Future proof" Transport Investments

Leung, D. & Grover, W.D.

2004

LeGr04b Capacity Planning of Survivable Mesh-based Transport Networks under Demand Uncertainty

Leung, D. & Grover, W.D.

Journal of Photonic Network Communications , 2004

leung1 More Facets From Fences For Linear Ordering And Acyclic Subgraph Polytopes

Leung, J. & Lee, J.


leung2 A Comparison Of 2 Edge-Coloring Formulations

Leung, J. & Lee, J.


LeMa89 Valid inequalities and facets of the capacitated plant location problem

Leung, J. & Magnanti, T.


Leur1 Cost versus Time Equilibrium over a Network

Leurent, F.


Leur2 Modelling Elastic, Disaggregate Demand



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.


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.


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.



USSR Computational Mathematics and Mathematical Physics , Vol. 6 , pp. 1-50 , 1966

Levy98 Stochastic Dominance: Investment Decision Making Under Uncertainty

Levy, H.


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.


lewis4 Active sets, nonsmoothness, and sensitivity

Lewis, A.S.


lewis5 The mathematics of eigenvalue optimization

Lewis, A.S.


lewis3 Ill-conditioned convex processes and conic linear systems

Lewis, A.S.


lewis2



Nonsmooth analysis of eigenvalues

Lewis, A.S.


lewis1 Eigenvalue Optimization

Lewis, A.S. & Overton, M.L.

pp. 149-190 , 1996

LewisPongVancleave Optimum Steiner tree generation

Lewis, F.D.; Pong, W.C. & Cleave, N.V.

Proceedings of the Second Great Lakes Symposium on VLSI , pp. 207-212 , 1992

Lewis99 Going global remaining local: The impact of e-commerce on small retail firms in Wales

Lewis, R. & Cockrill, A.

International Journal of Information Management , Vol. 22 , pp. 195-209 , 1999

rmlewis3 Model Problems for the Multigrid Optimization of Systems Governed by Differential Equations

Lewis, R.M. & Nash, S.G.

2002

rmlewis4 A globally convergent augmented Lagrangian pattern search algorithm for optimization with general constraints and simple bounds

Lewis, R.M. & Torczon, V.


rmlewis2 Pattern search algorithms for linearly constrained minimization

url





rmlewis1 Pattern search algorithms for bound constrained minimization



leyffer2 The Penalty Interior Point Method fails to converge for Mathematical Programs with Equilibrium Constraints

Leyffer, S.

2002

leyffer1 Integrating SQP and branch-and-bound for mixed integer nonlinear programming

Leyffer, S.


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

url

url



Li, C.; McCormick, S. & Simchi-Levi, D.

Discrete Applied Math. , Vol. 36 , pp. 267-292 , 1992

dli1 Zero duality gap in integer programming: $P$-norm surrogate constraint method

Li, D.


150li Traffic grooming on general topology WDM networks

Li, D.; Sun, Z.; Jia, X. & Makki, K.

Communications, IEE Proceedings- , Vol. 150 , pp. 197 - 201 , 2003

Li:Sun:Jia:Makki Traffic grooming on general topology WDM networks

Li, D.; Sun, Z.; Jia, X. & Makki, K.

IEE Proceedings-Communications , Vol. 150 , pp. 197-201 , 2003

00li Traffic grooming for minimizing wavelength usage in WDM networks

Li, D.; Sun, Z.; Jia, X. & Makki, S.

Proceedings , pp. 460 - 465 , 2002

LiSim00 The partition coloring problem and its application to wavelength routing and assignment

Li, G. & Simha, R.

Proceedings of the First Workshop on Optical Networks , pp. ??-?? , 2000

LiEtAl03 A novel fast multicast algorithm with enhanced survivability in WDM optical networks

Li, J.; Zhang, H.; Zhou, B. & Guo, Y.




lihudak89 Memory coherence in shared virtual memory systems

Li, K. & Hudak, P.


LiSom02 Efficient Algorithms for Wavelength Converter Placement

Li, L. & Somani, A.

Optimal Networks Magazine , pp. 1-9 , 2002

isiste:01 IS-IS Extensions for Traffic Engineering

Li, T. & Smit, H.

2001

Li84 Performance analysis of networks with unreliable components

Li, V. & Silvester, J.


LiEtAl04 A Multicast Routing Algorithm for CSCW

Li, X.; Huan, D.; Dong, Y. & Zhou, X.

pp. 1022-1025 , 2004

00xiay Practical traffic grooming scheme for single-hub SONET/WDM rings

Li, X.; Liu, L.; Wan, P. & Frieder, O.

Proceedings. , pp. 556 - 564 , 2000

02xiay Practical traffic grooming scheme for single-hub SONET/WDM rings



Li, X.; Liu, L.; Wan, P. & Frieder, O.

WCC - ICCT 2000 , Vol. 2 , pp. 1193 - 1200 , 2000

01liw Select line speeds for single-hub SONET/WDM ring networks

Li, X.; Wan, P. & Liu, L.

ICC 2000 , Vol. 1 , pp. 495 - 499 , 2000

pardalos12 Generating quadratic assignment test problems with known optimal permutations

Li, Y. & Pardalos, P.M.


li1 A greedy randomized adaptive search procedure for the quadratic assignment problem

Li, Y.; Pardalos, P.M. & Resende, M.G.C.

1993

LiParRes94a A Greedy Randomized Adaptive Search Procedure for

the Quadratic Assignment Problem

Li, Y.; Pardalos, P. & Resende, M.

Vol. 16 , pp. 237-261 , 1994

LM03 QMBF: A QoS-aware Multicast Routing protocol

Li, Z. & Mohapatra, P.

Computer Communications Journal , Vol. 26 , pp. 611-621 , 2003

Liang00 Virtual Backbone Generation and Maintenance in Ad Hoc Network Mobility Management



Liang, B. & Haas, Z.


liao3 Modifying the BFGS method

Liao, A.


liao2 Pull the weighted center towards the solution of LP

Liao, A.

1994

liao1 Solving LP problems via weighted centers

Liao, A. & Todd, M.J.


liers1 Ground states in three-dimensional $ J$ Edwards-Anderson spin glasses with free boundaries

Liers, F. & Jünger, M.

International Journal of Modern Physics C , Vol. 11 , pp. 589-592 , 2000

LILJ An Approach to IP Network Traffic Engineering (Cable & Wireless)

Liljenstolpe, C.

2002

lin97adaptive Adaptive Clustering for Mobile Wireless Networks

Lin, C.R. & Gerla, M.


url



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

Lin, C. & Moré, J.J.


lin_c1 Incomplete Cholesky factorizations with limited memory

Lin, C. & Moré, J.J.

1997

lin_c2 On Solving Large-Scale Semidefinite Programming Problems --- A Case Study of Quadratic Assignment Problem

Lin, C. & Saigal, R.

1997

saigal2 A predictor-corrector method for for semi-definite linear programming

Lin, C. & Saigal, R.

1995

LW93 Minimax Open Shortest Path First Routing Algorithms in Networks Supporting the SMDS Services

Lin, F. & Wang, J.

Proc. International Conference on Communications , Vol. 2 , pp. 666-670 , 1993

url

url

url

url



LinXue02 On the terminal Steiner tree problem

Lin, G. & Xue, G.


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.


Lin:Kernighan An Effective Heuristic Algorithm for the Traveling Salesman Problem

Lin, S. & Kernighan, B.


linderoth3 Decomposition Algorithms for Stochastic Programming on a computational grid

Linderoth, J. & Wright, S.

2001

linderoth5 A Simplicial Branch-and-Bound Algorithm for Solving Quadratically Constrained Quadratic Programs

url

url



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.


linderoth1 A computational study of strategies for mixed integer programming

Linderoth, J.T. & Savelsbergh, M.W.P.


linderoth4 The Empirical Behavior of Sampling Methods for Stochastic Programming

Linderoth, J.T.; Shapiro, A. & Wright, S.J.

2002

00lin Effect of wavelength and waveband grooming on all-optical networks with single layer photonic switching

Lingampalli, R. & Vengalam, P.

Proceedings of the Optical Fiber Communication Conference (OFC 2002) , pp. 501 - 502 , 2002

Lial95 The allocation of value for jointly provided services

Linhart, P.; Radner, R.; Ramakrishnan, K. & Steinberg, R.


Linhart95 Allocation of Value for Jointly Provided Services

Linhart, P.B.; Ramakrishnan, K.G.; Radner, R. & Steinberg, R.

url



Telecommunications Systems , pp. 151-175 , 1995

linlr95 The geometry of graphs and some of its algorithmic applications

Linial, N.; London, E. & Rabinovitch, Y.


lovasz5 Facets with fixed defect of the stable set polytope

Lipták, L. & Lovász, L.


lisser2 Capacity planning under uncertain demand in telecommunications network

Lisser, A.; Ouorou, A.; Vial, J. & Gondzio, J.

1999

lisser1 Graph partitioning using linear and semidefinite programming

Lisser, A. & Rendl, F.


lisser1old Telecommunication clustering using linear and semidefinite programming

Lisser, A. & Rendl, F.

2000

lissarvia1 Solving LP relaxation for survivability problems in telecommunication networks

Lisser, A.; Sarkissian, R. & Vial, J.


url

url



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

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.


liu2 The role of elimination trees in sparse factorization

Liu, J.W.H.


liu1 On finding supernodes for sparse matrix computations

Liu, J.W.H.; Ng, E.G. & Peyton, B.W.


LiuParRajRes00a A GRASP for frequency assignment in mobile radio networks

url



Vol. 52 , pp. 195-201 , 2000

Liu92 Optimal Scheduling in Some Multi-Queue Single-Server Systems

Liu, Z. & Nain, P.

IEEE Transactions on Automatic Control , Vol. AC-37 , pp. 247-252 , 1992

Ramanathan92 On the Complexity of Distance-2 Coloring

Lloyd, E.L. & Ramanathan, S.

pp. 71-74 , 1992

LloydEtAl05 Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks

Lloyd, E.; Liu, R.; Marathe, M.; Ramanathan, R. & Ravi, S.


Lo:Chuang A novel approach of backup path reservation for survivable high-speed networks

Lo, C. & Chuang, B.


Lo:Kershenbaum A two-phase algorithm and performance bounds for the star-star concentrator location problem

Lo, C. & Kershenbaum, A.


lobo2 Portfolio optimization with linear and fixed transaction costs

Lobo, M.S.; Fazel, M. & Boyd, S.

2002

url



lobo1 Applications of second-order cone programming

Lobo, M.S.; Vandenberghe, L.; Boyd, S. & Lebret, H.


Loc98a A class of heuristic methods for the maximization of the $l_1$-norm over parallelotopes

Locatelli, M.

1998

Lomonosov72 Lower bound of network reliability

Lomonosov, M. & Polesskii, V.

Problemy Peredachi Informatsii , Vol. 8 , pp. 118-23 , 1972

Long01 IP Network Design

Long, C.

Osborne/McGraw-Hill , 2001

loparic2 Dynamic knapsack sets and capacitated lot-sizing

Loparic, M.; Marchand, H. & Wolsey, L.A.


loparic1 The uncapacitated lot-sizing problem with sales and safety stocks

Loparic, M.; Pochet, Y. & Wolsey, L.A.


lorenz:01 How Good Can IP Routing Be?

Lorenz, D.H.; Orda, A.; Raz, D. & Shavitt, Y.

url



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.


LouSer98a Adaptive approach heuristics for the generalized

assignment problem

Lourenço, H.R. & Serra, D.

1998

LouPaiPor98a Metaheuristics for the bus-driver scheduling problem

1998

LouPaiPor01a Multiobjective metaheuristics for the bus-driver

scheduling problem

Transportation Sciences , Vol. 35 , pp. 331-343 , 2001

pdf url



Lovasz75 Three Short Proofs in Graph Theory

Lovász, L.

J. Combin. Th. Ser. B , Vol. 19 , pp. 111-113 , 1975

lovasz4 Hit-and-run mixes fast

Lovász, L.


lovasz2 On the Shannon capacity of a graph

Lovász, L.


LovPlm Matching Theory

Lovász, L. & Plummer, M.D.

Akadémiai Kiadó , 1986

lovasz3 Cones of matrices and set-functions and 0-1 optimization

Lovász, L. & Schrijver, A.


LoveWesolowskyKraemer A multifacility minimax location method for Euclidean distances

Love, R.F.; Wesolowsky, G.O. & Kraemer, S.A.


LoSc90 The generalized basis reduction algorithm

Lovász, L. & Scarf, H.



1990

Low98 Loop-free multicast routing with end-to-end delay constraint

Low, C.


Low03 A Duality Model of TCP and Queue Management Algorithm

Low, S.H.


Low02 Understanding TCP Vegas: Theory and Practice

Low, S.H.; Peterson, L. & Wang, L.


Low93 A New Approach to Service Provisioning in ATM Networks

Low, S.H. & Varaiya, P.P.


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



Lu, B. & Ruan, R.


LuTangLee03 The full Steiner tree problem

Lu, C.; Tang, C. & Lee, R.


lu1 An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex QP

Lu, Z.; Monteiro, R.D.C. & O'Neal, J.W.

2004

luby86 A simple parallel algorithm for the maximal independent set problem

Luby, M.


Lucena Steiner problem in graphs: Lagrangean relaxation and cutting-planes

Lucena, A.

Bulletin of the Committee on Algorithms , Vol. 21 , pp. 2-7 , 1992

L91 Tight bounds for the Steiner problem in graphs

Lucena, A.

1991

lucena1 Branch and cut algorithms

Lucena, A. & Beasley, J.E.

pp. 187-221 , 1996

url



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.


lucidi1 Objective-Derivative-Free Methods for Constrained Optimization

Lucidi, S.; Sciandrone, M. & Tseng, P.


Lucking00 Auctions on the Internet: What's being auctioned and how?

Lucking-Reiley, D.

Journal of Industrial Economics , Vol. 48 , pp. 227-252 , 2000

Lucking01 Business-to-business electronic commerce

Lucking-Reiley, D. & Spulber, D.F.

Journal of Economic Perspectives , Vol. 15 , pp. 55-68 , 2001

luenberger2 Linear and Nonlinear Programming

Luenberger, D.G.

url

url




LuenOld Linear and Nonlinear Programming

Luenberger, D.G.

2nd edition, Addison-Wesley , 1984

Lue84 Linear and nonlinear programming

Luenberger, D.


lue89 Linear and Nonlinear Programming

Luenberger, D.G.


LuiEtAl QoS Multicast Routing with Heterogeneous Receivers

Lui, K.; Wang, J.; Xiao, L. & Nahrstedt, K.

luksan1 A bundle-Newton method for nonsmooth unconstrained minimization

Luksan, L. & Vlcek, J.


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 isão



Luna, H.P.L.

pp. 83-100 , 1995

Lu88 Modelos para Levantamento e Previsão de Tráfego Telefônico

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 Estabilização Econômica

Luna, H.

SBA: Controle e Automação , Vol. 1 , pp. 72-81 , 1986

LuMa00 Bounds for Global Optimization of Capacity Expansion and Flow Assignment Problems

Luna, H. & Mahey, P.




Lual97 Multicommodity Flows with Price Sensitive Demands

Luna, H.; Mahey, P.; Ouorou, A. & Chifflet, J.

pp. 583-593 , 1997

LuMaLa91 A Model for Junction Network Planning: Properties and a Decomposition Algorithm

Luna, H.; Mateus, G. & Lage, L.

1991

LuZiCa87 The Telephonic Switching Centre Network Problem: Formalization and Computational Experience

Luna, H.; Ziviani, N. & Cabral, R.


ly On the hardness of approximating minimization problems

Lund, C. & Yannakakis, M.


LundYannakakis94 On the hardness of approximating minimization problems

Lund, C. & Yannakakis, M.


02lun INTELSAT second-generation TDMA terminal

Lunsford, J.; Thorne, R.; Lindstrom, R.; Ridings, R.; Pontano, B.; Phiel, J.; Carlson, J. & Volz, R.

Digital Satellite Communications, 1995. Tenth International Conference on , Vol. 2 , pp. 419 - 426 , 1995



Luo:Ansari Restoration with wavelength conversion in WDM networks

Luo, Y. & Ansari, N.


luo17 Applications of convex optimization in signal processing and digital communication

Luo, Z.


luo15 New error bounds and their applications to convergence analysis of iterative algorithms

Luo, Z.


luo2 Analysis of a cutting plane method that uses weighted analytic center and multiple cuts

Luo, Z.


luo16 On blind source separation using mutual information criterion

Luo, Z. & Lu, J.


luo14 Preface: Error bounds in mathematical programming

Luo, Z. & Pang, J.


luo7 url



Mathematical Programs with Equilibrium Constraints

Luo, Z.; Pang, J. & Ralph, D.


luo11 Complexity analysis of a logarithmic barrier decomposition method for semi-infinite linear programming

Luo, Z.; Roos, C. & Terlaky, T.

Applied Numerical Mathematics , Vol. 29(3) , pp. 379-395 , 1999

luo6 Conic convex programming and self-dual embedding

Luo, Z.; Sturm, J.F. & Zhang, S.


luo4 Superlinear convergence of a symmetric primal-dual path following algorithm for semidefinite programming



luo9 Duality results for conic convex programming


1997

luo6old Duality and self-duality for conic convex programming


1996

luo13 A Polynomial Cutting Surfaces Algorithm for the Convex Feasibility Problem Defined by Self-Concordant Inequalities

url

url



Luo, Z. & Sun, J.


luo5 An analytic center based column generation algorithm for convex quadratic feasibility problems

Luo, Z. & Sun, J.


luo3 A new class of merit functions for the nonlinear complementarity problem

Luo, Z. & Tseng, P.

1995

luo1 Analysis of an approximate gradient projection method with applications to the back propagation algorithm

Luo, Z. & Tseng, P.

1993

luo8 A genuine quadratically convergent polynomial interior point algorithm for linear programming

Luo, Z. & Ye, Y.

pp. 235-246 , 1994

luo10 On the Extension of Frank-Wolfe Theorem

Luo, Z. & Zhang, S.

1997

luo12 On the extensions of Frank-Wolfe theorem

Luo, Z. & Zhang, S.

url



1997

Luss1982 Operations research and capacity expansion problems: A survey

Luss, H.


LussVakhutinsky2001 A resource allocation approach for the generation of service-dependent demand matrices for communications networks

Luss, H. & Vakhutinsky, A.


Lustig:Marsten:Shanno On Implementing Mehrotra's Predictor-Corrector Interior Point Method for Linear Programming

Lustig, I.; Marsten, R. & Shanno, D.


Lus1 Feasibility issues in a primal-dual interior point method for linear programming

Lustig, I.J.


Lus3 The influence of computer language on computational comparisons: An example from network optimization

Lustig, I.J.


Lus2 An analysis of an available set of linear programming test problems

Lustig, I.J.




LMS6 Interior Point Methods for Linear Programming: Computational State of the Art

Lustig, I.J.; Marsten, R.E. & Shanno, D.F.


LMS7 The last word on Interior Point Methods for Linear Programming --- for now



LMS2690 On implementing Mehrotra's predictor-corrector interior point method for linear programming



LMS9210 Computational Experience with a Globally Convergent Primal-Dual Predictor-Corrector Algorithm for Linear Programming


1992

LMS8917 Computational experience with a primal-dual interior point method for linear programming



lustig9 Program does not equal program: constraint programming and its relationship to mathematical programming

Lustig, I.J. & Puget, J.




lustig8 Gigaflops in linear programming

Lustig, I.J. & Rothberg, E.

1995

lyle Local minima of the trust region problem

Lyle, S. & Szularz, M.


SchFis04 A taxonomy of autonomy in multiagent organization

M., S. & K., F.


F81 The Lagrangian relaxation method for solving integer programming problems

M.L.~Fisher


HWC74 Validation of subgradient optimization

M.~Held; P.~Wolfe & H.P.~Crowder


HFK98 A Lagrangian relaxation approach to the edge-weighted clique problem

M.~Hunting; U.~Faigle & W.~Kern


PR1991 A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems



M.~Padberg & G.~Rinaldi


Padberg:Rinaldi4 An efficient algorithm for the minimum capacity cut problem



Padberg:Rinaldi3 Optimization of a 537-city TSP by branch-and-cut


OR letters , Vol. 6 , pp. 1-8 , 1987

mohring1 On project scheduling with irregular starting time costs

Möhring, R.; Schulz, A.S.; Stork, F. & Uetz, M.


meszaros4 Steplengths in interior point algorithms of quadratic programming

Mészáros, C.


meszaros8 The BPMPD interior solver for convex quadratic problems

Mészáros, C.


meszaros5 On a property of the Cholesky factorization and its consequences in interior point methods

Mészáros, C.

1998

url

url



meszaros6 The separable and non-separable formulations of convex quadratic problems in interior point methods

Mészáros, C.

1998

meszaros7 On the sparsity issues of interior point methods for quadratic programming

Mészáros, C.

1998

meszaros9 Addendum to ``Presolve analysis of linear programs prior to applying an interior point method''

Mészáros, C. & Gondzio, J.


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.


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.


Mabert03

url

url



Enterprise resource planning: Managing the implementation process

Mabert, V.; Soni, A. & Venkataramanan, M.


macambira1 The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations

Macambira, E.M. & de Souza, C.C.


MacMen98a A GRASP algorithm for the maximum weighted edge subgraph problem

Macambira, E. & Meneses, C.

1998

MacSou97a A GRASP for the maximum clique problem with

weighted edges

Macambira, E. & de Souza, C.

Proceedings of the XXIX Brazilian Symposium on

Operations Research

, pp. 70 , 1997

MacSou97b The edge-weighted clique problem: valid inequalities,

facets and polyhedral computations

Macambira, E. & de Souza, C.

1997

05mac Distributed partial-express routing of broad-band transport network demands



MacGregor, M. & Grover, W.


MacGregor:Grover:Ryhorchuk Optimal spare capacity preconfiguration for faster restoration of mesh networks

MacGregor, M.; Grover, W. & Ryhorchuk, K.


Mackenzie02 Graph theory uncovers the roots of perfection

Mackenzie, D.

Science , Vol. 297 , pp. 38 , 2002

Masonvarian95 Pricing Congestible Resources

Mackie-Mason, J.K. & Varian, H.


masonvarian97 Economic FAQs About the Internet

MacKie-Mason, J.K. & Varian, H.

1996

des87-3 The Steiner problem in graphs

Maculan, N.


Ma87 The Steiner Problem in Graphs

Maculan, N.




Maculan87 The Steiner Problem in Graphs

Maculan, N.


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 Problème de Steiner sur un Graphe Orienté: Formulations et Relaxations

Maculan, N.; Arpin, D. & Nguyen, S.

Matemática Aplicada e Computacional , Vol. 7 , pp. 109-118 , 1988

MaCaLo84 Relaxacão Lagrangeana em Programacão 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.


Maal91 An Approach for the Steiner Problem in Directed Graphs



Maculan, N.; Souza, P. & Vejar, A.C.


Maculanetal An approach for the Steiner problem in directed graphs

Maculan, N.; Souza, P. & Vejar, A.C.


MacQueen67 Some methods for classification and analysis of multivariate observations

Mac~Queen, J.

Proceedings of the 5th Berkeley Symposium Math. Statist. and Probability (1965/66), Vol. I: Statistics , pp. 281-297 , 1967

des94-5 The constrained two-connected subgraph problem

Maffioli, F. & Värbrand, P.

1994

Maglaras05 Pricing and Design of Differentiated Services: Approximate Analysis and Structural Insights

Maglaras, C. & Zeevi, A.


MagnantiWolsey1996 Optimal trees

Magnanti, T. & Wolsey, L.

Vol. 7 , pp. 503-615 , 1996

MagnantiWolsey1995 Optimal trees

Magnanti, T. & Wolsey, L.

Vol. 7 , 1995



magnanti1 Facets and reformulations for solving production planning with changeover costs

Magnanti, T.L. & Sastry, T.


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.


Maal93 The Convex Hull of Two Core Capacitated Network Design Problems



MaMiVa93 The Convex Hull of Two Core Capacitated Network Design Problems



Maal86 Tailoring Benders Decomposition for Uncapacitated Network Design

Magnanti, T.; Mirchandani, P. & Wong, R.


MaMiWo86



Tailoring Benders Decomposition for Uncapacitated Network Design

Magnanti, T.; Mirchandani, P. & Wong, R.


magmirwon86 Tailoring Benders decomposition for uncapacitated network design

Magnanti, T.; Mireault, P. & Wong, R.


des84-1 Network Design and Transportation Planning:

Models and Algorithms

Magnanti, T. & Wong, R.


magwon84 Network design and transportation planning: models and algorithms


Transportation Sciences , Vol. 18 , pp. 1-55 , 1984

MaWo84 Network Design and Transportation Planning: Models and Algorithms



MW84 Network design and transportation planning: models and algorithms



mahajan:04 Negotiation-Based Routing Between Neighboring ISPs



Mahajan, R.; Wetherall, D. & Anderson, T.

Proc. USENIX Symposium on Networked Systems Design and Implementation , 2005

mahajan1 Derandomizing semidefinite programming based approximation algorithms

Mahajan, S. & Ramesh, H.

1996

ye21 A 1.52-Approximation Algorithm for the Uncapacitated Facility Location Problem

Mahdian, M.; Ye, Y. & Zhang, J.

2002

mah02 Decomposition Methods for Mathematical Programming

Mahey, P.

2002

MaLu95 Decomposition and Informational Decentralization for the the Computation of Economic Equilibrium

Mahey, P. & Luna, H.P.L.

Vol. 8 , pp. 494-515 , 1995

mahop95 Proximal decomposition on the graph of a maximal monotone operator

Mahey, P.; Oualibouch, S. & D.T., P.


MahRib02a Modeling modern multimedia traffic

Mahey, P. & Ribeiro, C.

url




MahRib02b Modeling modern multimedia traffic

Mahey, P. & Ribeiro, C.

OR/MS Today , Vol. 29 , pp. 40-43 , 2002

des94-2 Two-edge connected spanning subgraphs and

polyhedra

Mahjoub, A.


Mah Dynamic Traffic Assignment with Multiple User Classes for Real-Time ATIS/ATMS Applications

Mahmassani, H.S.; Peeta, S.; Hu, T.Y. & Ziliaskopoulos, A.

Large Urban Systems, Proceedings of the Advanced Traffic Management Conference , pp. 91-114 , 1993

MailleTuffin2004 Multi-Bid Auctions for Bandwidth Allocation in Communication Networks

Maillé, P. & Tuffin, B.

Proc. of IEEE INFOCOM 2004 , 2004

mak1 Monte Carlo Bounding Techniques for Determining Solution Quality in Stochastic Programs

Mak, W.K.; Morton, D.P. & Wood, R.K.


makela1 Nonsmooth Optimization: Analysis and Algorithms with Applications to Optimal Control



Makela, M.M. & Neittaanmaki, P.

World Scientific Publishing Co. , 1992

ManSahMah02 A Heuristic Search for Generalized Cellular Network Planning

Mandal, S.; Saha, D. & Mahanti, A.

Proceedings of IEEE International Conference on Personal Wireless Communication (ICPWC) , 2002

Mandalianos05 Prototype e-government system for municipalities

Mandalianos, I.

Department of Production Engineering and Management, Technical University of Crete , 2005

mangasarian2 Arbitrary-norm separating plane

Mangasarian, O.


mangasarian3 Polyhedral boundary projection

Mangasarian, O.


mangasarian4 Exact penalty functions for mathematical programs with linear complementarity constraints

Mangasarian, O. & Pang, J.

Optimization , Vol. 42(1) , pp. 1-8 , 1997

Mangasarian96 Mathematical programming in data mining

Mangasarian, O.L.

url



Data Mining and Knowledge Discovery , Vol. 1 , pp. 183-201 , 1997

Mang Nonlinear Programming

Mangasarian, O.L.

McGraw-Hill , 1969

Ma64 Plant Location Under Economies of Scale

Manne, A.


Manne Plant Location under Economies of Scale-Decentralization and Computation

Manne, A.


ManninoStefanutti99 An augmentation algorithm for the maximum weighted stable set problem

Mannino, C. & Stefanutti, E.


Manohar:Manjunath:Shevgaonkar Routing and wavelength assignment in optical networks from edge disjoint path algorithms

Manohar, P.; Manjunath, D. & Shevgaonkar, R.


Manohar:Padmanath:Singh:Manjunath Multiperiod virtual topology design in wavelength routed optical networks

Manohar, P.; Padmanath, A.; Singh, S. & Manjunath, D.

IEE Proceedings: Circuits, Devices and Systems , Vol. 150 , pp. 516-520 , 2003

MantegnaStanley2000



An Introduction to Econophysics: Correlations and Complexity in Finance

Mantegna, R.N. & Stanley, H.E.


ManyemStallmann1996 Some approximation results in multicasting

Manyem, P. & Stallmann, M.

1996

MJSMW03 Efficient and Robust Streaming Provisioning in VPNs

Mao, Z.; Johnson, D.; Spatscheck, O.; van der Merwe, J.E. & Wang, J.

Proceedings of the WWW2003 , 2003

maranas1 Optimal molecular design under property prediction uncertainty

Maranas, C.D.

American Institute of Chemical Engineers Journal , Vol. 43 , pp. 1250-1264 , 1997

maranas2 Solving long term financial planning problems via global optimization

Maranas, C.D.; Androulakis, I.P.; Floudas, C.A.; Berger, A.J. & Mulvey, J.M.

Journal of Economics, Dynamics, and Control , Vol. 21 , pp. 1405-1425 , 1997

marathe95simple Simple Heuristics for Unit Disk Graphs

Marathe, M.V.; Breu, H.; III, H.B.H.; Ravi, S.S. & Rosenkrantz, D.J.

Networks , Vol. 25 , pp. 59-68 , 1995

Marathe95 Simple Heuristics for Unit Graphs

Marathe, M.; Breu, H.; III, H.H.; Ravi., S. & Rosenkrantz, D.

Networks , Vol. 25 , pp. 59-68 , 1995



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

Marazzi, M. & Nocedal, J.

2000

marazzi2 Wedge Trust Region Methods for Derivative Free Optimization

Marazzi, M. & Nocedal, J.

2000

marchand3 Cutting planes in integer and mixed integer programming

Marchand, H.; Martin, A.; Weismantel, R. & Wolsey, L.A.


marchand2 Aggregation and mixed integer rounding to solve MIPs

Marchand, H. & Wolsey, L.A.


marchand1 The 0--1 knapsack problem with a single continuous variable

Marchand, H. & Wolsey, L.A.


marchetti1

url

url

url



Hierarchical vehicle routing problems

Marchetti Spaccamela, A.; Rinnooy Kan, A. & Stougie, L.

Networks , Vol. 14 , pp. 571-586 , 1984

Marchiori02 Genetic, iterated and multistart local search for the maximum clique problem

Marchiori, E.

Vol. 2279 , pp. 112-121 , 2002

mar97 Marcotte, O.

1997

Marcus64 Derivation of maximal compatibles using Boolean algebra

Marcus, P.M.

IBM J. Res. Develop. , Vol. 8 , pp. 537-538 , 1964

mars00 Wavelength Assignment Problem on All-Optical Networks with $k$ Fibres per Link

Margara, L. & Simon, J.

Automata, Languages and Programming. 27th International Colloquium, ICALP 2000 , Vol. 1853 , pp. 768-779 , 2000

margot1 Pruning by isomorphism in branch-and-cut

Margot, F.


margot2 Small covering designs by branch-and-cut

Margot, F.




MarMig03a Expanding neighborhood GRASP for the Traveling Salesman Problem

Marinakis, Y. & Migdalas, A.

2003

Markopoulou-failure-type Characterization of Failures in an IP Backbone

Markopoulou, A.; Iannaccone, G.; Bhattacharyya, S.; Chuah, C. & Diot, C.

Proc. of 23rd IEEE Conference on Computer Communication (INFOCOM'2004) , pp. 2307-2317 , 2004

markowitz2 Efficient portfolios, sparse matrices, and entities: a retrospective

Markowitz, H.


markowitz3 Portfolio selection: efficient diversification of investments

Markowitz, H.

Blackwell , 1991

markowitz1 Portfolio selection

Markowitz, H.

Journal of Finance , Vol. 7 , pp. 77-91 , 1952

maros3 A generalized dual phase-2 simplex algorithm

Maros, I.


maros2



A repository of convex quadratic programming problems

Maros, I.


maros1 Strategies for creating advanced bases for large-scale linear programming problems

Maros, I. & Mitra, G.


Marshall79 Inequalities: Theory of Majorization and its Applications

Marshall, A. & Olkin, I.

Academic Press, New York , 1979

OB1.doc OB1 User Documentation

Marsten, R.E.

1990

XMP The design of the XMP linear programming algorithm

Marsten, R.E.

Transactions on Mathematical Software , Vol. 7 , pp. 481-497 , 1988

MSSPB Implementation of a dual affine interior point algorithm for linear programming

Marsten, R.E.; Saltzmann, M.J.; Shanno, D.F.; Pierce, G.S. & Ballintijn, J.F.


Mar01a Arc crossing minimization in graphs with GRASP pdf url



Mart, R.


MarEst01a Incremental bipartite drawing problem

Mart, R. & Estruch, V.


MarLag97a Heuristics and meta-heuristics for 2-layer straight

line crossing minimization

Mart, R. & Laguna, M.

1997

martello2 An exact algorithm for the two-constraint 0-1 knapsack problem

Martello, S. & Toth, P.


martello1 Upper bounds and algorithms for hard 0-1 knapsack problems



MarToth98 Upper bounds and algorithms for hard $0-1$ knapsack problems



mar90 Knapsack Problems: Algorithms and Computer Implementations


pdf url



Wiley , 1990

marti1 Differentiation formulas for probability functions: The transformation methods

Marti, K.


martin1 Integer programs with block structure

Martin, A.

1998

Martin1999 Large scale linear and integer optimization: A unified approach

Martin, R.K.


Martin1987 Generating alternative mixed-integer programming models using variable redefinition

Martin, R.K.


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

url



Estratégias de Paralelização de Metaheursticas

em Ambientes de Memória Distribuda

S.L. Martins


Rio de Janeiro

, 1999

MarParResRib99a Greedy randomized adaptive search procedures for the Steiner problem in graphs

Martins, S.; Pardalos, P.; Resende, M. & Ribeiro, C.

Vol. 43 , pp. 133-145 , 1999

MarResRibPar00b A parallel GRASP for the Steiner tree problem in graphs

using a hybrid local search strategy


MarResRib99a A parallel GRASP for the Steiner problem in graphs using a hybrid local search

Martins, S.; Resende, M. & Ribeiro, C.

Proc. of the Third Metaheuristics International Conference , pp. 317-322 , 1999

MartinsEtAl00 A Parallel GRASP for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy

Martins, S.; Resende, M.; Ribeiro, C. & Pardalos, P.


MarRibRos04 Applications and parallel implementations of metaheuristics in network

pdf url



design and routing

Martins, S.; Ribeiro, C. & Rosseti, I.


MarResRib98 A parallel GRASP for the Steiner problem in graphs

Martins, S.; Ribeiro, C. & Souza, M.


MarRibSouz98a A parallel GRASP for the Steiner problem in

graphs

Martins, S.; Ribeiro, C. & Souza, M.

Vol. 1457 , pp. 285-297 , 1998

martinson1 An interior point method in Dantzig-Wolfe decomposition

Martinson, R.K. & Tind, J.

1996

Mar75 Nonlinear programming: Theory and methods

Martos, B.


MaruyamaTang1977 Discrete link capacity assignment in prioritized computer networks

Maruyama, K. & Tang, D.

IBM Journal of Research and Development , pp. 254-263 , 1977

MasThi01 A Review on Fault Location Methods and Their Application to Optical Networks



Mas, C. & Thiran, P.

Optical Networks Magazine , Vol. 2 , 2001

Mas-Collel95 Microeconomic Theory

Mas-Collel, A.; Whinston, M. & Green, J.


mascarenhas1 The affine scaling algorithm fails for stepsize 0.999

Mascarenhas, W.F.


MASE Advanced Traffic Control Methods for Network Management

Mase, A. & Yamamoto, H.

Communications Magazine , Vol. 28 , pp. 82-88 , 1990

ITC14 The fundamental role of teletraffic in the evolution of telecommunications networks

Massey, W.A.

Proceedings of the 14th International Teletraffic Congress , Vol. 1A , pp. 145-154 , 1994

mateosanz1 A comparative study of microaggregation methods

Mateo-Sanz, J.M. & Domingo-Ferrer, J.

Questuo , Vol. 22 , 1998

MateusFranqueira2000 Model and heuristic for a generalized access network design problem

Mateus, G.R. & Franqueira, R.V.L.


url



Ma86b Algoritmo Exato e Heuri sticas para o Problema de Loca-li-zacão

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.


MaCa92 O Problema de Localizacão Não Capacitado: Modelos e Algoritmos

Mateus, G. & Carvalho, J.


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.


MaFr00 Model and Heuristic for a Generalized Access Network Design Problem

Mateus, G. & Franqueira, R.




MaFr96 Model and Heuristic for a Generalized Access Network Design Problem


pp. accepted , 1996

MaFr95 Projeto de Redes de Acesso: Uma Heuri stica Lagrangeana


pp. 198-203 , 1995

MaLu92 Decentralized Decision-Making and Capacitated Facility Location

Mateus, G. & Luna, H.

The Annals of Regional Science , Vol. 26 , pp. 361-377 , 1992

MaLu89 Combinatorial Optimization in Telephonic Network Planning

Mateus, G. & Luna, H.

pp. 40-54 , 1989

MaLuLa90 Optimal Planning of Telecommunication Networks with Logical and Physical Aspects

Mateus, G.; Luna, H. & Lage, L.

pp. 602-607 , 1990

MaLuSi00 Heuristics for Distribution Network Design in Telecommunication

Mateus, G.; Luna, H. & Sirihal, A.


MateusEtAl00



Heuristics for Distribution Network Design in Telecommunication



MaLuSi96 A Distribution Network Configuration System


pp. accepted , 1996

MaPaLu96 Integrated Network Models for Local Access Network Design

Mateus, G.; Pádua, C.I.P.S. & Luna, H.

pp. 6-10 , 1996

Mat00 Optimum Positioning of Base Stations for Cellular Radio Networks

Mathar, R. & Niessen, T.


Mathar:Niessen Optimum positioning of base stations for cellular radio networks

Mathar, R. & Niessen, T.


Mat02 Integrated optimal cell site selection and frequency allocation for cellular radio networks

Mathar, R. & Schmeink, M.


Mat01 Optimal base station positioning and channel assignment for 3G mobile networks by integer programming





Mathar:Schmeink Optimal base station positioning and channel assignment for 3G mobile networks by integer programming



Mathur:Salkin:Nishimura:Morito Applications of integer programming in radio frequency management

Mathur, K.; Salkin, H.; Nishimura, K. & Morito, S.


MST90 A new efficient approximation algorithm for the Steiner tree problem in rectilinear graph

Matsumoto, T.; Saigan, N. & Tsuji, K.

Proceedings of the IEEE International Symposium on Circuits and Systems , pp. 2874-2876 , 1990

Mattheiss73 An Algorithm for Determining Irrelevant Constraints and all Verticies in Systems of Linear Inequalities

Mattheis, T.H.


Mattheiss80 A Survey and Comparison of Methods for Finding all Vertices of Convex Polyhedral Sets

Mattheis, T.H. & Rubin, D.S.


matula70 On the complete subgraph of a random graph

Matula, D.



pp. 356-369 , 1970

MatMarIsa72 Graph Coloring Algorithms. Graph Theory and Computing

Matula, D.; Marble, G. & Isaacson, J.


mauricio1 A Trust Region Method for Zero-One Nonlinear Programming

Mauricio, D. & Maculan, N.

RAIRO --- Operations Research , Vol. 31 , pp. 331-341 , 1997

mausser1 Minimizing maximum absolute regret for linear programs with uncertain, bounded costs

Mausser, H.E. & Laguna, M.

1996

ParPitMavRes98a A GRASP for the biquadratic assignment problem

Mavridou, T.; Pardalos, P.; Pitsoulis, L. & Resende, M.


maw92 Analyse: fondements, techniques, évolution

Mawhin, J.L.

De Boeck University , 1992

Mazumdar99 A highly efficient Monte Carlo method for assessment of system reliability based on a Markov model

Mazumdar, M.; Coit, D. & McBride, K.

American Journal of Mathematical and Management Sciences , Vol. 19 , pp. 115-33 , 1999



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.


Mazzini:Mateus:Smith Lagrangean based methods for solving large-scale cellular networks design problems

Mazzini, F.; Mateus, G. & Smith, J.


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.


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



McCormick, G.P.

1991

McC The projective SUMT method for convex programming

McCormick, G.P.


McCbook Nonlinear Programming: Theory, Algorithms and Applications

McCormick, G.P.

John Wiley , 1983

McC(T) Making sparse matrices sparser: computational results

McCormick, S.T.


McCormick83 Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem

McCormick, S.T.


mccormick3 Easy and difficult objective functions for max cut

McCormick, S.T.; Rao, M.R. & Rinaldi, G.


McD On the improvement per iteration in Karmarkar's algorithm for linear programming

McDiarmid, C.




mcgarvey1 A global optimal approach to facility location in the presence of forbidden regions

McGarvey, R.G. & Cavalier, T.M.


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.


mckinnon1 Convergence of the Nelder-Mead simplex method to a nonstationary point

McKinnon, K.I.M.


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.


mcshane4 On the superlinear convergence of an $O(n^3L)$ interior point algorithm for monotone LCP



McShane, K.A.


mcshane3 Superlinearly Convergent $O(nL)$-Iteration Interior-Point Algorithms For Linear Programming And The Monotone Linear Complementarity Problem

McShane, K.A.


MMS An implementation of a primal-dual interior point method for linear programming

McShane, K.A.; Monma, C.L. & Shanno, D.


MedResVei01a Piecewise linear time series estimation with GRASP

Medeiros, M.; Resende, M. & Veiga, A.


MedResVei99a Piecewise linear time series estimation with GRASP

Medeiros, M.; Resende, M. & Veiga, A.

1999

MedResVei02a A combinatorial approach to piecewise linear time

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

pdf url

pdf url



Medeiros, M.; Veiga, A. & Resende, M.

1999

Med94 A Unified Approach to Network Survivability for

Teletraffic Networks: Models, Algorithms and Analysis

Medhi, D.

IEEE Trans. on Communications , Vol. 42 , pp. 534-548 , 1994

Med91 Diverse Routing for Survivability in a Fiber-Based Sparse Network

Medhi, D.

Proc. IEEE International Conference on Communication (ICC'91) , pp. 672-676 , 1991

Medhi97 Network dimensioning and performance of multiservice, multirate loss networks using dynamic routing

Medhi, D. & Guptan, S.


MeK95 Optimization and

Performance of Network Restoration Schemes for Wide-Area

Teletraffic Networks

Medhi, D. & Khurana, R.


Medhi-Tipper-Discex Multi-Layered Network Survivability -- Models, Analysis, Architecture,

Framework and Implementation: An Overview

Medhi, D. & Tipper, D.



Proc. DARPA Information Survivability Conference and Exposition (DISCEX'2000) , Vol. I , pp. 173-186 , 2000

Medhi91 Stochastic models in queueing theory

Medhi, J.


mmb On the origin of power-laws in Internet topologies

Medina, A.; Matta, I. & Byers, J.

ACM Computer Communication Review , Vol. 30 , pp. 160-163 , 2000

medina:02 Traffic Matrix Estimation: Existing Techniques Compared and New Directions

Medina, A.; Taft, N.; Salamatian, K.; Bhattacharyya, S. & Diot, C.


Me98 Chance constrained stochastic programming for integrated services network management

Medova, E.


Medova98 Chance constrained stochastic programming for integrated services network management

Medova, E.


Medova95 Network flow algorithms for routing in networks with wavelength division multiplexing

Medova, E.



IEEE Proceedings Communications , Vol. 142 , pp. 238-242 , 1995

Meempat:Sundareshan_1997 Combined access control and routing for connection-oriented traffic in high-speed networks: a two-level approach

Meempat, G. & Sundareshan, M.


Meempat:Sundareshan_1993 Optimal channel allocation policies for access control of circuit-switched traffic in ISDN environments

Meempat, G. & Sundareshan, M.


megiddo4 On finding primal- and dual-optimal bases

Megiddo, N.


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.


Mehlhorn A faster approximation algorithm for the Steiner problem in graphs

Mehlhorn, K.


meh92

url



Constrained Graph Partitioning: Decomposition, Polyhedral Structure and Algorithms

A. Mehrotra

Georgia Institute of Technology , 1992

amehrotra2 Cliques and clustering: a combinatorial approach

Mehrotra, A. & Trick, M.A.


amehrotra1 A column generation approach for graph coloring



meh96 A column generation approach for graph coloring

Mehrotra, A. & Trick, M.


meh98 Cliques and Clustering: A Combinatorial Approach



Mehrotra4 Asymptotic convergence in a generalized predictor-corrector method

Mehrotra, S.


Mehrotra2 On the implementation of a primal-dual interior point method

Mehrotra, S.




Meh1 On finding a vertex solution using interior point methods

Mehrotra, S.


MehSun8811 On computing the center of a convex quadratically constrained set

Mehrotra, S. & Sun, J.


MehSun1 An algorithm for convex quadratic programming that requires $O(n^3L)$ arithmetic operations



MehSun8801 A method of analytic centers for quadratically constrained convex quadratic programs


1988

MehSun8808 An algorithm for solving smooth convex programs based on Newton's method


1988

mehrotra3 Conjugate Gradient Based Implementation of Interior Point Methods for Network Flow Problems

Mehrotra, S. & Wang, J.

pp. 124-142 , 1996

Mei72



On the optimization of message-switching networks

Meister, B.; Mueller, R. & Rudin~Jr, H.


Mei71 New optimization criteria for message-switching networks

Meister, B.; Mueller, R. & Rudin~Jr, H.

IEEE Trans. Comm. Technology , Vol. COM-19 , pp. 256-260 , 1971

melian05 Minimizing the Cost of Placing and Sizing Wavelength Division Multiplexing and Optical Crossconnect Equipment in a Telecommunications Network

Melián, B.; Laguna, M. & Moreno-Pérez, J.

Networks , Vol. 45 , pp. 199-209 , 2005

MelianEtAl2002b Capacity expansion of fiber optic networks with WDM systems: Problem formulation and comparative analysis

Melian, B.; Laguna, M. & Moreno-Perez, J.


Melkote:Daskin Capacitated facility location/network design problems

Melkote, S. & Daskin, M.


mel01 Optimal Design of Logical Topologies in Wavelength-Routed Optical Networks with Multicast Traffic

Mellia, M.; Nucci, A.; Grosso, A.; Leonardi, E. & Ajmone, M.

Global Telecommunications Conference, 2001. GLOBECOM '01. , Vol. 3 , pp. 1520 - 1525 , 2001

old_mel03 Optimal Design of Logical Topologies in Wavelength-Routed Optical url



Networks with Multicast Traffic

Mellia, M.; Nucci, A.; Grosso, A.; Leonardi, E. & Ajmone, M.

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.


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

Meneses, C.; Oliveira, C. & Pardalos, P.

pp. 1084 , 2004

Men27 Zur allgemeinen Kurventheorie

Menger, K.

Fundamenta Mathematicae , Vol. 10 , pp. 96-115 , 1927

pdf



MenPLS98 Third Generation Mobile Systems Planning Issues

Menolascino, R.; Pizarroso, M.; Lepschy, C. & Salas, B.


Merchant:Sengupta Assignment of cells to switches in PCS networks

Merchant, A. & Sengupta, B.


dumerle3 An interior point algorithm for minimum sum-of-squares clustering

Merle, O.d.; Hansen, P.; Jaumard, B. & Mladenovi, N.

SIAM Journal on Scientific Computing , Vol. 21(4) , pp. 1485-1505 , 2000

duM99 Stabilized Column Generation

Merle, O.d.; Villeneuve, D.; Desrosiers, J. & Hansen, P.

February 1998 (revised June 1998)

duMer99 Stabilized Column Generation



duM97 Stabilisation dans le cadre de la génération de colonnes


1997

merhjm97 An Interior Point Algorithm for Minimum Sum-of-squares Clustering

url



Merle, O.d.; Pierre, H.; Jaumard, B. & Mladenovic, N.

1997

merton2 Optimal investment strategies for university endowment funds

Merton, R.C.

pp. 371-396 , 1998

merton1 Lifetime portfolio selection under uncertainty: the continuous time case

Merton, R.C.

The Review of Economics and Statistics , Vol. L , pp. 247-257 , 1969

meszaros3 On free variables in interior point methods

Meszaros, C.


meszaros1 The `ìnexact'' 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

url



mey97 On Tuy's 1964 Cone Splitting Algorithm for Concave Minimization

Meyer, C.

1997

Mey74 Accelerated Frank-Wolfe algorithms

Meyer, G.


michelon1 Lagrangean decomposition for integer nonlinear programming with linear constraints

Michelon, P. & Maculan, N.


middleton1 Critical slowing down in polynomial time algorithms

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.


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

url



Migdalas, A.


Mi94 A regularization of the Frank-Wolfe method and unification of certain nonlinear programming methods

Migdalas, A.


miguel2 An interior-point method for MPECs based on strictly feasible relaxations

de Miguel, A.; Friedlander, M.; Nogales, F.J. & Scholtes, S.

2004

miguel1 Portfolio investment with the exact tax basis via nonlinear programming

de Miguel, A. & Uppal, R.

2004

MikamiTabuchi A computer program for optimal routing of printed circuit connectors

Mikami, K. & Tabuchi, K.

IFIPS Proceedings , Vol. H47 , pp. 1475-1478 , 1968

Milgrom89 Auctions and bidding: A primer

Milgrom, P.

Journal of Economic Perspectives , Vol. 3 , pp. 3-22 , 1989

MilPesBraLabRey01a Um algoritmo GRASP para o problema de transporte de derivados de petróleo em oleodutos

Proceedings of the XXXIII Brazilan Symposium on Operations Research , pp. 237-246 ,

url

url



2001

mil78 Using Cutting Planes to Solve the Symmetric Traveling Salesman Problem

Miliotis, P.


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.


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.


miller3 Tight MIP formulations for multi-item discrete lot-sizing problems

Miller, A.J. & Wolsey, L.A.


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



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.


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.


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 W-CDMA

Minn, T. & Siu, K.


MinS00



Dynamic assignment of orthogonal variable-spreading-factor codes in W-CDMA

Minn, T. & Siu, K.


min01 Discrete cost multicommodity network optimization problems and exact solution methods

Minoux, M.


min95 Mathematical Programming. Theory and Algorithms

Minoux, M.

John Wiley & Sons , pp. 489 , 1995

Minoux Efficient greedy heuristics for Steiner tree problems using reoptimization and supermodularity

Minoux, M.

INFOR , Vol. 28 , pp. 221-233 , 1990

Mi89 Network Synthesis and Optimum Network Design Problems: Models, Solution Methods and Applications

Minoux, M.

Networks , Vol. 19 , pp. 313-360 , 1989

min89 Network synthesis and optimum network design problems: models, solution methods and applications

Minoux, M.

Networks , Vol. 19 , pp. 313-360 , 1989

Mi87



Network Synthesis and Dynamic Network Optimization

Minoux, M.


min86b Network synthesis and dynamic network optimization

Minoux, M.


Minoux86 Mathematical Programming: Theory and Algorithms

Minoux, M.

Wiley-Interscience , 1986

min84 Subgradient optimization and Benders decomposition for large scale programming

Minoux, M.


min81 Optimum synthesis of a network with nonsimultaneous multicommodity flow requirements

Minoux, M.

Studies on Graphs and Discrete Programming , Vol. 11 , pp. 269-277 , 1981

min76a Optimisation et planification des réseaux de Télécommunications

Minoux, M.

Optimization Techniques , pp. 419-430 , 1976

min76b Multiflots de coûts minimal avec fonctions de coût concaves

Minoux, M.



Annales des Télécommunications , Vol. 31 , pp. 77-92 , 1976

minser84 Subgradient optimization and large scale programming: an application to network synthesis with security constraints

Minoux, M. & Serreault, J.

RAIRO , Vol. 15 , pp. 185-203 , 1984

MinouxAndSerreault Le programme d'admissibilité avec contraintes de sécurité et coûts de mutation

Minoux, M. & Serreault, Y.

Les Annales des Télé-com-mu-ni-ca-tions , Vol. 35 , pp. 23-38 , 1980

min83 Programmation mathématique, théorie et algorithmes, tome 1

Minoux, M.

Dunod , 1983

MirayalaHashmiSherwani Switchbox Steiner tree problem in presence of obstacles

Mirayala, S.; Hashmi, J. & Sherwani, N.

Proceedings of the International Conference on Computer-Aided Design , pp. 536-539 , 1991

Mir00 Projections of the capacitated network loading problem

Mirchandani, P.


Mirchandani96 The Multi-Tier Tree Problem

Mirchandani, P.




mirchandani1 Shortest distance and reliability of probabilistic networks

Mirchandani, P.


MiFr90 Discrete Location Theory

Mirchandani, P. & Francis, R.


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



Polynomial interior point cutting plane methods

Mitchell, J.E.


JEM_realign Realignment in the National Football League: Did they get it right?

Mitchell, J.E.


JEM_hao Branch-and-cut algorithms for combinatorial optimization problems

Mitchell, J.E.

pp. 65-77 , 2002

JEM_eoo_b_c Branch-and-cut algorithms for integer programming

Mitchell, J.E.

2001

JEM_eoo_cut Cutting plane algorithms for integer programming

Mitchell, J.E.

2001

JEM_kway Branch-and-cut for the $k$-way equipartition problem

Mitchell, J.E.

2001

JEM_SDPbranch Restarting after branching in the SDP approach to MAX-CUT and similar combinatorial optimization problems

Mitchell, J.E.

url

url

url

url

url

url



Journal of Combinatorial Optimization , Vol. 5(2) , pp. 151-166 , 2001

JEMising Computational experience with an interior point cutting plane algorithm

Mitchell, J.E.


JEM_SOR97 An interior point cutting plane algorithm for Isingspin glass problems

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.


JEM_SOR97old An interior point cutting plane algorithm for Ising spin glass problems

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

Mitchell, J.E.

url

url

url

url



pp. 417-466 , 1996

JEM191 An interior point column generation method for linear programming using shifted barriers

Mitchell, J.E.


JEM190r Updating lower bounds when using Karmarkar's projective algorithm for linear programming

Mitchell, J.E.


JEM190 A note on updating lower bounds when using Karmarkar's projective algorithm for linear programming

Mitchell, J.E.

1990

JEM192 A dual projective algorithm for linear programming

Mitchell, J.E.

1990

Mitch Karmarkar's Algorithm and Combinatorial Optimization Problems

J. E. Mitchell

School of Operations Research and Industrial Engineering, Cornell University , 1988

MB_combined Solving linear ordering problems with a combined interior point/simplex cutting plane algorithm

Mitchell, J.E. & Borchers, B.

pp. 349-366 , 2000

url



JEMlord Solving real-world linear ordering problems using a primal-dual interior point cutting plane method



JEM204 A primal-dual interior point cutting plane method for the linear ordering problem



JEM_transcosts Rebalancing an Investment Portfolio in the Presence of Transaction Costs

Mitchell, J.E. & Braun, S.

2002

JEM_lp4t Interior point methods for large-scale linear programming

Mitchell, J.E.; Farwell, K. & Ramsden, D.

2004

JEM_MGCR_PP Interior point methods for combinatorial optimization

Mitchell, J.E.; Pardalos, P.M. & Resende, M.G.C.

Vol. 1 , pp. 189-297 , 1998

JEM_selorth Using selective orthonormalization to update the analytic center after the addition of multiple cuts

Mitchell, J.E. & Ramaswamy, S.

2002

Srini387

url

url

url

url



A long-step, cutting plane algorithm for linear and convex programming

Mitchell, J.E. & Ramaswamy, S.


MT6 Solving combinatorial optimization problems using Karmarkar's algorithm

Mitchell, J.E. & Todd, M.J.


MT3 Solving matching problems using Karmarkar's algorithm


Mathematical Developments Arising from Linear Programming (Contemporary Mathematics, Volume 114) , pp. 309-318 , 1991

MT1 On the Relationship Between the Search Directions in the Affine and Projective Variants of Karmarkar's Linear Programming Algorithm


pp. 237-250 , 1989

MT2 A variant of Karmarkar's linear programming algorithm for problems with some unrestricted variables


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


1989

MT5

url



Solving combinatorial optimization problems using Karmarkar's algorithm: Part~II: Computational results


1989

Mitchell97 Machine Learning

Mitchell, T.M.

McGraw Hill , 1997

Mitra02 Combine Network Economics and Engineering Over Many Scales

Mitra, D.

Plenary Speech at 6th INFORMS Telecommunications Conference , 2002

Mitra01 Techniques for Traffic Engineering of Multiservice Multipriority Networks

Mitra, D. & Ramakrishnan, K.G.


MitraRamakrishnanWang01 Combined economic modeling and traffic engineering: Joint optimization of pricing and routing in multi-service networks

Mitra, D.; Ramakrishnan, K. & Q.~Wang

Proceedings of 17th International Teletraffic Congress, Salvador, Brazil , 2001

Mitra05 Stochastic Traffic Engineering for Demand Uncertainty and Risk-Aware Network Revenue Management

Mitra, D. & Wang, Q.


Mitra03 Stochastic Traffic Engineering, with Applications to Network Revenue Management




Proceedings of IEEE INFOCOM2003 , 2003

Mitra032 Risk-Aware Network Profit Management in a Two-Tier Market


Proceedings of 18th International Teletraffic Congress -ITC18 , 2003

MitraWang02 Generalized Network Engineering, Optimal Pricing and Routing for Multi-Service Networks


Proceedings of SPIE: Scalable Service Provisioning and Traffic Control in IP Networks , Vol. 4868 , 2002

Mitra Investigations of some Branch and Bound Strategies for the Solution of Mixed Integer Linear Programs

Mitra, G.


mittelmann2a Benchmarking interior point LP/QP solvers

Mittelmann, H.


mittelmann1 Several SDP-codes on problems from SDPLIB

Mittelmann, H.

1998

mittelmann2b Decision Tree for Optimization Software

Mittelmann, H.



1998

mittelmann3 An Independent Benchmarking of SDP and SOCP Solvers

Mittelmann, H.D.


MiNo92 An Insert/Delete Heuristic for the Traveling Salesman Subset-Tour Problem with One Additional Constraint

Mittenthal, J. & Noon, C.


MiyaoSaito98 Optimal Design and Evaluation of Survivable WDM Transport Networks

Miyao, Y. & Saito, H.


mizuno11 A superlinearly convergent infeasible-interior-point algorithm for geometrical LCPs without a strictly complementary condition

Mizuno, S.


mizuno9 A predictor-corrector infeasible-interior-point algorithm for linear programming

Mizuno, S.


mizuno2 A new polynomial time method for a linear complementarity problem

Mizuno, S.


url



Mizuno1 $O(n^L)$-iteration and $O(n^3L)$-operation potential reduction algorithms for linear programming

Mizuno, S.


Mizuno_jorsj_90 An $O(n^3L)$ algorithm using a sequence for linear complementarity problems

Mizuno, S.


mizuno10 Global and Polynomial-Time Convergence of an Infeasible-Interior-Point Algorithm Using Inexact Computation

Mizuno, S. & Jarre, F.


mizuno15 Infeasible-interior-point primal-dual potential-reduction algorithms for linear programming

Mizuno, S.; Kojima, M. & Todd, M.J.


mizuno13 On two homogeneous self-dual approaches to linear programming and its extensions

Mizuno, S. & Todd, M.J.


Mizuno8 On adaptive step primal--dual interior--point algorithms for linear

programming

Mizuno, S.; Todd, M.J. & Ye, Y.

url

url



Mathematics of Operations Research , pp. 964-981 , 1993

mizuno14 Practical polynomial time algorithms for linear complementarity problems

Mizuno, S.; Yoshise, A. & Kikuchi, T.


MlaHan97 Variable neighbourhood search

Mladenovi, N. & Hansen, P.


MocEddMocMocRek97a Bayesian discrete and global optimization

Mockus, J.; Eddy, E.; Mockus, A.; Mockus, L. & Reklaitis, G.

Kluwer , 1997

37mod WDM-based packet networks

Modiano, E.


03mob Using grooming cross-connects to reduce ADM costs in SONET/WDM ring networks

Modiano, E. & Berry, R.

Proceedings of the Optical Fiber Communication Conference (OFC 2001) , Vol. 3 , pp. WL3-1 - WL3- , 2001

39mod Traffic grooming in WDM networks

Modiano, E. & Lin, P.


Modiano:Narula-Tam



Survivable lightpath routing: a new approach to the design of WDM-based networks

Modiano, E. & Narula-Tam, A.


moguerza1 Combining search directions using gradient flows

Moguerza, J.M. & Prieto, F.J.


Moitra97 Some new survivability measures for network analysis and design

Moitra, S.; Oki, E. & Yamanaka, N.


MEE99 A delay constrained shortest path algorithm for multicast routing in multimedia applications

Mokbel, M.; El-Haweet, W. & El-Derini, M.

Proceedings of IEEE Middle East Workshop on Networking , 1999

mokhtarian2 An Analytic Center Quadratic Cut Method for the Convex Quadratic Feasibility Problem

Mokhtarian, F.S. & Goffin, J.


mokhtarian4 An Analytic Center self-concordant Cut Method for the Convex Feasibility Problem


2000

mokhtarian1 A Nonlinear Analytic Center Cutting Plane Method for a Class of

url

url

url



Convex Programming Problems



mokhtarian3 A Path-Following Cutting Plane Method for some Monotone Variational Inequalities


1997

Mokh A Typology of Relationships Between Telecommunications and Transportation

Mokhtarian, P.L.

Transportation Research A , Vol. 24 , pp. 231-242 , 1990

Mokken79 Cliques, Clubs and Clans

Mokken, R.J.

Quality and Quantity , Vol. 13 , pp. 161-173 , 1979

moler1 Nineteen dubious ways to compute the exponential of a matrix, twenty-five years later

Moler, C. & Loan, C.V.


MolAN00a Cellular network capacity planning using the combination

algorithm for total optimization

Molina, A.; Athanasiadou, G. & Nix, A.


MolAN00b

url



Optimized base station location algorithm for next generation microcellular networks


Electronic Letters , Vol. 36 , pp. 668-669 , 2000

MolAN99 The authomatic location of base stations for optimized

cellular coverage: A new combinatorial approach



mr1 The size of the largest component of a random graph on a fixed degree sequence

Molloy, M. & Reed, B.

Combinatorics, Probability and Computing , Vol. 7 , pp. 295-306 , 1998

mr2 A critical point for random graphs with a given degree sequence

Molloy, M. & Reed, B.


mongeau1 Computing eigenelements of real symmetric matrices via optimization

Mongeau, M. & Torki, M.

1999

monsha89 Methods for designing communication networks with certain two--connected survivability constraints

Monma, C. & Shallcross, D.


url



MoMo Computational experience with a dual affine variant of Karmarkar's method for linear programming

Monma, C.L. & Morton, A.J.


des90-1 Minimum-weight two-connected spanning networks

Monma, C.; Munson, B. & Pulleyblank, W.


MonmaSchrijverToddWei1990 Convex resource allocation problems on directed acyclic graphs: Duality, complexity, special cases and extensions

Monma, C.; Schrijver, A.; Todd, M. & Wei, V.


des89-1 Methods for designing communications networks with

certain two-connected survivability constraints



Monma89 Methods for designing communications networks with certain two-connected survivability constraints



MoSh89 Methods for Designing Communications Networks with Certain Two-Connected Survivability Constraints





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.


monteiro20 First- and second-order methods for semidefinite programming

Monteiro, R.D.C.


monteiro11 Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on Monteiro and Zhang Family of Directions

Monteiro, R.D.C.


monteiro6b Primal-Dual Path Following Algorithms for Semidefinite Programming

Monteiro, R.D.C.


monteiro7 On Two Interior-Point Mappings for Nonlinear Semidefinite Complementarity Problems

Monteiro, R.D.C.

1996

MAd3

url

url

url



An extension of Karmarkar type algorithm to a class of convex separable programming problems with global linear rate of convergence

Monteiro, R.D.C. & Adler, I.

Mathematics of Operations research , Vol. 15(3) , pp. 408-422 , 1990

MAd1 Interior path following primal-dual algorithms. Part I: Linear programming



MAd2 Interior path following primal-dual algorithms. Part II: Convex quadratic programming



OldMAd1 An $O(n^3L)$ primal-dual algorithm for linear programming


1987

OldMAd2 An $O(n^3L)$ interior point algorithm for convex quadratic programming


1987

MAdR A polynomial-time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension

Monteiro, R.D.C.; Adler, I. & Resende, M.G.C.


monteiro10 A general parametric analysis approach and its implication to sensitivity



analysis in interior point methods

Monteiro, R.D.C. & Mehrotra, S.


monteiro21 Uniform boundedness of a preconditioned normal matrix used in interior point methods

Monteiro, R.D.C.; O'Neal, J.W. & Tsuchiya, T.

2003

monteiro14 A Potential Reduction Newton Method for Constrained Equations

Monteiro, R.D.C. & Pang, J.


monteiro19 A variant of the Vavasis-Ye layered-step interior-point algorithm for linear programming

Monteiro, R.D.C. & Tsuchiya, T.

2001

monteiro17 Polynomial Convergence of Primal-Dual Algorithms for the Second-Order Cone Program Based on the MZ-Family of Directions



monteiro12 Polynomiality of Primal-Dual Algorithms for Semidefinite Linear Complementarity Problems Based on the Kojima-Shindoh-Hara Family of Directions



monteiro13 Polynomial Convergence of a New Family of Primal-Dual

url

url

url

url

url

url



Algorithms for Semidefinite Programming



monteiro5 Global convergence of the affine scaling algorithm for convex quadratic programming



monteiro6a Trust region affine scaling algorithms for linearly constrained convex and concave programs

Monteiro, R.D.C. & Wang, Y.


Monteiro1 A superlinear infeasible-interior-point affine scaling algorithm for LCP

Monteiro, R.D.C. & Wright, S.J.


Monteiro2 Superlinear primal-dual affine scaling algorithms for LCP


1993

monteiro18 A globally and superlinearly convergent potential reduction interior point method for convex programming


1992

monteiro9 A Note on the Existence of the Alizadeh-Haeberly-Overton Direction for Semidefinite Programming

url

url



Monteiro, R.D.C. & Zanjacomo, P.


monteiro16 General Interior-Point Maps and Existence of Weighted Paths for Nonlinear Semidefinite Complementarity Problems

Monteiro, R.D.C. & Zanjacomo, P.R.


monteiro15 Implementation of Primal-Dual Methods for Semidefinite Programming Based on Monteiro and Tsuchiya Newton Directions and their Variants

Monteiro, R.D.C. & Zanjacomo, P.R.


monteiro8 A Unified Analysis for a Class of Path-Following Primal-Dual Interior-Point Algorithms for Semidefinite Programming

Monteiro, R.D.C. & Zhang, Y.


monteiro3 On the existence and convergence of the central path for convex programming and some duality results

Monteiro, R.D.C. & Zhou, F.

Computation Optimization and Applications , Vol. 10 , pp. 51-77 , 1998

monteiro4 On superlinear convergence of infeasible-interior-point algorithms for linearly constrained convex programs

Monteiro, R.D.C. & Zhou, F.

1995

montemanni01 Lower bounds for fixed spectrum frequency assignment

url

url

url



Montemanni, R.; Smith, D.H. & Allen, S.M.


Montemanni:Smith:Allen An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem

Montemanni, R.; Smith, D. & Allen, S.


MoonMoser65 On cliques in graphs

Moon, J.W. & Moser, L.

Israel Journal of Mathematics , Vol. 3 , pp. 23-28 , 1965

Moo59a The Shortest Path through a Maze

Moore, E.

Proceedings of the International Symposiumon the Theory of Switching , pp. 285-292 , 1959

more Computing a trust region step

Moré, J.J. & Sorensen, D.S.

SIAM J. Sci. Statist. Comput. , Vol. 4 , pp. 553-572 , 1983

more2 Optimization Software Guide

Moré, J.J. & Wright, S.

SIAM , 1993

more3 Automatic Differentiation Tools in Optimization Software

Moré, J.J.

2001

url



more1 Distance geometry optimization for protein structures

Moré, J.J. & Wu, Z.

1997

MGH Testing unconstrained optimization software

Moré, J.; Garbow, B. & Hillström, K.


morales1 Automatic preconditioning by limited memory quasi-Newton updating

Morales, J.L. & Nocedal, J.

1997

morales2 Assessing the Potential of Interior Methods for Nonlinear Optimization

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

url

url

url



Morley, G. & Grover, W.

Proceedings of IEEE Canadian Conference on Electrical and Computer Engineering , pp. 220-225 , 1999

morton1 Optimal portfolio management with fixed transaction costs

Morton, A.J. & Pliska, S.J.

Mathematical Finance , Vol. 5 , pp. 337-356 , 1995

moscato1 On the performance of heuristics on finite and infinite fractal instances of the euclidean traveling salesman problem

Moscato, P. & Norman, M.G.


Moscibroda04 Efficient Computation of Maximal Independent Sets in Unstructured Multi-Hop Radio Networks

Moscibroda, T. & Wattenhofer, R.

Proceedings of the First International Conference on Mobile Ad-hoc and Sensor Systems (MASS) , 2004

mosheyev1 Penalty/Barrier Multiplier Algorithm for Semidefinite Programming

Mosheyev, L. & Zibulevsky, M.

1999

Mota1 A penalty function-linear programming method for solving power system constrained economic operation systems

Mota-Palomino, R. & Quintana, V.H.

IEEE Transactions on Power Apparatus and Systems , Vol. 103 , pp. 1414-1422 , 1984

MotOchMar01a (GRASP) metaheuristics to the generalized covering

url



tour problem

Motta, L.; Ochi, L. & Martinhon, C.


MotzkinStraus65 Maxima for graphs and a new proof of a theorem of Turán

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.


OSPF OSPF Version 2

Moy, J.

RFC 2328 , 1998

rfc2328 OSPF Version 2

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

url



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.




mukherjee-probabilistic A Probabilistic Model for Optimal Searching of the Deep Web

Mukherjee, S.

2003

Mulvey:Crowder Cluster Analysis: An Application of Lagrangian Relaxation

Mulvey, J. & Crowder, H.


mulvey4 Introduction to financial optimization: Mathematical Programming special issue

Mulvey, J.M.


mulvey2 Linking strategic and tactical planning systems for asset and liability management

Mulvey, J.M.; Madsen, C. & Morin, F.


mulvey6 Rebalancing strategies for long-term investors

Mulvey, J.M. & Simsek, K.

Vol. 74 , 2002

mulvey1 Robust optimization of large-scale systems

Mulvey, J.M.; Vanderbei, R.J. & Zenios, S.J.


mulvey7

url

url



Stochastic network programming for financial-planning problems

Mulvey, J.M. & Vladimirou, H.


mulvey5 Solving multistage stochastic networks: An application of scenario generation

Mulvey, J.M. & Vladimirou, H.

Networks , Vol. 21 , pp. 619-643 , 1991

mulvey8 Capturing correlations of fixed-income instruments

Mulvey, J.M. & Zenios, S.


mulvey9 Asset and liability management systems for long-term investors: discussion of the issues

Mulvey, J.M. & Ziemba, W.T.

pp. 3-38 , 1998

MulyanaKillat OPTIMIZATION OF IP NETWORKS IN VARIOUS HYBRID IGP/MPLS ROUTING SCHEMES

Mulyana, E. & Killat, U.

Murakami96 Virtual path routing for survivable ATM networks

Murakami, K. & Kim, H.


muramatsu5 A pivotting procedure for a class of second-order cone programming

url



Muramatsu, M.

2003

muramatsu3 On Commutative Class of Search Directions for Linear Programming over Symmetric Cones

Muramatsu, M.

2000

muramatsu1 Affine scaling algorithm fails for semidefinite programming

Muramatsu, M.


muramatsu4 A New Second-Order Cone Programming Relaxation for MAX-CUT problems

Muramatsu, M. & Suzuki, T.

2001

muramatsu2 Primal-dual affine-scaling algorithms fail for semidefinite programming

Muramatsu, M. & Vanderbei, R.J.


Mu70 Braess's paradox of traffic flow

Murchland, J.


Murota-Tamura-2003 New characterizations of M-convex functions and their applications to economic equilibrium models

Murota, K. & Tamura, A.

url

url

url

url




Murota-Tamura-2001 Application of $m$-convex submodular flow problem to mathematical economics

Murota, K. & Tamura, A.

Algorithms and Computation, Proc.~of 12th International Symposium, ISAAC 2001 , Vol. 2223 , pp. 14-25 , 2001

Murphey99 Frequency assignment problems

Murphey, R.A.; Pardalos, P.M. & Resende, M.G.C.

1999

MurParPit98 A parallel GRASP for the data association multidimensional assignment problem

Murphey, R.; Pardalos, P. & Pitsoulis, L.

IMA Volumes in Mathematics and Its Applications , Vol. 106 , pp. 159-180 , 1998

MurParPit98a A greedy randomized adaptive search procedure for the multitarget multisensor tracking problem


Vol. 40 , pp. 277-301 , 1998

MurParPit98b A parallel GRASP for the data association multidimensional assignment problem


Vol. 106 , pp. 159-180 , 1998

MuPaRe99 Frequency assignment problems

Murphey, R.; Pardalos, P. & Resende, M.



Vol. Supplement Volume A , pp. 60-67 , 1999

Murphy96 Feedback And Efficiency In ATM Networks

Murphy, L.; Murphy, J. & MacKie-Mason, J.K.

Proceedings of the International Conference on Communications (ICC'96) , 1996

Murphy94 Bandwidth Allocation by Pricing ATM Networks

Murphy, L.; Murphy, J. & Mackie-Mason, J.K.

Broadband Communications, II, Proceedings of the IFIP TC6 Second International Conference on Broadband Communications C-24 , 1994

murray1 A sequential quadratic programming algorithm using an incomplete solution of the subproblem

Murray, W. & Prieto, F.J.


MINOS93 MINOS 5.4 User's Guide

Murtagh, B.A. & Saunders, M.A.

1993

murtagh2 A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints



murtagh1 Large scale linearly constrained optimization





murtagh3 MINOS 5.5 User's Guide


Vol. 14 , 1978

mur02 WDM Optical Networks. Concepts, Design and Algorithms

Murthy, C. & Gurusamy, M.


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.


Myerson-1981 Optimal Auction Design

Myerson, R.B.




Mys01a Greedy randomised adaptive search procedures (GRASP)

for topological design of MPLS networks

Myslek, A.

Proceedings of the 8th Polish Teletraffic Symposium , 2001

MysKar02a Heuristic methods for topological design of telecomminication

networks

Myslek, A. & Kara, P.

Proceedings of PGTS 2002 , 2002

MyKiTc97 Optimal load balancing on SONET bidirectional rings

Myung, Y.; Kim, H.; Tcha, & D.


Myung:Kim A cutting plane algorithm for computing k-edge survivability of a network

Myung, Y. & Kim, H.


Myung:Kim:Tcha Design of communication networks with survivability constraints

Myung, Y.; Kim, H. & Tcha, D.


Mueller-2005 Tractable Cases of the Winner Determination Problem

Müller, R.



2005

MuellerHannemannPeyer03 Approximation of Rectilinear Steiner Trees with Length Restrictions on Obstacles

Müller-Hannemann, M. & Peyer, S.

pp. 207-218 , 2003

megiddo3 A Modified Layered-Step Interior-Point Algorithm for Linear Programming

N. Megiddo, S.M. & Tsuchiya, T.


Nisan-Ronen-2001 Algorithmic mechanism design

N., N. & Ronen, A.

Games and Economic Behavior , Vol. 35 , pp. 166-196 , 2001

naddef1 The symmetric traveling salesman polytope revisited

Naddef, D. & Pochet, Y.


nagamochi2 A fast algorithm for computing minimum 3-way and 4-way cuts

Nagamochi, H. & Ibaraki, T.


nagamochi1 Maximum flows in probabilistic networks

Nagamochi, H. & Ibaraki, T.

Networks , Vol. 21 , pp. 645-666 , 1991

NagK96

url



Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey

Naghshineh, M. & Katzela, I.

IEEE Personal Communications , Vol. 3 (3) , pp. 10-31 , 1996

Nag3 Navigating the Network Economy

Nagurney, A.

OR/MS Today , pp. 74-75 , 2000

Nag4 A Multiclass, Multicriteria Traffic Network Equilibrium Model

Nagurney, A.


Nag5 Sustainable Transportation Networks

Nagurney, A.

Edward Elgar Publishing , 2000

Nag2 Network Economics: A Variational Inequality Approach

Nagurney, A.


nagurney1 Network Economics: A Variational Inequality Approach

Nagurney, A.


Nag1 Comparative Tests of Multimodal Traffic Equilibrium Methods

Nagurney, A.




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.


NagCruzMat Dynamics of Global Supply Chain Supernetworks

Nagurney, A.; Cruz, J. & Matsypura, D.


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



NagDong2 Supernetworks: Decision-Making for the Information Age



nagurney2



Supernetworks: Decision-Making for the Information Age


Edward Elgar Publishing Inc , 2002

NagDongMokh3 Multicriteria Network Equilibrium Modeling with Variable Weights for Decision-Making in the Information Age with Applications to Telecommuting and Teleshopping

Nagurney, A.; Dong, J. & Mokhtarian, P.L.


NagDongMokh2 Teleshopping Versus Shopping: A Multicriteria Network Equilibrium Framework



NagDongMokh1 Integrated Multicriteria Network Equilibrium Models for Commuting Versus Telecommuting


2000

NagDongZhang A Supply Chain Network Equilibrium Model

Nagurney, A.; Dong, J. & Zhang, D.

Transportation Research E , Vol. 38 , pp. 281-303 , 2002

NagKe2 Financial Networks with Electronic Commerce: Modeling, Analysis, and Computations

Nagurney, A. & Ke, K.

Quantitative Finance , Vol. 3 , pp. 71-87 , 2003

NagKe1



Financial Networks with Intermediation

Nagurney, A. & Ke, K.

Quantitative Finance , Vol. 1 , pp. 309-317 , 2001

NagKe3 Dynamics of Supply Chains: A Multilevel (Logistical / Informational / Financial) Network Perspective

Nagurney, A.; Ke, K.; Cruz, J.; Hancock, K. & Southworth, F.

Environment & Planning , Vol. 29 , pp. 795-818 , 2002

NagLoo Supply Chain Networks and Electronic Commerce: A Theoretical Perspective

Nagurney, A.; Loo, J.; Dong, J. & Zhang, D.

Netnomics , Vol. 4 , pp. 187-220 , 2002

NagSio Financial Networks: Statics and Dynamics

Nagurney, A. & Siokos, S.


NagFum2 Reverse Supply Chain Management and Electronic WasTe Recycling: A Multitiered Network Equilibrium Framework for E-Cycling

Nagurney, A. & Toyasaki, F.

Transportation Research E , Vol. 41 , pp. 1-28 , 2005

NagFum1 Supply Chain Supernetworks and Environmental Criteria

Nagurney, A. & Toyasaki, F.

Transportation Research D , Vol. 8 , pp. 185-213 , 2003

NagZhang Projected Dynamical Systems and Variational Inequalities with Applications



Nagurney, A. & Zhang, D.


Na84 Planejamento de Sistemas Telefônicos: Alocacão de Centro de Fios

Nakagawa, J.M.

FEE/UNICAMP , 1984

NAKAGOME Flexible Routing in the Global Communication Network

Nakagome, Y. & Mori, H.

Proc. 7th International Teletraffic Congress, ITC7 , 1973

nakata1 Exploiting Sparsity in Semidefinite Programming via Matrix Completion II: Implementation and Numerical Results

Nakata, K.; Fujisawa, K.; Fukuda, M.; Kojima, M. & Murota, K.


00nak Cost-merit estimation of introducing optical layer with efficient traffic grooming

Nakata, T.; Kanetake, T. & Sasaki, S.

OFC/IOOC '99 , pp. 65 - 67 , 1999

des90-4 A fast algorithm for optimally increasing the

edge-connectivity

Naor, D.; Gusfield, D. & Martel, C.

Proceedings of the Foundation of Computer Science '90 , pp. 698-707 , 1990

Narahari03 Combinatorial auctions for electronic business

url



Narahari, Y. & Dayama, P.

2005

NaLiMo02 Efficient Routing and Wavelength Assignment for Reconfigurable WDM Networks

Narula-Tam, A.; Lin, P. & Modiano, E.


nar02 Efficient Routing and Wavelength Assignment for Reconfigurable WDM Networks

Narula-Tam, A.; Lin, P. & Modiano, E.


nascimento1 A Globally Convergent Infeasible Interior Point Method for Linear Constrained Convex Programming

Nascimento, R.d. & Oliveira, P.R.

2000

nash6 A Multigrid Approach to Discretized Optimization Problems

Nash, S.G.


nash4 A Multigrid Approach to Discretized Optimization Problems

Nash, S.G.

1999

nash5 SUMT (revisited)

Nash, S.G.

url

url

url




nash3 Software survey: nonlinear programming

Nash, S.G.

OR/MS Today , pp. 60-71 , 1995

nash1 On the Complexity of a Practical Interior-Point Method

Nash, S.G. & Sofer, A.


nash2 Why Extrapolation Helps Barrier Methods

Nash, S.G. & Sofer, A.

1998

N95 Network Loading and Connection Problems

M.G. Natu

Operations Research Dept., North Carolina State University , 1995

Na78 An Improved Algorithm for the Capacitated Facility Location Problems

Nauss, R.


nayakkankuppam1 Conditioning of semidefinite programs

Nayakkankuppam, M.V. & Overton, M.L.


nazareth4 The $D_LP$ Optimization Model and Decision Support System

url

url



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

Nazareth, J.L. & Tseng, P.

1998

eckstein9 Pivot, Cut, and Dive: A Heuristic for 0-1 Mixed Integer Programming

Nediak, M. & Eckstein, J.

2001

Neebe:Rao An Algorithm for the Fixed Charge Assignment of Users to Sources Problem

Neebe, A. & Rao, M.

url

url




Nel90 Combining Monte Carlo estimates and bounds for network reliability

Nel, L. & Colbourn, C.

Networks , Vol. 20 , pp. 277-98 , 1990

NW88 Integer and Combinatorial Optimization

Nem-hauser, G. & Wolsey, L.

Wiley , 1988

nemhauser5 A polyhedral approach to edge coloring

Nemhauser, G.L. & Park, S.


MINTO MINTO, a Mixed INTeger Optimizer

Nemhauser, G.L.; Savelsbergh, M.W.P. & Sigismondi, G.C.


nemhauser4 A strong cutting plane/branch-and-bound algorithm for node packing

Nemhauser, G.L. & Sigismondi, G.


NmSg A constraint generation algorithm for node packing

Nemhauser, G.L. & Sigismondi, G.

1988

nemhauser8 Scheduling a major college basketball conference



Nemhauser, G.L. & Trick, M.A.


nemhauser7 Vertex packings: structural properties and algorithms

Nemhauser, G.L. & Trotter Jr, L.E.


nemhauser6 Properties of vertex packing and independence system polyhedra

Nemhauser, G.L. & Trotter Jr, L.E.


NmWl2 Integer Programming

Nemhauser, G.L. & Wolsey, L.A.

pp. 447-527 , 1989

NmWl Integer and Combinatorial Optimization

Nemhauser, G.L. & Wolsey, L.A.

John Wiley , 1988

NemhauserWolsey1988 Integer and combinatorial optimization

Nemhauser, G.L. & Wolsey, L.


nem75 Vertex Packings: Structural Properties and Algorithms

Nemhauser, G. & Trotter, L.


nem74



Properties of Vertex Packing and Independence System Polyhedra

Nemhauser, G. & Trotter, L.


Nemhauser:Ullman A Note on the Generalized Multiplier Solution to an Integer Programming Problem

Nemhauser, G. & Ullman, Z.


wol99 Integer and Combinatorial Optimization

Nemhauser, G. & Wolsey, L.

Wiley , 1999, reprint of the 1988 edition

NemWol88 Integer and combinatorial optimization

Nemhauser, G. & Wolsey, L.

Wiley , 1988

nemp91 A polyhedral approach to edge coloring

Nemhauser, G.L. & Park, S.


nemirovski4 On Maximization of Quadratic form over Intersection of Ellipsoids with Common Center

Nemirovski, A.; Roos, C. & Terlaky, T.


nemirovskii5 On self-concordant convex-concave functions

Nemirovskii, A.

url




nemirovskii2 On polynomiality of the method of analytic centers for fractional problems

Nemirovskii, A.


nemirovskii1 Extension of Karmarkar's algorithm onto convex quadratically constrainted quadratic problems

Nemirovskii, A. & Scheinberg, K.


nemirovskii3 Problem Complexity and Method Efficiency in Optimization

Nemirovsky, A.S. & Yudin, D.B.

John Wiley , 1983

Nesterov1 Cutting plane algorithms from analytic centers: efficiency estimates

Nesterov, Y.


nesterov4 Complexity estimates of some cutting plane methods based on the analytic center

Nesterov, Y.


nesterov14 Introductory lectures on convex optimization: a basic course

Nesterov, Y.E.


nesterov10

url



Semidefinite relaxation and nonconvex quadratic optimization

Nesterov, Y.E.


nesterov6 Long-step strategies in interior-point primal-dual methods

Nesterov, Y.E.


nesterov11 Multi-parameter surfaces of analytic centers and long-step surface-following interior point methods

Nesterov, Y.E. & Nemirovski, A.


nesterov8 Interior Point Polynomial Methods in Convex Programming:

Theory and Algorithms

Nesterov, Y.E. & Nemirovsky, A.S.

SIAM , 1993

nesterov9 Homogeneous Analytic Center Cutting Plane Methods with approximate centers

Nesterov, Y.E.; Peton, O. & Vial, J.P.


nesterov13 On the Riemannian Geometry Defined by Self-Concordant Barriers and Interior-Point Methods

Nesterov, Y.E. & Todd, M.J.

2001

nesterov3

url

url



Primal-dual interior-point methods for self-scaled cones



nesterov2 Self-scaled barriers and interior-point methods for convex programming



nesterov5 Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems

Nesterov, Y.E.; Todd, M.J. & Ye, Y.


nesterov7 Homogeneous Analytic Center Cutting Plane Methods for Convex Problems and Variational Inequalities

Nesterov, Y.E. & Vial, J.P.


nesterov12 Augmented self concordant barriers and nonlinear optimization problems with finite complexity

Nesterov, Y.E. & Vial, J.

2000

nesn94 Interior-Point Polynomial Algorithms in Convex Programming

Nesterov, Y. & Nemirovskii, A.

SIAM , 1994

Netessine00 Supply chain structures on the Internet and the role of marketing -- Operations interaction

url

url

url



Netessine, S. & Rudi, N.

2004

NetPed03a GRASP for linear integer programming

Neto, T. & Pedroso, J.

pp. 545-574 , 2003

NetPed01a GRASP for linear integer programming

Neto, T. & Pedroso, J.


Neumaier Global Optimization Website

Neumaier, A.

Neuman1992 A system for priority routing and capacity assignment in packet switched networks

Neuman, I.


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

pdf url



Automatic Bounding Volume Hierarchy Generation Using Stochastic Search Methods

Ng, K. & Trifonov, B.

CPSC532D Mini-Workshop "Stochastic Search Algorithms" , 2003

NgHoang1987 Joint optimization of capacity and flow assignment in a packet-switched communications network

Ng, T. & Hoang, D.


Ng74 An algorithm for the traffic assignment problem

Nguyen, S.


nguyen03 A complete description for the k-path polyhedron

Nguyen, V.

2003

NTCS99 The broadcast storm problem in a mobile ad hoc network

Ni, S.; Tseng, Y.; Chen, Y. & Sheu, J.

Proceedings of MOBICOM , pp. 151-162 , 1999

nielsen1 Solving multistage stochastic network programs on massively parallel computers

Nielsen, S.S. & Zenios, S.A.


nielsen2 A stochastic programming model for funding single premium deferred annuities



Nielsen, S.S. & Zenios, S.A.


Pa93 Um Algoritmo para o Problema de Localizacão em Redes Capacitadas Baseado no Modelo de Fluxo de Custo Mi nimo

nio~Jr., Z.K.G. Patroc

DCC/UFMG , 1993

Nisan-2005 Bidding Languages for Combinatorial Auctions

Nisan, N.

2005

Nisan-2000 Bidding and Allocation in Combinatorial Auctions

Nisan, N.

2000

nisan00bidding Bidding and allocation in combinatorial auctions

Nisan, N.

ACM Conference on Electronic Commerce , pp. 1-12 , 2000

nobili3 $(0, 1)$ ideal matrices

Nobili, P. & Sassano, A.


nobili2 The anit-join composition and polyhedra


Discrete mathematics , Vol. 119 , pp. 141-166 , 1993



Nobili1 Facets and lifting procedures for the set covering polytope



nocedal2 On the Behavior of the Gradient Norm in the Steepest Descent Method

Nocedal, J.; Sartenaer, A. & Zhu, C.

2000

nocedal3 Numerical Optimization

Nocedal, J. & Wright, S.J.


nocedal1 Combining trust region and line search techniques

Nocedal, J. & Yuan, Y.

pp. 153-175 , 1998

Nocetti03 Connectivity-Based k-Hop Clustering in Wireless Networks

Nocetti, F.; Gonzalez, J. & Stojmenovic, I.


nolin95 Réseaux Haut Débit

Nolin, P.

Hermes , 1995

NordeEtAl01 Minimum cost spanning tree games and population monotonic allocation schemes

url



Norde, H.; Moretti, S. & Tijs, S.

2001

norkin1 On optimal allocation of indivisibles under uncertainty

Norkin, V.; Ermoliev, Y. & Ruszczyski, A.

???

norkin2 A branch and bound method for stochastic global optimization

Norkin, V.; Pflug, G.C. & Ruszczyski, A.


Noronha94 Optimum Routing of Multicast Streams

Noronha, C. & Tobagi, F.

pp. 865-873 , 1994

NT94 Optimum Routing of Multicast Streams

Noronha, C. & Tobagi, F.

IEEE INFOCOM'94 , pp. 865-873 , 1994

nor05 Routing and Wavelength Assignment by Partition Coloring

Noronha, T. & Ribeiro, C.

European Journal of Operational Research , 2005

NorRib04 Routing and wavelength assignment by partition coloring

Noronha, T. & Ribeiro, C.

2004

NoRuKa01



Steiner tree based distributed multicast routing

Novak, R.; Rugelj, J. & Kandus, G.

pp. 327-352 , 2001

NovakEtAl01 A note on distributed multicast routing in point-to-point networks

Novak, R.; Rugelj, J. & Kandus, G.


NucSanCraLeoMar01 Design of Fault-Tolerant Logical Topologies in Wavelength-Routed Optical IP Flows

Nucci, A.; Sanso, B.; Crainic, T.; Leonardi, E. & Ajmone~Marsan, M.

Proc. Global Telecommunications Conference -- GLOBECOM'01 , Vol. 4 , pp. 2098-2103 , 2001

nucci:03 IGP Link Weight Assignment for Transient Link Failures

Nucci, A.; Schroeder, B.; Bhattacharyya, S.; Taft, N. & Diot, C.

Proc. International Teletraffic Congress , 2003

Nucci-Sprint-ITC IGP Link Weight Assignment for Transient Link Failures

Nucci, A.; Schroeder, B.; Bhattacharyya, S.; Taft, N. & Diot, C.

Proc. 18th International Teletraffic Congress (ITC18) , pp. 321-330 , 2003

nunez2 A Characterization of Ill-Posed Data Instances for Convex Programming

Nunez, M.A.


nunez3 Condition-Measure Bounds on the Behavior of the Central Trajectory of a Semi-Definite Program

url

url



Nunez, M.A. & Freund, R.M.


nunez1 Condition Measures and Properties of the Central Trajectory of a Linear Program

Nunez, M.A. & Freund, R.M.


nurminski Separating plane algorithms for convex optimization

Nurminski, E.A.


okeefe1 MS/OR enabled systems

O'Keefe, R.M.


OK95 Lower bounds for the hub location problem

O'Kelly, M.; Skorin-Kapov, D. & Skorin-Kapov, J.


mah95 The Design of the European Optical Network

O'Mahony, M.; Simeonidu, D.; Yu, A. & Zhou, J.

Journal of Ligthwave Technology , Vol. 13 , pp. 817-828 , 1995

dumerle2 On improvements to the analytic center cutting plane method

O. du Merle, J.G. & Vial, J.

Computational Optimization and Applications , Vol. 11(1) , pp. 37-52 , 1998

url



dumerle1 On the Comparative Behavior of Kelley's Cutting Plane Method and the Analytic Center Cutting Plane Method

O. du Merle, J.G. & Vial, J.

1996

ODLYZKO Data Networks are Lightly Utilized, and will Stay that Way

Odlyzko, A.

The Review of Network Economics , Vol. 2 , pp. 210-237 , 2003

Odlyzko99 Paris metro pricing for the Internet

Odlyzko, A.

Proceedings of the 1st ACM conference on Electronic Commerce , pp. 140-147 , 1999

Oellermann99 On Steiner Centers and Steiner Medians of Graphs

Oellermann, O.

Networks , Vol. 34 , pp. 258-263 , 1999

OY97 Reliable Concurrent Multicast from Bursty Sources

Ofek, Y. & Yener, B.


Ogier86 A decomposition method for optimal link scheduling

Ogier, R.

Proceedings of the 24th Allerton Conference , pp. 822-823 , 1986

ogryczak1 On consistency of stochastic dominance and mean-semideviation models

Ogryczak, W. & Ruszczyski, A.

url




oliker1 Effects of ordering strategies and programming paradigms on sparse matrix computations

Oliker, L.; Li, X.; Husbands, P. & Biswas, R.


oliveira1 A New Class of Preconditioners for Large-Scale Linear Systems from Interior Point Methods for Linear Programming

Oliveira, A.R.L. & Sorensen, D.C.

1997

oliveira2 Computational Experience with a Preconditioner for Interior Point Methods for Linear Programming

Oliveira, A.R.L. & Sorensen, D.C.

1997

OliPar05 A survey of combinatorial optimization problems in multicast routing

Oliveira, C.A.S. & Pardalos, P.M.


OliParRes03a GRASP with path-relinking for the QAP

Oliveira, C.; Pardalos, P. & Resende, M.

Proceedings of the Fifth Metaheuristics International Conference , pp. 57-1 - 57-6 , 2003

Oliveira04 Optimization Problems in Telecommunications and the Internet

C.A.S. Oliveira

University of Florida , 2004

url

url



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.


OP04d Construction Algorithms and Approximation Bounds for the Streaming Cache Placement Problems in Multicast Networks


Cybernetics and systems Analysis , Vol. 41 , 2005

OliveiraPardalos03 A Survey of Combinatorial Optimization Problems in Multicast Routing


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



olsen1 Multistage stochastic programming with recourse: the equivalent deterministic problem

Olsen, P.


olson1 A likelihood-MPEC approach to target classification

Olson, T.; Pang, J. & Priebe, C.


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.


oosten1 The facial structure of the clique partitioning polytope

Oosten, M.; Rutten, J.H.G.C. & Spieksma, F.C.R.

1996

orda1

url



On continuous network flows

Orda, A. & Rom, R.


ordentlich1 The cost of achieving the best portfolio in hindsight

Ordertlich, E. & Cover, T.M.


ordonez1 Computational Experience and the Explanatory Value of Condition Numbers for Linear Optimization

Ordonez, F. & Freund, R.M.

2002

Orincsay:Szviatovszki:Bohm Prompt partial path optimization in MPLS networks

Orincsay, D.; Szviatovszki, B. & Böhm, G.

Computer Networks: The International Journal of Computer and Telecommunications Networking , Vol. 43 , pp. 557-572 , 2003

ortwol03 A branch-and-cut algorithm for the single-commodity uncapacitated fixed-charge network flow problem

Ortega, F. & Wolsey, L.

Networks , Vol. 41 , pp. 143-158 , 2003

OsborneGillett A comparison of two simulated annealing algorithms applied to the directed Steiner problem on networks

Osborne, L. & Gillett, B.


osborne1 When LP is not a good idea --- using structure in polyhedral

url

url



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

Oskoorouchi, M.R. & Goffin, J.

2004

oskoorouchi1 The Analytic Center Cutting Plane Method with Semidefinite Cuts



oskoorouchi3 An interior point cutting plane method for convex feasibility problem with second-order cone inequalities


2003

osman1 Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

Osman, I.H.


OsmAyoBarHas00a A greedy random adaptive search procedure for the

weighted maximal planar graph problem

url

url

url



2000

OsmHasAbd02a Linear programming based meta-heuristics for the weighted

maximal planar graph

Osman, I.; Hasan, M. & Abdullah, A.


00ouc Survivable traffic grooming in WDM mesh networks

Ou, C.; Zhu, K.; Mukherjee, B.; Zang, H. & Sahasrabuddhe, L.


21ou Traffic grooming for survivable WDM networks - shared protection

Ou, C.; Zhu, K.; Zang, H.; Sahasrabuddhe, L. & Mukherjee, B.


Ou95 Décomposition proximale des problèmes de multiflot à critère convexe. Application aux problèmes de routage dans les réseaux de communication

A. Ouorou

Université Blaise Pascal , 1995

ouo95 Décomposition proximale des problèmes de mutiflots à critère convexe. Application aux problèmes de routage dans les réseaux de communications

A. Ouorou

Université de Clermont-Ferrand , 1995

OuorouMaheyVial2000

pdf url



A survey of algorithms for convex multicommodity flow problems

Ouorou, A.; Mahey, P. & Vial, J.


Oual00 A survey of algorithms for convex multicommodity flow problems

Ouorou, A.; P.Mahey & Vial, J.P.


oustry1 A Second-Order Bundle Method to Minimize the Maximum Eigenvalue Function

Oustry, F.


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.


outrata2 A numerical approach to optimization problems with variational inequality constraints

Outrata, J.V. & Zowe, J.


Ovalle03 The effectiveness of using e-collaboration tools in the supply chain: An assessment study with system dynamics

url



Ovalle, O. & Marquez, A.

Journal of Purchasing & Supply Management , Vol. 9 , pp. 151-163 , 2003

overton2 Large-scale optimization of eigenvalues

Overton, M.


overton3 On minimizing the maximum eigenvalue of a symmetric matrix

Overton, M.


overton1 Semidefinite Programming (Foreword)

Overton, M. & Wolkowicz, H.


overton4 On minimizing the spectral radius of a nonsymmetric matrix function: optimality conditions and duality theory

Overton, M. & Womersley, R.S.


owen2 On the Value of Binary Expansions For General Mixed-Integer Linear Programs

Owen, J.H. & Mehrotra, S.


owen1 A Disjunctive Cutting Plane Procedure for General Mixed-Integer Linear Programs

Owen, J.H. & Mehrotra, S.

url

url




Ozdaglar:Bertsekas Routing and wavelength assignment in optical networks

Ozdaglar, A. & Bertsekas, D.


peton1 Multiple Cuts with a Homogeneous Analytic Center Cutting Plane Method

Péton, O. & Vial, J.


peton2 A brief tutorial on ACCPM

Péton, O. & Vial, J.

2001

PacVel03a Design of hybrids for the minimum sum-of-squares clustering problem

Pacheco, J. & Valencia, O.

Computational Statistics and Data Analysis , Vol. 43 , pp. 235-248 , 2003

padberg7 Almost perfect matrices and graphs

Padberg, M.


padberg6 Approximating separable nonlinear functions via mixed zero-one programs

Padberg, M.


Padberg2

url

url



The Boolean Quadric Polytope: Some Characteristics, Facets and Relatives

Padberg, M.


Pad1 A different convergence proof of the projective method for linear programming

Padberg, M.


Padberg:Rinaldi2 A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems

Padberg, M. & G.~Rinaldi


Padberg:Rinaldi1 A branch-and-cut approach to a traveling salesman problem with side constraints

Padberg, M. & G.~Rinaldi


PaGr Polyhedral Computations

Padberg, M. & Grötschel, M.

pp. 307-360 , 1985

PaRa Odd minimum cut-sets and $b$-matchings

Padberg, M. & Rao, M.R.


padberg5 Location, scheduling, design and integer programming



Padberg, M. & Rijal, M.P.


padrin91 A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems

Padberg, M. & Rinaldi, G.

S.I.A.M. Review , Vol. 33 , pp. 60-100 , 1991

PaRi3 A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems



PaRi2 Facet identification for the traveling salesman problem



PaRi4 An efficient algorithm for the minimum capacity cut problem



PaRi Optimization of a 532-city traveling salesman problem by branch and cut



pad73 On the Facial Structure of Set Packing Polyhedra

Padberg, M.




gra82-1 Odd minimum cut-sets and $b$-matchings

Padberg, M. & Rao, M.


des85-1 Valid Linear Inequalities for Fixed Charge

Problems

Padberg, M.; Van Roy, T. & Wolsey, L.


PaVaWo85 Valid linear inequalities for fixed charge problems

Padberg, M.; Roy, T.V. & Wolsey, L.


Page91 A note on computing environments and network reliability

Page, L. & Perry, J.


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



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.


PalTom02a GRASP implementations for the unconstrained binary

quadratic optimization problem

Palubeckis, G. & Tomkevicius, A.

Information Technology and Control , Vol. 24 , pp. 14-20 , 2002

PamSep01 A solution to the hub center problem via a single-relocation algorithm with tabu search

Pamuk, F. & Sepil, C.


pdf url



pang1 Newton's method for $B$-differentiable equations

Pang, J.


pang2 On the global minimization of the Value-at-Risk

Pang, J. & Leyffer, S.

2003

tits1 A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization

Panier, E.R.; Tits, A.L. & Herskovits, J.N.

SIAM Journal on Control and Optimization , Vol. 26 , pp. - , 1988

Panyukov04 The Steiner Problem in Graphs: Topological Methods of Solution

Panyukov, A.


P94 Computational Complexity

Papadimitriou, C.

Addison Wesley , 1994

Papa Combinatorial Optimization: Algorithms and Complexity

Papadimitriou, C.H. & Steiglitz, K.

Dover Publications, Inc. , 1988

PaSt82 Combinatorial Optimization: Algorithms and Complexity

url

url



Papadimitriou, C. & Steiglitz, K.


PS82 Combinatorial Optimization

Papadimitriou, C. & Steiglitz, K.


pap81 On the complexity of integer programming

Papadimitriou, C.H.


Papadimitriou04 Energy-Aware Broadcast Trees in Wireless Networks

Papadimitriou, I. & Georgiadis, L.


Pap74a Implementation and Efficiency of Moore-algorithms for

the Shortest Route Problem

Pape, U.


pardalos7 Construction of test problems in quadratic bivalent programming

Pardalos, P.M.


pardalos11 Generation of large-scale quadratic programs for use as global optimization test problems

Pardalos, P.M.




pardalos8 Complexity of uniqueness and local search in quadratic 0-1 programming

Pardalos, P.M. & Jha, S.


pardalos9 Graph separation techniques for quadratic zero-one programming

Pardalos, P.M. & Jha, S.

Computers Math. Applic. , Vol. 21 , pp. 107-113 , 1991

panos-ch The graph coloring problem: a bibliographic survey

Pardalos, P.M.; Mavridou, T. & Xue, J.

Vol. 2 , pp. 331-395 , 1999

ParQiaRes99a A greedy randomized adaptive search procedure for the feedback vertex set problem

Pardalos, P.M.; Qian, T. & Resende, M.G.C.


pardalos6 Implementation of a variance reduction-based lower bound in a branch-and-bound algorithm for the quadratic assignment problem

Pardalos, P.M.; Ramakrishnan, K.G.; Resende, M.G.C. & Li, Y.


pardalos10 The quadratic assignment problem: A survey and recent developments

Pardalos, P.M.; Rendl, R. & Wolkowicz, H.

Vol. 16 , pp. 1-41 , 1994

pardalos3b



INTERIOR POINT METHODS FOR GLOBAL OPTIMIZATION

Pardalos, P.M. & Resende, M.G.C.

1995

Pardalos2 A branch and bound algorithm for the maximum clique problem

Pardalos, P.M. & Rodgers, G.P.

Computers Ops Res. , Vol. 19 , pp. 363-375 , 1992

pardalos4b Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture



pardalos5 Computational Aspects of a Branch and Bound Algorithm for Quadratic Zero-One Programming


Computing , Vol. 45 , pp. 131-144 , 1990

Par Financial Engineering, Supply Chain and E-Commerce

Pardalos, P.M. & Tsitsiringos, V.


pardalosvavasis Quadratic Programming with one Negative Eigenvalue is $NP$-hard

Pardalos, P.M. & Vavasis, S.A.


Pardalos1 The maximum clique problem

Pardalos, P.M. & Xue, J.

url



J. Global Optim. , Vol. 4 , pp. 301-328 , 1992

ParYeHan Algorithms for the solution of quadratic knapsack problems

Pardalos, P.M.; Ye, Y. & Han, C.


Pardalos4a Continuous approaches to discrete optimization problems

Pardalos, P.

pp. 313-328 , 1996

PK96 A Heuristic for the Steiner Problem on Graphs

Pardalos, P. & Khoury, B.

Comp. Opt. & Appl. , Vol. 6 , pp. 5-14 , 1996

PK95 An Exact Branch and Bound Algorithm for the Steiner Problem in Graphs

Pardalos, P. & Khoury, B.

Vol. 959 , pp. 582-590 , 1995

PKD93 A test problem generator for the steiner problem in graphs

Pardalos, P.; Khoury, B. & Du, D.


ParPitMavRes95a Parallel search for combinatorial optimization: Genetic

algorithms, simulated annealing and GRASP

Vol. 980 , pp. 317-331 , 1995

ParPitRes97a



Algorithm 769: Fortran subroutines for approximate

solution of

sparse quadratic assignment problems using GRASP

Pardalos, P.; Pitsoulis, L. & Resende, M.


ParPitRes96a A parallel GRASP for MAX-SAT problems



ParPitRes95a A parallel GRASP implementation for the quadratic

assignment problem


pp. 115-130 , 1995

ParRamResLi97a Implementation of a variance reduction based lower bound

in a branch and bound algorithm for the quadratic

assignment problem

Pardalos, P.; Ramakrishnan, K. & Li, M.R.<.Y.


ParResRap98a An exact parallel algorithm for the maximum clique problem

Pardalos, P.; Resende, M. & Rappe, J.

1998

par90 Computational Aspects of a Branch-and-Bound Algorithm for Quadratic

pdf url

pdf url

pdf url



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.


par92 Développement d'un algorithme exact pour la programmation non linéaire 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.


Park:Kang:Park An integer programming approach to the bandwidth packing problem

Park, K.; Kang, S. & Park, S.


Park:Lee:Park:Lee Telecommunication node clustering with node compatibility and network survivability requirements



Park, K.; Lee, K.; Park, S. & Lee, H.


ParkEtAl00 Telecommunication Node Clustering with Node Compatibility and Network Survivability Requirements

Park, K.; Lee, K.; Park, S. & Lee, H.


ParkShin03 Uncapacitated point-to-multipoint network flow problem and its application to multicasting in telecommunication networks

Park, K. & Shin, Y.

European Journal of Operational Research , Vol. 147 , pp. 405–-417 , 2003

isis-hold Short Adjacency Hold Times in IS-IS

Parker, J.; McPherson, D. & Alaettinoglu, C.

2001

ParRya94a A column generation algorithm for bandwidth packing

Parker, M. & Ryan, J.


ParkerRardin Discrete Optimization

Parker, R.G. & Rardin, R.L.


co88-1 Discrete Optimization

Parker, R. & Rardin, R.




parillo2 Semidefinite programming relaxations for semialgebraic problems

Parrilo, P.A.


parillo1 Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization

P. A. Parrilo

California Institute of Technology , 2000

parillo3 Minimizing Polynomial Functions

Parrilo, P.A. & Sturmfels, B.

2002

Par96 The mobile radio propagation channel

Parsons, D.


parthasarathy04 Fast Distributed Well Connected Dominating Sets for Ad Hoc Networks

Parthasarathy, S. & Gandhi, R.

2004

21par Waveband grooming and IP aggregation in optical networks

Parthiban, R.; Tucker, R. & Leckie, C.


Paschalidis00 Congestion-Dependent Pricing of Network Services

url

url

url



Paschalidis, I.C. & Tsitsiklis, J.N.


Pas98a A greedy randomized adaptive search procedure

for the multi-criteria radio link frequency

assignment problem

Pasiliao, E.

1998

PPX98 The multimedia multicasting problem

Pasquale, J.; Polyzos, G. & Xylomenos, G.

ACM Multimedia Systems Journal , Vol. 6 , pp. 43-59 , 1998

pastor2 Dynamical and correlation properties of the Internet

Pastor-Satorras, R.; Vazquez, A. & Vespignani, A.

Physical Review Letters , Vol. 87 , pp. 258701 , 2001

pastor Epidemic spreading in scale-free networks

Pastor-Satorras, R. & Vespignani, A.

Physical Review Letters , Vol. 86 , pp. 3200-3203 , 2001

pataki10 Teaching integer programming formulations using the traveling salesman problem

Pataki, G.


pataki11 On the closedness of the linear image of a closed convex cone. Part url



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

Pataki, G.

2000

pataki9 The Geometry of Semidefinite Programming

Pataki, G.

pp. 29-65 , 2000

pataki7 The geometry of cone LP's

Pataki, G.

1999

pataki1 On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues

Pataki, G.


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

url

url



Pataki, G. & Ceria, S.

1999

pataki4 The DIMACS library of mixed semidefinite-quadratic-linear programs

Pataki, G. & Schmieta, S.H.

2000

pataki3 On the generic properties of convex optimization problems in conic form

Pataki, G. & Tunçel, L.


tuncel6 On the generic properties of convex optimization problems in conic form

Pataki, G. & Tunçel, L.

1997

patricio1 Fortran subroutines for network flow optimization using an interior point algorithm

Patrício, J.; Portugal, L.F.; Resende, M.G.C.; Veiga, G. & Júdice, 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

url

url



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.


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.


PatRol02 Hybrid Fiber Coaxial Network Design

Patterson, R. & Rolland, E.


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



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.


Pearl Heuristics: Intelligent Search Techniques for Computer Problem Solving

Pearl, J.


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 block-structured perturbations

Pena, J.


pena5 Two properties of condition numbers for convex programs via implicitly defined barrier functions

Pena, J.


pena4 Computing approximate solutions for convex conic systems of equations

url



Pena, J.


pena3 Computing the distance to infeasibility: theoretical and practical issues

Pena, J.

1997

pena1 Understanding the geometry of infeasible perturbations of a conic linear system

Pena, J. & Renegar, J.

1997

pena2 Quickly computing backward-approximate solutions for ill-conditioned systems of linear inequalities and forward-approximate solutions for well-conditioned systems

Pena, J. & Renegar, J.

1997

jufeng1 Coordinating Multiple Robots with Kinodynamic Constraints along Specified Paths

Peng, J. & Akella, S.

Fifth Workshop on Algorithmic Foundations of Robotics (WAFR 2002) , 2002

peng6 Self-Regular functions and New Search Directions for Linear and Semidefinite Optimization

Peng, J.; Roos, C. & Terlaky, T.


peng9 A New and Efficient Large-Update Interior-Point Method for Linear

url

url

url

url

url

url



Optimization


2001

peng5 Self-Regular Proximities and New Search Directions for Linear and Semidefinite Optimization


2000

peng8 New primal-dual algorithms for second-order conic optimization based on self-regular proximities


2000

peng2 New Complexity Analysis of the Primal-Dual Method for Semidefinite Optimization based on the NT-direction


1999

peng3 A new class of polynomial primal-dual methods for linear and semidefinite optimization


1999

peng1 New Complexity Analysis of the Primal-Dual Newton Method for Linear Optimization


1998

peng7 Self-regular proximities and new search directions for nonlinear

url

url

url

url

url

url



$P_*()$ complementarity problems

Peng, J.; Roos, C.; Terlaky, T. & Yoshise, A.

2000

peng10 A Dynamic Large-Update Primal-Dual Interior-Point Method for Linear Optimization

Peng, J. & Terlaky, T.

2001

peng4 A non-interior continuation method for generalized linear complementarity problems

Peng, J. & Lin, Z.


Penn-Tennenholtz-2000 Constrained Multi-Object Auctions and B-matchings

Penn, M. & Tennenholtz, M.


Penn00:Constrained Constrained multi-object auctions and b-matching

Penn, M. & Tennenholtz, M.


Penso04 A distributed algorithm to find k-dominating sets

Penso, L.D. & Barbosa, V.C.


PRD01 Ad hoc On-demand Distance Vector (AODV) routing

Perkins, C.E.; Royer, E.M. & Das, S.R.

url



perold1 Large-scale portfolio optimization

Perold, A.F.


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.


petrovic1 Economic and environmental power dispatch

Petrovic, R. & Kralj, B.


PeyerZachariasenJorgensen Delay-related secondary objectives for rectilinear Steiner minimum trees

Peyer, S.; Zachariasen, M. & Jorgensen, D.


pflug2 Scenario tree generation for multiperiod financial optimization by optimal discretization

Pflug, G.C.


pflug1 Stochastic programs and statistical data



Pflug, G.C.


philpott1 Continuous-time flows in networks

Philpott, A.


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.


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.


PierreElgibaoui1997 A tabu-search approach for designing computer-network topologies with unreliable components

Pierre, S. & Elgibaoui, A.




PierreHoueto02 Assigning Cells to Switches in Cellular Mobile Networks Using Taboo Search

Pierre, S. & Houéto, 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

Pinar, M.C. & Tütüncü, R.

2004

pinar1 Parallel decomposition of multicommodity network flows using a linear-quadratic penalty algorithm

Pinar, M.C. & Zenios, S.A.


url



pinzen92 Parallel decomposition of multicommodity network flows using a linear quadratic penalty algorithm

Pinar, M. & Zenios, S.


JP Global optimization: software, test problems, and applications

Pintér, J.D.

Vol. 2 , pp. 515-569 , 2002

pinter1 Global Optimization in Action, Continuous and Lipschitz Optimization: Algorithms, Implementations and Applications

Pinter, J.


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.


PirkulNarasimhan1992



Hierarchical concentrator location problem

Pirkul, H. & Narasimhan, S.


PirkulNarasimhanDe1988 Locating concentrators for primary and secondary coverage in a computer communications network

Pirkul, H.; Narasimhan, S. & De, P.


PirkulSoni2003 New formulations and solution procedures for the hop constrained network design problem

Pirkul, H. & Soni, S.


pisinger1 Core problems in knapsack problems

Pisinger, D.


Pis98 A minimal algorithm for the $0-1$ knapsack problem

Pisinger, D.


pitsoulis1 Greedy randomized adaptive search procedures

Pitsoulis, L.S. & Resende, M.G.C.

pp. 168-183 , 2002

Pit99a Algorithms for nonlinear assignment problems

L.S. Pitsoulis

url



Department of Industrial and Systems Engineering,

University of Florida

, 1999

PitParHea01a Approximate solutions to the turbine balancing problem

Pitsoulis, L.; Pardalos, P. & Hearn, D.


PitParHea98a Approximate solutions to the turbine balancing problem

Pitsoulis, L.; Pardalos, P. & Hearn, D.

1998

Pioro-PE On OSPF Related Network Optimization Problems


Pioro-Medhi-book Routing, Flow and Capacity Design in Communication and Computer Networks

Pióro, M. & Medhi, D.

Morgan Kaufmann Publishers , 2004

PinPlaCamMar04a GRASP and path relinking for the matrix bandwidth

minimization

Piñana, E.; Plana, I.; Campos, V. & Mart, R.

European J. of Operational Research , Vol. 153 , pp. 200-210 , 2004

PinPlaCamMar03a GRASP and path relinking for the matrix bandwidth

minimization

pdf url



Piñana, E.; Plana, I.; Campos, V. & Mart, R.

2001

plambeck1 Sample-path optimization of convex stochastic performance functions

Plambeck, E.L.; Fu, B.; Robinson, S.M. & Suri, R.


Plesnik92 On some heuristics for the Steiner problem in graphs

Plesnik, J.

Fourth Czechoslowakian Symposium on Combinatorics, Graphs and Complexity , pp. 255-257 , 1992

PlesnikDAM Heuristics for the Steiner problem in graphs

Plesnik, J.

Discrete Applied Mathematics , Vol. 37/38 , pp. 451-463 , 1992

Plesnik91 Worst-case relative performance of heuristics for the Steiner problem in graphs

Plesnik, J.

Acta Math. Univ. Comenianae , Vol. 60 , pp. 269-284 , 1991

Plesnik A bound for the Steiner tree problem in graphs

Plesnik, J.

Math. Slovaca , Vol. 31 , pp. 155-163 , 1981

plotkin1 Fast approximation algorithms for fractional packing and covering problems

Plotkin, S.A.; Shmoys, D.B. & Tardos, &.




pochet1 The sequential knapsack polytope

Pochet, Y. & Weismantel, R.


Podnar:Skorin-Kapov:Skorin-Kapov Network cost minimization using threshold-based discounting

Podnar, H.; Skorin-Kapov, J. & Skorin-Kapov, D.


Pohjola02 The New Economy: Facts, impacts and policies

Pohjola, M.

Information Economics and Policy , Vol. 14 , pp. 133-144 , 2002

poljak2 Nonpolyhedral relaxations of graph-bisection problems

Poljak, S. & Rendl, F.


poljak5 Solving the max-cut problem using eigenvalues



poljak4 Node and edge relaxations of the max-cut problem


Computing , Vol. 52 , pp. 123-137 , 1994

poljak6 A recipe for semidefinite relaxation for (0,1)-quadratic programming



Poljak, S.; Rendl, F. & Wolkowicz, H.


poljak3 Maximum cuts and large bipartite subgraphs

Poljak, S. & Tuza, Z.

Vol. 20 , pp. 181-244 , 1995

poljak1 The Expected Relative Error Of The Polyhedral Approximation Of The Max-Cut Problem

Poljak, S. & Tuza, Z.


polvin1 On Steiner trees and minimum spanning trees in hypergraphs

Polvin, T. & Daneshmand, S.V.


bpolyak1 History of mathematical programming in the USSR: analyzing the historical phenomenon

Polyak, B.T.


polyak2 Modified barrier functions (theory and methods)

Polyak, R.


polyak1 Nonlinear rescaling and proximal-like methods in convex optimization

Polyak, R. & .Teboulle, M.




Polzin03 Algorithms for the Steiner Problem in Networks

T. Polzin

Universität des Saarlandes , 2003

PolzinDaneshmand03 On Steiner trees and minimum spanning trees in hypergraphs

Polzin, T. & Daneshmand, S.V.


PolzinVahdati02 Using (sub)graphs of small width for solving the Steiner problem


2002

PolzinDaneshmand01a A comparison of Steiner tree relaxations



PolzinDaneshmand01b Improved algorithms for the Steiner problem in networks



PolzinVahdati01 Partitioning techniques for the Steiner problem


2001

PolzinDiplom Algorithmen für das Steiner-Problem

Polzin, T. and Daneshmand, S. Vahdati



University of Dortmund , 1997

Ponnambalam1 An application of Karmarkar's interior-point linear programming algorithm for multi-reservoir operations optimization

Ponnabalam, K.; Vannelli, A. & Unny, T.E.

Stochastic Hydrology and Hydraulics , Vol. 3 , pp. 17-29 , 1989

Ponnambalam2 An interior point method implementation for solving large planning problems in the oil refinery industry

Ponnabalam, K.; Vannelli, A. & Woo, S.

Canadian Journal of Chemical Engineering , Vol. 70 , pp. 368-374 , 1992

PooConWarMel00 Successful application of genetic algorithms to network design and planning

Poon, K.; Conway, A.; Wardrop, G. & Mellis, J.

BT Technol. J. , Vol. 18 , pp. 32-41 , 2000

pop1 An easy way to obtain strong duality results in linear, linear semidefinite and linear semi-infinite programming

Pop, P. & Still, G.J.

1999

PopPicAriDem97a Design techniques for SDH mesh-restorable networks

Poppe, F.; Pickavet, M.; Arijs, P. & Demeester, P.

Proceedings of the European Conference on Networks

and Optical Communications (NOC'97), Volume 2:

Core and ATM Networks

, pp. 94-101 , 1997

Porter01

url



Strategy and the Internet

Porter, M.E.

Harvard Business Review , pp. 63-78 , 2001

portnoy1 The Gaussian Hare and the Laplacian Tortoise: Computability of squared-error vs. absolute-error estimators

Portnoy, S. & Koenker, R.

1997

portugal1 An investigation of interior point algorithms for the linear transportation problem

Portugal, L.; Bastos, F.; Júdice, J.; Paixão, J. & Terlaky, T.

SIAM Journal on Scientific Computing , Vol. 17 , pp. 1202-1223 , 1996

portugal4 A truncated Newton interior-point algorithm for the solution of a multicommodity spatial equilibrium model

Portugal, L.; Fernandes, L. & Júdice, J.

1995

portugal5 A hybrid algorithm for the solution of a single commodity spatial equilibrium model

Portugal, L. & Júdice, J.

1995?

portugal3 A Comparison Of Block Pivoting And Interior-Point Algorithms For Linear Least Squares Problems With Nonnegative Variables

Portugal, L.; Júdice, J. & Vincente, L.

Mathematics of Computation , Vol. 63 , pp. 625-643 , 1994

portugal2 A truncated primal-infeasible dual-feasible network interior point

url

url



method

Portugal, L.; Resende, M.; Veiga, G. & Júdice, J.

Networks , Vol. 35 , pp. 91-108 , 2000

potra9 Q-superlinear convergence of the iterates in primal-dual interior-point methods

Potra, F.


potra10 The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path

Potra, F.

2000

potra6 Predictor-corrector algorithm for solving $P_*()$-matrix LCP from arbitrary positive starting points

Potra, F.A. & Sheng, R.


potra8 A large-step infeasible-interior-point method for the $P_*$-matrix LCP

Potra, F.A. & Sheng, R.


potra3 On Homogeneous Interior-Point Algorithms for Semidefinite Programming

Potra, F. & Sheng, R.


potra4 Superlinear Convergence of Interior-Point Algorithms for

url

url

url



Semidefinite Programming


1996

potra5 Superlinear convergence of a predictor-corrector method for semidefinite programming without shrinking central path neighborhood


1996

potra2 A superlinearly convergent primal-dual infeasible-interior-point algorithm for semidefinite programming


1995

potra7 SDPHA -- a MATLAB implementation of Homogeneous Interior-Point Algorithms for Semidefinite Programming

Potra, F.; Sheng, R. & Brixius, N.

1997

Potra1 A quadratically convergent polynomial algorithm for solving entropy optimization problems

Potra, F. & Ye, Y.


potvin2 The vehicle routing problem with time windows --- Part II: Genetic search

Potvin, J. & Bengio, S.


potvin1 The vehicle routing problem with time windows --- Part I: Tabu search

url

url



Potvin, J.; Kervahut, T.; Garcia, B. & Rousseau, J.


powell3 On trust region methods for unconstrained minimization without derivatives

Powell, M.J.D.


powell4 UOBYQA: unconstrained optimization by quadratic approximation

Powell, M.J.D.


powell2 On the convergence of the DFP algorithm for unconstrained optimization when there are only two variables

Powell, M.J.D.


powell1 Some convergence properties of the modified log barrier method for linear programming

Powell, M.J.D.


warrenpowell1 Implementing real-time optimization models: a case application from the motor carrier industry

Powell, W.B.; Marar, A.; Gelfand, J. & Bowers, S.


Pra00a Estratégias de variação de parmetros

em procedimentos GRASP e aplicações



M. Prais


Rio de Janeiro

, 2000

PraRib00a Reactive GRASP: An application to a matrix

decomposition problem in TDMA traffic assignment

Prais, M. & Ribeiro, C.


PraRib00b Parameter variation in GRASP procedures



PraRib99b Parameter variation in GRASP implementations


Extended Abstracts of the Third Metaheuristics International Conference , pp. 375-380 , 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.




pressman1 A weighted analytic center for linear matrix inequalities

Pressman, I. & Jibrin, S.

Journal of Inequalities in Pure and Applied Mathematics , Vol. 2 , 2001

mst57-1 Shortest connection networks and some generalizations

Prim, R.

Bell System Tech. J. , Vol. 36 , pp. 1389-1401 , 1957

P57 Shortest Connection Networks and Some Generalizations

Prim, R.


Pr57 Shortest Connection Networks and Some Generalizations

Prim, R.

Bell System Techn. J. , Vol. 36 , pp. 1389 , 1957

Prim Shortest connection networks and some generalizations

Prim, R.

Bell Syst. Techn. J. , Vol. 36 , pp. 1389-1401 , 1957

PAS95 The Multicast Tree Based Routing for The Complete Broadcast Multipoint-to-Multipoint Communications

Priwan, V.; Aida, H. & Saito, T.


prodon1

url



Steiner trees with $n$ terminals among $n+1$ nodes

Prodon, A.


PrSi00 Design and Dimensioning of Dual-Homing Hierarchical Multi-Ring Networks

Proestaki, A. & Sinclair, M.

IEE Proceedings -- Communications , Vol. 147 , pp. 96-104 , 2000

proll1 Integer linear programming and constraint programming approaches to a template design problem

Proll, L. & Smith, B.


pronzato1 Renormalised steepest descent converges to a two-point attractor

Pronzato, L.; Wynn, H.P. & Zhigljavsky, A.A.

1998

provan1 On finding two-connected subgraphs in planar graphs

Provan, J.S.


Provan Convexity and the Steiner tree problem

Provan, J.S.

Networks , Vol. 18 , pp. 55-72 , 1988

ProvanTR A polynomial algorithm for the Steiner tree problem on terminal-planar graphs

url



Provan, J.S.

1983

Provan86 Bounds on the reliability of networks

Provan, J.


Provan84 Computing network reliability in time polynomial in the number of cuts

Provan, J. & Ball, M.


pruesse1 Generating linear extensions fast

Pruesse, G. & Ruskey, F.


DeP95 Asynchronous transfer mode solution for broadband ISDN

Prycker, M.D.


DePrycker95 Asynchronous Transfer Mode Networks, Solution for Broadband ISDN

Prycker, M.D.


P02 On optimization in Design of Telecommunications Networks with Multicast and Unicast Traffic

M. Prytz

Dept. of Mathematics, Royal Institute of Technology , 2002

url



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


2002

Prytz:Forsgren Dimensioning multicast-enabled communications networks


Networks , Vol. 39 , pp. 216-231 , 2002

prytz1 Dimensioning Multicast-Enabled Communications Networks


2001

ProemelSteger00 A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3

Prömel, H. & Steger, A.


Psh78 Numerical methods in extremal problems

Pshenichny, B. & Danilin, Y.

Mir Publishers , 1978

Puech:Kuri:Gagnaire Topological design and lightpath routing in WDM mesh networks: a combined approach

url



Puech, N.; Kuri, J. & Gagnaire, M.


pujo92 Télécommunications et Réseaux

Pujolle, G.

Eyrolles , 1992

pe89 New lower bounds for constant weight codes

van Pul, C.L.M. & Etzion, T.


pullan1 A study of general dynamic network programs with arc time-delays

Pullan, M.


Py2 Polyhedral Combinatorics

Pulleyblank, W.R.

pp. 371-446 , 1989

Py Polyhedral Combinatorics

Pulleyblank, W.R.

pp. 312-345 , 1982

pulleyblank3 Minimum node covers and 2-bicritical graphs

Pulleyblank, W.R.


PuCo98



The Economics of Local Loop Architecture for Multimedia Services

Pupillo, L. & Conte, A.


puri02 Optimizing traffic flow in fixed wireless networks

Puri, A.

Proceedings of the Wireless Communications and Networking Conference, WCNC 2002 , Vol. 2 , pp. 904-907 , 2002

Puterman94 Markov Decision Processes

Puterman, M.

Wiley, New York , 1994

qi2 A new facet class and a polyhedral method for the three-index assignment problem

Qi, L.; Balas, E. & Gwan, G.

pp. 256-274 , 1994

qi1 Computational nonsmooth optimization

Qi, L.; Ruszczynski, A. & Womersley, R.


03qia The potentials of optical burst switching (OBS)

Qiao, C.; Chen, Y. & Staley, J.


qin03 Effective Routing and Wavelength Assignment in a Wavelength-Routed Network



Qin, Y.; Siew, C. & Li, B.


Quandt A Probabilistic Abstract Mode Model

Quandt, R.E.

pp. 127-149 , 1967

QueirozHumes2003 A heuristic for the continuous capacity and flow assignment

Queiroz, M. & Humes~Jr., C.


Ques Tableau Economique

Quesnay, F.

1758

queyranne1 On the convex hull of feasible solutions to certain combinatorial problems

Queyranne, M. & Wang, Y.


rfc3170 IP Multicast Applications: Challenges and Solutions

Quinn, B. & Almeroth, K.

2001

quist2 Finding optimal nuclear reactor core reload patterns using nonlinear optimization and search heuristics

Quist, A.J.; van Gemeert, R.; Hoogenboom, J.E.; Ílles, T.; de Klerk, E.; Roos, C. & Terlaky, T.

1998

url

url



quist3 Application of nonlinear optimization to reactor core fuel reloading

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

Quist, A.J.; de Klerk, E.; Roos, C. & Terlaky, T.


quoitin:03 Interdomain traffic engineering with BGP

Quoitin, B.; Uhlig, S.; Pelsser, C.; Swinnen, L. & Bonaventure, O.


RioBar99 An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup costs

Ros-Mercado, R. & Bard, J.


RioBar98a Heuristics for the flow line problem with setup costs

Ros-Mercado, R. & Bard, J.

European Journal of Operational Research , pp. 76-98 , 1998

Rab96 Path coloring on the mesh

Rabani, Y.

Proceedings of 37th Annual Symposium on Foundations of Computer Science , pp. 400-409 , 1996

Radas98

url

url



Managing Service Demand: Shifting and Bundling

Radas, S. & Shugan, S.

Journal of Service Research , Vol. 1 , pp. 47-64 , 1999

rad97 Fast deterministic approximation for the multicommodity flow problem

Radzik, T.


Ra87 Métodos de Solucão para o Problema de Localizacão Não Capacitado

L.A. Raggi

COPPE/UFRJ , 1987

RagTho87 Randomized Rounding: a technique for provably good algorithms and algorithmic proofs

Raghavan, P. & Thompson, C.


raghw94 Efficient Routing In All-Optical Networks

Raghavan, P. & Upfal, E.

Proc. of the 26th STOC, ACM May 1994 , pp. 134-143 , 1994

raghavan1 Network connectivity

Raghavan, S. & Magnanti, T.L.

pp. 335-354 , 1997

Rai78 An efficient method for reliability evaluation of a general network

Rai, S. & Aggarwal, K.




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.


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

Ralph, D. & Wright, S.J.

2003

ralph1 Superlinear convergence of an interior-point method despite dependent constraints

Ralph, D. & Wright, S.J.


ralphs1

url



On the capacitated vehicle routing problem

Ralphs, T.K.; Kopman, L.; Pulleyblank, W.R. & Trotter, L.E.


Ralphs2003 Decomposition and dynamic cut generation in integer linear programming

Ralphs, T. & Galati, M.

2003

kamath3 An Approximate Dual Projective Algorithm for Solving Assignment Problems

Ramakrishnan, K.G.; Karmarkar, N.K. & Kamath, A.P.

pp. 299-348 , 1993

ramakrishnan1 A branch and bound algorithm for the quadratic assignment problem using a lower bound based on linear programming

Ramakrishnan, K.G.; Resende, M.G.C. & Pardalos, P.M.

State of the Art in Global Optimization: Computational Methods and Applications , 1995

ramakrishnan2 Tight QAP bounds via linear programming

Ramakrishnan, K.G.; Resende, M.G.C.; Ramachandran, B. & Pekny, J.F.

1996

RR94 Optimal Routing in Shortest-Path Data Networks

Ramakrishnan, K. & Rodrigues, M.A.

Bell Labs Technical Journal , Vol. 6 , 2001

Ramakrishnan99 Data mining: From serendipity to science

url

url



Ramakrishnan, N. & Grama, A.Y.

Computer , Vol. 32 , pp. 34-37 , 1999

RamIneMuk98 Optimal Amplifier Placements in a Multiwavelength Optical LAN/MAN: The Unequally Powered Wavelength Case

Ramamurthy, B.; Iness, J. & Mukherjee, B.


ramana2 An exact duality theory for semidefinite programming and its complexity implications

Ramana, M.


ramana3 Some geometric results in semidefinite programming

Ramana, M. & Goldman, A.J.


ramana1 Strong duality for semidefinite programming

Ramana, M.; Tunçel, L. & Wolkowicz, H.


Ramanathan99 A unified framework and algorithm for channel assignment in wireless networks

Ramanathan, S.


R96 Multicast tree generation in networks with asymmetric links

Ramanathan, S.

url

doi




Ramanathan93 Scheduling algorithms for multihop radio networks

Ramanathan, S.


ramasw93 Multiwavelength Lightwave Network for Computer Communications

Ramaswami, R.


Ramaswami89 Distributed scheduling of broadcasts in a radio network

Ramaswami, R. & Parhi, K.K.

Proceedings of the INFOCOM , 1989

ram96 Design Of Logical Topologies for Wavelength-Routed Optical Networks

Ramaswami, R. & Sivarajan, K.


ramaswami02 Optical Networks: A Practical Perspective

Ramaswami, R. & Sivarajan, K.N.


RamaswamiSivarajan2002 Optical networks: A practical perspective

Ramaswami, R. & Sivarajan, K.N.


ram02 Optical Networks - A Practical Perspective





Ramaswami:Sivarajan Design of logical topologies for wavelength-routed optical networks



ram95 Routing and Wavelength Assignment in All-Optical Networks



srini.thesis Cutting plane algorithms for linear and convex programming

S. Ramaswamy


Ramaswamy98 On the discovery of interesting patterns in association rules

Ramaswamy, S.; Mahajan, S. & Silberschatz, A.

Proceedings of 24th Intl. Conf. on Very Large Databases (VLDB'98) , pp. 368-379 , 1998

srini4 Using selective orthonormalization to update the analytic center after the addition of multiple cuts

Ramaswamy, S. & Mitchell, J.E.

1998

srini3 A long step cutting plane algorithm that uses the volumetric barrier


1995



srini2 On updating the analytic center after the addition of multiple cuts


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.


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.


RaLu01b Solving Local Access Network Design Problems with Two Technologies


Investigación Operacional , Vol. 21 , pp. 115-123 , 2001

RandazzoLuna01 A Comparison of Optimal Methods for Local Access Uncapacitated Network Design





00ber Architectural implications of core grooming in a 46-node USA optical network

Ranganathan, R.; Blair, L. & Berthold, J.


01bla Benefits of grooming capable cross-connects in a Pan-European Optical Network

Ranganathan, R.; Blair, L. & Berthold, J.

ECOC '01 , Vol. 1 , pp. 38 - 39 , 2001

RanAbrBoa00a GRASP in the QAP: An acceptation bound for

initial solutions

Rangel, M.; Abreu, N. & Netto, P.B.


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

pdf url



Rao, S.K.; Sadayappan, P.; Hwang, F.K. & Shor, P.W.


rc Asymmetric error codes for some LSI semiconductor memories

Rao, T.R.N. & Chawla, A.S.

Proceedings of the Seventh Annual Southeastern Symposium of System Theory , pp. 170-171 , 1975

RaoSridharan02 Minimum-Weight Rooted Not-Necessarily-Spanning Arborescence Problem

Rao, V. & Sridharan, R.

Networks , Vol. 39 , pp. 77-87 , 2002

Ra82 Tight relaxations of fixed charge network flow problems

Rardin, R.

1982

RaCh79 Tighter relaxations of fixed charge network flow problems

Rardin, R. & Choe, U.

1979

rarwol93 Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems

Rardin, R. & Wolsey, L.

European J. Operational Res. , Vol. 71 , pp. 95-109 , 1993

RaWo93 Valid Inequalities and Projecting the Multicommodity Extended Formulation for Uncapacitated Fixed Charge Network Flow Problems

Rardin, R. & Wolsey, L.




RLT97 Downlink power control and base station assignment

Rashid-Farrokhi, F.; Liu, K. & Tassiulas, L.

IEEE Commun. Lett. , Vol. 1 , pp. 102-104 , 1997

Raskina02 Two large-scale network design problems

O. Raskina

Columbia University , 2002

raupp2 A Center Cutting Plane Algorithm for a Likelihood Estimate Problem

Raupp, F.M.P. & Gonzaga, C.C.

2000

raupp1 An analytic center cutting plane algorithm for finding equilibrium points

Raupp, F.M.P. & Sosa, W.

2000

RavadaSherman Experimental evaluation of a partitioning algorithm for the Steiner tree problem in $R^2$ and $R^3$

Ravada, S. & Sherman, A.T.

Networks , Vol. 24 , pp. 409-415 , 1994

Ravietal01 Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems

Ravi, R.; Marathe, M.; Ravi, S.; Rosenkrantz, D. & III, H.H.


url

url



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.


Ra94 Further results on t-coloring and frequency assignment problems

Raychaudhuri, A.


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

Recht, P.

Mathematical Methods of OR , Vol. 54 , pp. 53-61 , 2001

00red

url



Virtual networks in the Internet

Redlich, J.; Suzuki, M. & Weinstein, S.

OPENARCH '99 , pp. 108 - 114 , 1999

Ree03 Genetic algorithms

Reeves, C.

pp. 65-82 , 2003

reeves1 Genetic algorithms for the operations researcher

Reeves, C.


Re93 Modern Heuristic Techniques for Combinatorial Problems

Reeves, C.

Blackwell , 1993

Ree93a Genetic algorithms

Reeves, C.

pp. 151-196 , 1993

ReeYam98 Genetic algorithms, path relinking and the flowshop sequencing problem

Reeves, C. & Yamada, T.


SRV96 A Distributed Algorithm for Delay-Constrained Unicast Routing

Reeves, D. & Salama, H.




REGNIER State-Dependent Dynamic Traffic Management for Telephone Networks

Regnier, J. & Cameron, W.H.


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.


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.


Rei1 The Linear Ordering Problem: Algorithms and Applications

Reinelt, G.

Heldermann , 1985



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.


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.


ren1 Improving the optimization and numerics in Laue diffraction analysis

Ren, Z.; Sheng, R. & Wright, S.J.


rendl2 Semidefinite programming and combinatorial optimization



Rendl, F.


rendl1 A semidefinite framework for trust region subproblems with applications to large scale minimization

Rendl, F. & Wolkowicz, H.


renegar6 Hyperbolic Programs, and Their Derivative Relaxations

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.


renegar2 Incorporating condition measures into the complexity theory of linear programming

Renegar, J.


renegar3 Linear programming, complexity theory and elementary functional analysis

Renegar, J.

url




Ren A polynomial-time algorithm based on Newton's method for linear programming

Renegar, J.


Resende88 Implementation of a factoring algorithm for reliability evaluation of undirected networks

Resende, L.


ResRes99a A GRASP for frame relay PVC routing

Resende, L. & Resende, M.

Proc. of the Third Metaheuristics International

Conference

, pp. 397-402 , 1999

ResRes97a A GRASP for frame relay PVC routing

Resende, L. & Resende, M.

1997

Res Personal Communication

Resende, M.G.C.

2000

resende7 A GRASP for satisfiability

Resende, M.G.C. & Feo, T.A.



Vol. 26 , pp. 499-520 , 1996

resende3 Interior Point Algorithms for Network Flow Problems

Resende, M.G.C. & Pardalos, P.M.

pp. 145-185 , 1996

resende9 Greedy radomized adaptive search procedures

Resende, M.G.C. & Ribeiro, C.C.

pp. 219-249 , 2002

resende8 A GRASP with path-relinking for private virtual circuit routing

Resende, M.G.C. & Ribeiro, C.C.

2001

ResTsuVei94 Identifying the optimal face of a network linear program with a globally convergent interior point method

Resende, M.G.C.; Tsuchiya, T. & Veiga, G.

pp. 362-387 , 1994

ResTsuVei93 Identifying the optimal face of a network linear program with a globally convergent interior point method

Resende, M.G.C.; Tsuchiya, T. & Veiga, G.

pp. 196-206 , 1993

resende10 An annotated bibliography of network interior point methods

Resende, M.G.C. & Veiga, G.

Networks , Vol. 42 , pp. 114-121 , 2003

ResVg

url

url

url

url

url

url



An implementation of the dual affine scaling algorithm for minimum cost flow on bipartite uncapacitated networks



ResVg2 An efficient implementation of a network interior point method


pp. 299-348 , 1993

RW03a On the implementation of a swap-based local search procedure for the $p$-median problem

Resende, M.G.C. & Werneck, R.F.

Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments (ALENEX'03) , pp. 119-127 , 2003

Res03 Combinatorial Optimization in Telecommunications

Resende, M.

pp. 59-112 , 2003

Res01b Greedy randomized adaptive search procedures (GRASP)

Resende, M.

Vol. 2 , pp. 373-382 , 2001

Res98 Computing approximate solutions of the maximum covering problem with GRASP

Resende, M.


Res98a Computing approximate solutions of the maximum covering problem



using GRASP

Resende, M.


Res98b Greedy randomized adaptive search procedures (GRASP)

Resende, M.

1998

Resende86 A program for reliability evaluation of undirected networks via polygon-to-chain reductions

Resende, M.


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

solution of

dense quadratic assignment problems using GRASP

Resende, M.; Pardalos, P. & Li, Y.


pdf url



ResPitPar00a Fortran subroutines for computing approximate solutions of MAX-SAT problems using GRASP

Resende, M.; Pitsoulis, L. & Pardalos, P.


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

Resende, M.; Ramakrishnan, K. & Drezner, Z.


ResRib05 GRASP with path-relinking: Recent advances and applications

Resende, M. & Ribeiro, C.

2005

ResRib03 Greedy randomized adaptive search procedures


2003

ResRib03b GRASP and path-relinking: Recent advances and applications


Proceedings of the Fifth Metaheuristics International Conference , pp. T6-1 - T6-6 , 2003

url



ResRib03c A GRASP with path-relinking for private virtual circuit routing


Networks , Vol. 41 , pp. 104-114 , 2003

ResRib97a A GRASP for graph planarization


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.


ResWer03c A hybrid multistart heuristic for the uncapacitated facility location problem


2003

ResWer02a A GRASP with path-relinking for the p-median problem


2002

rexford:02 BGP Routing Stability of Popular Destinations



Rexford, J.; Wang, J.; Xiao, Z. & Zhang, Y.

Proc. Internet Measurement Workshop , 2002

BellSystem (ed.) Engineering and Operations in the

Bell System -- 2nd Edition

Rey, R.F.

AT&T Bell Laboratories , 1983

ReyDicRobWesIglBoeRay03a Algorithms for identification key generation and optimization with application to yeast identification

Reynolds, A.; Dicks, J.; Roberts, I.; Wesselink, J.; de la Iglesia, B.; Robert, V.; Boekhout, T. & Rayward-Smith, V.

Vol. 2611 , pp. 107-118 , 2003

Ribeiro92 A parallel optimal routing algorithm

Ribeiro, C. & Elbaz, D.


Ribeiroelbaz92 A dual method for optimal routing in packet-switched networks

Ribeiro, C. & Elbaz, D.


Rib02 GRASP: Une métaheuristique gloutone et probabiliste

Ribeiro, C.

pp. 153-176 , 2002

Ribeiro:Minoux:Penna Optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment



Ribeiro, C.; Minoux, M. & Penna, M.


RibRes99a Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP

Ribeiro, C. & Resende, M.


RibRos03 A GRASP with path-relinking heuristic for the 2-path network design problem

Ribeiro, C. & Rosseti, I.

2004, in preparation

RibRos02 A parallel GRASP heuristic for the 2-path network design problem



RibRos02a A parallel GRASP for the 2-path network design problem



RibSou01 Variable neighborhood search for the degree constrained minimum spanning tree problem

Ribeiro, C. & Souza, M.


RibSou00 Tabu search for the Steiner problem in graphs

Ribeiro, C. & Souza, M.



Networks , Vol. 36 , pp. 138-146 , 2000

RibeiroEtAl01 A Hybrid GRASP With Perturbations for the Steiner Problem in Graphs

Ribeiro, C.; Uchoa, E. & Werneck, R.


RibUchWer02a A hybrid GRASP with perturbations

for the Steiner problem in graphs

Ribeiro, C.; Uchoa, E. & Werneck, R.


RibVia03 A genetic algorithm for the phylogeny problem using an optimized crossover strategy based on path-relinking

Ribeiro, C. & Vianna, D.

Revista Tecnologia da Informação , Vol. 3 , pp. 67-70 , 2003

RibVia03a A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure

Ribeiro, C. & Vianna, D.

2003

RibeiroSouza00 Tabu Search for the Steiner Problem in Graphs

Ribeiro, C. & Souza, M.D.

Networks , Vol. 36 , pp. 138-146 , 2000

Richards On the effectiveness of greedy heuristics for the rectilinear Steiner problem

Richards, D.S.

pdf url



1991

RichardsSalowe A linear-time algorithm to construct a rectilinear Steiner minimal tree for $k$-extremal point sets

Richards, D.S. & Salowe, J.S.


RichardsSaloweFulltree A simple proof of Hwang's theorem for rectilinear Steiner minimal trees

Richards, D.S. & Salowe, J.S.


Ric89 Fast heuristic algorithms for rectilinear Steiner trees

Richards, D.


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. 1754-1758 , 2003

rieger1



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.; Jünger, 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.


Riis:Lodahl A bicriteria stochastic programming model for capacity expansion in telecommunications

Riis, M. & Lodahl, J.


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.


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

url



Evaluation of parallel implementations of heuristics

for the course scheduling problem

Rivera, L.I.D.

Instituto Tecnologico y de Estudios Superiores de

Monterrey

, 1998

Rizzi03 On Rajagopalan and Vazirani’s 3/2-approximation bound for the Iterated 1-Steiner heuristic

Rizzi, R.


Rizzi A short proof of matching theorem

Rizzi, R.

J. Graph Theory , Vol. 33 , pp. 138-139 , 2000

Ro91 $t$-colorings of graphs: Recent results and open problems

Roberts, F.


Rob01a A set of greedy randomized adaptive local search procedure

(GRASP) implementations for the multidimensional

assignment problem

Robertson, A.


Rob98a A set of greedy randomized adaptive local search procedure (GRASP)

pdf url



implementations for the multidimensional assignment problem

Robertson, A.

1998

Robertson97 The four-color theorem

Robertson, N.; Sanders, D.; Seymour, P. & Thomas, R.

Journal of Combinatorial Theory , Vol. 70 , pp. 2-44 , 1997

RobinsSalowe On the maximum degree of minimum spanning trees

Robins, G. & Salowe, J.S.

Proceedings of the ACM Symposium on Computational Geometry , pp. 250-258 , 1994

RobinsZelikovsky Improved Steiner tree approximation in graphs

Robins, G. & Zelikovsky, A.

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms , pp. 770-779 , 2000

robinson1_opt Baseball playoff eliminations: An application of linear programming

Robinson, L.W.


srobinson1 Variational conditions with smooth constraints: structure and analysis

Robinson, S.M.


Robson86 Algorithms for maximum independent sets

Robson, J.M.




rochat1 Probabilistic diversification and intensification in local search for vehicle routing

Rochat, Y. & Taillard, E.


rockafellar2 Duality and optimality in multistage stochastic programming

Rockafellar, R.T.


roc70 Convex Analysis

Rockafellar, R.T.


rockafellar3 Scenarios and Policy Aggregation in Optimization Under Uncertainty

Rockafellar, R.T. & Wets, R.J.


Ro93 Sistemas Integrados de Configuracão de Rede Telefônica

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



Rojanasoonthon, S.; Bard, J. & Reddy, S.


RolMil02a MAGMA: A multiagent architecture for Metaheuristics

Roli, A. & Milano, M.

2002

RomMor01a Generating experimental data for the Generalized Assignment Problem

Romeijn, H. & Morales, D.


roos5 Note on a paper of Broyden

Roos, C. & Terlaky, T.


roos3 Theory and Algorithms for Linear Optimization: An Interior Point Approach

Roos, C.; Terlaky, T. & Vial, J.

John Wiley , 1997

RoosVial68 A polynomial method of approximate centers for linear programming

Roos, C. & Vial, J.P.


RoosVial2 Long steps in the logarithmic penalty barrier function in linear programming

Roos, C. & Vial, J.P.

pp. 433-441 , 1989

url



rosas1 Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem

Rosas, D.; Castro, J. & Montero, L.

2002

mpls01 Multiprotocol Label Switching Architecture

Rosen, E.; Viswanasan, A. & Callon, R.

2001

MPLS Multiprotocol Label Switching Architecture

Rosen, E.; Viswanathan, A. & Callon, R.

RFC 3031 , 2001

rosen2 The gradient projection method for nonlinear programming. Part II. Nonlinear constraints

Rosen, J.B.


rosen1 The gradient projection method for nonlinear programming. Part I. Linear constraints

Rosen, J.B.


Ro83 Global Minimization of a Linearly Constrained Concave Function by Partition of Feasible Domain

Rosen, J.

Mathematical of the Operational Research , Vol. 8 , pp. 215-230 , 1983

url



Ro60 The gradient projection method for nonlinear programming. Part I: Linear constraints

Rosen, J.


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.


Rosenberg2001 Dual ascent for uncapacitated telecommunications network design with access, backbone and switch Costs

Rosenberg, E.


Ro87 A Nonlinear Programming Heuristic for Computing Optimal Link Capacities in a Multi-hour Alternate Routing Communications Network

Rosenberg, E.


Rosenkrantz:Stearns:Lewis An Analysis of Several Heuristics for the Traveling Salesman Problem

Rosenkrantz, D.; Stearns, R. & Lewis, P.




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.


Rosenwein:Wong A constrained Steiner tree problem

Rosenwein, M. & Wong, R.


Ross:Soland A Branch and Bound Algorithm for the Generalized Assignment Problem

Ross, G. & Soland, R.


Ross83 Introduction to Stochastic Dynamic Programming

Ross, S.


Ros03a Heursticas para o problema de sntese de redes

a 2-caminhos

I. Rosseti


Rio de Janeiro

, 2003



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.


rossi1 A branch-and-cut algorithm for the maximum cardinality stable set problem

Rossi, F. & Smriglio, S.


rothberg1 Sparse Matrix Ordering Methods for Interior Point Linear Programming

Rothberg, E. & Hendrickson, B.


RothfarbGoldstein1971 The one-terminal TELPAK problem

Rothfarb, B. & Goldstein, M.


Rothkopf-etal-1998 Computationally manageable combinational auctions

Rothkopf, M.H.; Pekec, A. & Harstad, R.


Rough Selfish Routing

url



T. Roughgarden

Department of Computer Science, Cornell University , 2002

Rough02a How bad is selfish routing?

Roughgarden, T. & Tardos, E.


RoughTar How Bad is Selfish Routing?

Roughgarden, T. & Tardos, E.


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 Multi-Objective Genetic Algorithm

Roy, A. & Das, S.


Va86 A Cross Decomposition Algorithm for the Capacitated Facility Location

Roy, T.V.


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



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.


Rump98 Stability and Chaos in Input Pricing for a Service Facility with Adaptive Customer Response to Congestion

Rump, C.M. & Stidham, S.


bobrush.thesis Decision-constrained stochastic programming for asset-liability management

R. Rush


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

Rush, R.; Mulvey, J.M.; Mitchell, J.E. & Willemain, T.R.

Journal of Applied Mathematics and Decision Sciences , Vol. 4(1) , pp. 17-38 , 2000

Rushmeier1 Experiments with parallel branch-and-bound algorithms for the set

url



covering problem

Rushmeier, R.A. & Nemhauser, G.L.


russell1 Hybrid heuristics for the vehicle routing problem with time windows

Russell, R.A.


rustem1 Robust portfolio analysis

Rustem, B. & Settergren, R.

Vol. 74 , 2002

ruszczynski1b Frontiers of stochastically nondominated portfolios

Ruszczyski, A. & Vanderbei, R.J.

2002

ruszczynski1a Some advances in decomposition methods for stochastic linear programming

Ruszczynski, A.


Rutten98 Polyhedral Clustering

Jeroen Rutten

Maastricht University , 1998

Roc80 Scaling techniques for minimal cost network flows

Röck, H.

pp. 181-191 , 1980

url

url



SS Extremal of functions on graphs with applications to graphs and hypergraphs

Sós, 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.


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



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.


sahinidis2 Applications of Global Optimization to Process and Molecular Design

Sahinidis, N.V. & Tawarmalani, M.


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.


saigal4



Linear Programming: A Modern Integrated Analysis

Saigal, R.


saigal1 Efficient variants of the affine scaling method

Saigal, R.

1993

saigal3 An infeasible start predictor corrector method for semi-definite linear programming

Saigal, R. & Lin, C.

1995

sak66 The multicommodity maximum flow problem

Sakarovitch, M.

1966

Saksena1989 Topological analysis of packet networks

Saksena, V.


SRV97 The Delay-Constrained Minimum Spanning Tree Problem

Salama, H.; Reeves, D. & Viniotis, Y.

2nd IEEE Symposium on Computers and Communications (ISCC'97) , pp. 699-704 , 1997

SRV97a Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks

url




IEEE Journal on Selected Areas In Communications , Vol. 15 , pp. 332-345 , 1997

SRV96a Shared Multicast Trees and the Center Selection Problem: A Survey


1996

salazargonzalez2 Mathematical models for applying cell suppression methodology in statistical data protection

Salazar-González, J.J.


salazargonzalez1 The Steiner cycle polytope

Salazar-González, J.J.


Salazar2003 The Steiner cycle polytope

Salazar-González, J.

European J. Oper. Res , pp. 671-679 , 2003

Salcedo03 Mixed neural-genetic algorithm for the broadcast scheduling problem

Salcedo-Sanz, S.; Busoño-Calzón, C. & Figueiral-Vidal, A.R.


Salowe On exact algorithms for rectilinear Steiner minimal trees

Salowe, J.S.

1992



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.


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.




sanchez1 Recovery of the Analytic Center in Perturbed Quadratic Regions and Applications

Sanchez, A.; Oliveira, P.R. & Santos, M.A.d.

1999

Sandholm02:Algorithm Algorithms for optimal winner determination in combinatorial auctions

Sandholm, T.

Artificial Intelligence , Vol. 135 , pp. 1-54 , 2002

Sandholm02:Winner Winner determination in combinatorial auction generalizations

Sandholm, T.; S. Suri, A.G. & Levine, D.

in Proc. International Conference on Autonomous Agents and Multi-Agent Systems , pp. 69-76 , 2001

Saniee-BL-report A Distributed Scheme for Implementation of Shared Protection in Optical Meshes

Saniee, I.

2000

Sanso92 An algorithm for network dimensioning under reliability considerations

Sanso, B.; Gendreau, M. & Soumis, F.


Sanso94 Performance models for reliable network design

Sanso, B.; Girard, A. & Dang, V.

Proceedings of the Sixth International Network Planning Symposium. Planning for a Customer Responsive Network , pp. 119-23 , 1994

url



Sanso91a Communication and transportation network reliability using routing models

Sanso, B. & Soumis, F.


Sanso91 On the evaluation of telecommunications network reliability using routing models

Sanso, B.; Soumis, F. & Gendreau, M.


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.


tseng27 Generalized Basis Pursuit

Sardy, S.; Antoniadis, A. & Tseng, P.

2000

sardy2 Block coordinate relaxation methods for nonparametric signal denoising with wavelet dictionaries

Sardy, S.; Bruce, A. & Tseng, P.

1998

SarrafzadehWongBook

url

url



An Introduction to VLSI Physical Design

Sarrafzadeh, M. & Wong, C.K.

McGraw-Hill , 1996

SarrafzadehWong Bottleneck Steiner trees in the plane



SW90 Hierarchical Steiner tree construction in uniform orientations



SW91b New directions in the rectilinear Steiner tree problem


1991

Sassano1 On the facial structure of the set covering polytope

Sassano, A.


sassano89 On the facial structure of the set covering polytope

Sassano, A.


Satyanarayana82 A unified formula for analysis of some network reliability problems

Satyanarayana, A.




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.


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.


savelsbergh2 A branch-and-price algorithm for the generalized assignment problem

Savelsbergh, M.W.P.


saveslbergh1



Preprocessing and probing for mixed integer programming problems

Savelsbergh, M.W.P.


MINTOmanual Functional description of MINTO, a Mixed INTeger Optimizer, Version 2.3

Savelsbergh, M.W.P. & Nemhauser, G.L.

1996

MINTO2 A MINTO short course

Savelsbergh, M.W.P. & Nemhauser, G.L.

1995

MINTOold MINTO: a Mixed INTeger Optimizer

Savelsbergh, M.W.P.; Sigismondi, G.C. & Nemhauser, G.L.

1991

saveslbergh3 DRIVE: dynamic routing of independent vehicles

Savelsbergh, M.W.P. & Sol, M.


Saxena03 Polyhedral studies in domination graph theory (I)

Saxena, A.

2003

Scarf82 The Computation of Equilibrium Prices: An Exposition

Scarf, H.E.

Vol. 2 , pp. 1007-1061 , 1982



schaible1 Fractional programming

Schaible, S.

pp. 495-608 , 1994

schaible2 A note on ``Quadratic fractional functionals programming'' by S. P. Aggarwal

Schaible, S.


schattman1 The investor's reallocation problem under nonconvex transaction costs and capital gains taxes

Schattman, J.

1999

scheel1 Mathematical programs with complementarity constraints: stationarity, optimality, and sensitivity

Scheel, H. & Scholtes, S.


sw Optimal and near-optimal broadcasting in random graphs

Scheinerman, E. & Wierman, J.


sch66 On Caratheodory's Theorem

Scherk, P.

Canadian Mathematical Bulletin , Vol. 9(4) , pp. 463-465 , 1966

SchFis03

url



Holonic Multiagent Systems

Schillo, M. & Fisher, K.

Kunstliche Intelligenz , Vol. 4/03 , pp. 54-55 , 2003

schittkowski1 PDEFIT: A FORTRAN code for parameter estimation in partial differential equations

Schittkowski, K.


schmieta2 Complete Classification of Self-scaled Barrier Functions

Schmieta, S.

2000

schmieta4 Extension of primal-dual interior point algorithms to symmetric cones

Schmieta, S. & Alizadeh, F.


schmieta3 Associative and Jordan Algebras, and Polynomial Time Interior Point Algorithms for Symmetric Cones



alizadeh6 Associative Algebras, Symmetric Cones and Polynomial Time Interior Point Algorithms


1998

schmieta1 Associative Algebras, Symmetric Cones and Polynomial Time Interior Point Algorithms

url

url

url




1998

Schnei Access and Land Development

Schneider, M.

Vol. 97 , pp. 164-177 , 1968

schneur1 A scaling algorithm for multicommodity flow problems

Schneur, R.R. & Orlin, J.B.


36sch Convergence between public switching and the Internet

Schoen, U.; Hamann, J.; Ugel, A.; Kurzawa, H. & Schmidt, C.


scholtes3 Combinatorial Structures in Nonlinear Programming

Scholtes, S.


scholtes2 Convergence Properties of a Regularisation Scheme for Mathematical Programs with Complementarity Constraints

Scholtes, S.


scholtes4 Active set methods for inverse linear complementarity problems

Scholtes, S.

1999

url

url

url



scholtes1 How stringent is the linear independence assumption for mathematical programs with complementarity constraints?

Scholtes, S. & Stöhr, M.


schramm1 A version of the bundle idea for minimizing a nonsmooth function: Conceptual idea, convergence analysis, numerical results

Schramm, H. & Zowe, J.


Schrijver03 Combinatorial Optimization: Polyhedra and Efficiency

Schrijver, A.

Springer , 2003

schrijver4 On the history of the transportation and maximum flow problems

Schrijver, A.


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



Schrijver, A.


schrijver3 The ring loading problem

Schrijver, A.; Seymour, P. & Winkler, P.


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.


schultz4 Stochastic programming with integer variables

Schultz, R.


schultz2 Rates of convergence in stochastic programs with integer recourse

Schultz, R.


schultz1 On structure and stability in stochastic programs with random technology matrix and complete integer recourse

Schultz, R.




schultz3 Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions

Schultz, R.; Stougie, L. & van der Vlerk, M.H.


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

Schurr, S.P.; Tits, A. & O'Leary, D.P.

2004

schwartz87 Telecommunication Networks: Protocols, Modeling and Analysis

Schwartz, M.


Sch77

url



Computer-communication network design and analysis

Schwartz, M.


Sch76 The gradient projection algorithm for multiple routing in message-switched networks

Schwartz, M. & Cheung, C.


schweitzer2 An Interior Random Vector Algorithm for MultiStage stochastic linear programs

Schweitzer, E.


schweitzer1 A Gaussian upper bound for Gaussian multistage stochastic linear programs

Schweitzer, E. & Avriel, M.


Schweizer04 E-learning in business

Schweizer, H.

Journal of Management Education , Vol. 28 , pp. 674-692 , 2004

Scupola02 Adoption issues of business to business Internet commerce in European SMEs

Scupola, A.

Proceedings of 35th Hawaii International Conference on System Sciences , 2002

sefl Analysis of Algorithms



Sedgewick, R. & Flajolet, P.


Segev87 The node-weighted Steiner tree problem

Segev, A.

Networks , Vol. 17 , pp. 1-17 , 1987

Sei83 Principles of computer communication network design

Seidler, J.

Ellis Horwood Ltd , 1983

seifi1 A Constant-Potential Infeasible-Start Interior-Point Algorithm with Computational Experiments and Applications

Seifi, A. & Tunçel, L.


Selim84 K-means-type algorithms: A generalized convergence theorem and characterization of local optimizality

Selim, S.Z. & Ismail, M.A.

IEEE Transactions on Pattern Analysis and Machine Intelligence , Vol. PAMI-6 , pp. 81-87 , 1984

Selkow94 A Probabilistic lower bound on the independence number of graphs

Selkow, S.M.


SelKauCoh94 Noise strategies for improving local search

Selman, B.; Kautz, H. & Cohen, B.

Proceedings of the Twelfth National Conference on Artificial Intelligence , pp. 337-343 ,

url



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.


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



SenHuson97 A New Model for Scheduling Packet Radio Networks

Sen, A. & Huson, M.L.


sen3 Algorithms for stochastic mixed-integer programming models

Sen, S.

2003

sen2 Network planning with random demand

Sen, S.; Doverspike, R.D. & Cosares, S.


sen1 An introductory tutorial on stochastic linear programming models

Sen, S. & Higle, J.L.


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:

Formulations and heuristics

Serra, D. & Colomé, R.

Papers in Regional Science , Vol. 80 , pp. 439-464 , 2001

Se81

url

pdf url



Convergence of decomposition algorithm for traffic assignment problem

Serra, P. & Weintraub, W.


Servit81 Heuristic algorithms for rectilinear Steiner trees

Servit, M.

Digital Processes , Vol. 7 , pp. 21-32 , 1981

seshadri1 A method for strategic asset-liability management with an application to the Federal Home Loan Bank of New York

Seshadri, S.; Khanna, A.; Harche, F. & Wyle, R.


sewell2 A branch and bound algorithm for the stability number of a sparse graph

Sewell, E.C.


sewell1 Binary integer programs with two variables per inequality

Sewell, E.C.


shah1 An ellipsoid algorithm for equality constrained nonlinear programming problems

Shah, S.; Mitchell, J.E. & Kupferschmid, M.


sham90 The maximum concurrent flow problem

Shahrokhi, F. & Matula, D.W.




shaikh:02 An OSPF Topology Server: Design and Evaluation

Shaikh, A.; Goyal, M.; Greenberg, A.; Rajan, R. & Ramakrishnan, K.K.

2002

SS97 Destination-Driven Routing for Low-Cost Multicast

Shaikh, A. & Shin, K.


Shaio02 A family of algorithms for network reliability problems

Shaio, J.

ICC 2002 - IEEE International Conference on Communications , Vol. 25 , pp. 2167-2173 , 2002

Srikant05 Economics of Network Pricing with Multiple ISPs

Shakkottai, S. & Srikant, R.


shalit1 Derivation of the mean-gini efficient portfolio frontier

Shalit, H. & Yitzhakt, S.

2002

ShamirSpencer87 Sharp concentration of the chromatic number on random graphs $G_n,p$

Shamir, E. & Spencer, J.


Sha1

url



Computing Karmarkar projections quickly

Shanno, D.F.


ShaB A unified view of interior point methods for linear programming

Shanno, D.F. & Bagchi, A.

1988

shanno3 Interior point methods for nonconvex nonlinear programming: orderings and higher-order methods

Shanno, D.F. & Vanderbei, R.J.


Shao98 Topological optimization of computer network expansion with reliability constraint

Shao, F. & Zhao, L.

Computers & Mathematics with Applications , Vol. 35 , pp. 17-26 , 1998

shapiro4 On duality theory of conic linear programs

Shapiro, A.

expect in 2002

shapiro2 On eigenvalue optimization

Shapiro, A. & Fan, M.K.H.


shapiro3 On the rate of convergence of optimal solutions of Monte Carlo approximations of stochastic programs

url

url



Shapiro, A. & Homem-de-Mello, T.


shapiro5 Conditioning of convex piecewise linear stochastic programs

Shapiro, A.; Homem-de-Mello, T. & Kim, J.


shapiro6 Duality of linear conic programs

Shapiro, A. & Nemirovski, A.

2003

shapiro1 Convergence analysis of stochastic algorithms

Shapiro, A. & Wardi, Y.


Sh79a Mathematical Programming Structures and Algorithms

Shapiro, J.

John Wiley , 1979

Sh79b A Survey of Lagrangean Techniques for Discrete Optimization

Shapiro, J.


Sha79 Mathematical programming -- Structures and algorithms

Shapiro, J.


Shapiro:79

url



A Survey of Lagrangian Techniques for Discrete Optimization

Shapiro, J.


Shapiro:book Mathematical Programming: Structures and Algorithms

Shapiro, J.


Sha74 A survey of Lagrangean techniques for discrete optimization

Shapiro, J.


Shapiro Generalized Lagrange Multipliers in Integer Programming

Shapiro, J.


Sharifov04 Problems of Synthesis of Connected Networks with Respect to Isomorphic Subgraphs

Sharifov, F.

Cybernetics and Systems Analysis , Vol. 40 , pp. 735-738 , 2004

Sharkey95 Network Models in Economics

Sharkey, W.

pp. 713-765 , 1995

sharma97 Network Design Using EcoNets

Sharma, R.

International Thomson Publishing , 1997



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.


shectman1 A finite algorithm for global minimization of separable concave programs

Shectman, J.P. & Sahinidis, N.V.


Shee00 Modeling the supply-demand interaction in electronic commerce: A bi-level 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.




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.


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



sheng2 A quadratically convergent infeasible-interior-point algorithm for LCP with polynomial complexity

Sheng, R. & Potra, F.A.


sheng3 Nonsymmetric search directions for semidefinite programming

Sheng, R. & Potra, F.A.

1997

sheng1 On a general class of interior-point algorithms for semidefinite programming with polynomial complexity and superlinear convergence

Sheng, R.; Potra, F.A. & Ji, J.

1996

Shenker-etal-1996 Pricing in computer networks: Reshaping the research agenda

Shenker, S.; Clark, D.; Estrin, D. & Herzog, S.

Telecommunications policy , Vol. , pp. 183-201 , 1996

Sh95a Making Greed Work in Networks: A Game-Theoretic Analysis of Switch Service Disciplines

Shenker, S.J.


ShZh01 A cycle augmentation algorithm for minimum cost multicommodity flows on a ring

Shepherd, B. & Zhang, L.


shepherd1

url

url



Optimizing the delivery of radiation therapy to cancer patients

Shepherd, D.M.; Ferris, M.C.; Olivera, G.H. & Mackie, T.R.


sherali14 On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions

Sherali, H.D.


sherali10 A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems

Sherali, H.D. & Adams, W.D.


sherali11 Computational advances using the reformulation-linearization technique (RLT) to solve discrete and continuous nonconvex problems

Sherali, H.D. & Adams, W.D.

Optima , Vol. 49 , pp. 1-6 , 1996

sherali15 A hierarchy of relaxations for mixed-integer zero-one programming problems

Sherali, H.D. & Adams, W.P.


sherali3 A hierarchy of relaxation between the continuous and convex hull representations for zero-one programming problems

Sherali, H.D. & Adams, W.P.


sherali6 Exploiting special structures in constructing a hierarchy of relaxations for



0-1 mixed integer problems

Sherali, H.D.; Adams, W.P. & Driscoll, P.J.


sherali7 A variable target value method for nondifferentiable optimization

Sherali, H.D.; Choi, G. & Tuncbilek, C.H.


sherali17 Enhancing RLT relaxations via a new class of semidefinite cuts

Sherali, H.D. & Fraticelli, B.M.P.


sherali16 Enhanced model formulations for optimal facility layout

Sherali, H.D.; Fraticelli, B.M.P. & Meller, R.D.


sherali4 Tighter representations for set partitioning problems

Sherali, H.D. & Lee, Y.H.


sherali2 A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem

Sherali, H.D.; Ramachandran, S. & Kim, S.


sherali12 Enhanced model representations for an intra-ring synchronous optical network design problem allowing demand splitting

Sherali, H.D.; Smith, J.C. & Lee, Y.




sherali5 New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems

Sherali, H.D. & Tuncbilek, C.H.


sherali8 Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems



sherali1 A reformulation-convexification approach for solving nonconvex quadratic programming problems



sherali9 A global optimization approach for polynomial programming problems using a reformulation-linearization technique



sherali13 Global optimization of nonconvex factorable programming problems

Sherali, H.D. & Wang, H.


Sh91 Capacitated, balanced, sequential location-allocation problems

on chains and trees



Sherali, H.


Sherali:Lee:Park New modeling approaches for the design of local access transport area networks

Sherali, H.; Lee, Y. & Park, T.


ShNo88 A capacitated balanced 2-median problem on a tree network

with a continuum of link demands

Sherali, H. & Nordai, F.


Sherali:Park Discrete equal-capacity p-median problem

Sherali, H. & Park, T.


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.


ShRi91 Unbalanced, capacitated p-median problems on a chain graph



with a continuum of link demands

Sherali, H. & Rizzo, T.

Networks , Vol. 21 , pp. 133-163 , 1991

ShLePa98 New modeling approaches for the design of

local access transport area networks

Sherali, H.; Y.Lee & Park, T.

1998

shi1 An improvement on Karmarkar's algorithm for integer programming

Shi, C.; Vannelli, A. & Vlach, J.


ShFo94 Design of Hierarchical Self-Healing Ring Networks

Shi, J. & Fonseka, J.

Proceedings of IEEE International Conference on Communications 1994 , Vol. 1 , pp. 478-482 , 1994

shida4 On long-step predictor-corrector interior-point algorithm for semidefinite programming with Monteiro-Zhang unified search directions

Shida, M.


shida3 Monotone Semidefinite Complementarity Problems

Shida, M. & Shindoh, S.

1996

shida2

url



Existence and uniqueness of Search Directions in Interior-Point Algorithms for the SDP and the Monotone SDLCP

Shida, M.; Shindoh, S. & Kojima, M.


shida1 Centers of monotone generalized complementarity problems

Shida, M.; Shindoh, S. & Kojima, M.

1995

Shier90 Algorithms for approximating the performance of multimode systems

Shier, D.; Bibelnieks, E.; Jarvis, J. & Lakin, R.

Proceedings IEEE INFOCOM 90. The Conference on Computer Communications. Ninth Annual Joint Conference of the IEEE Computer and Communication Societies. The Multiple Facets of Integration (Cat. No.90CH2826-5) , pp. 741-8 vol.2 , 1990

ShiWit81a Properties of labeling methods for determining shortest

path trees

Shier, D. & Witzgall, C.

Journals of Research of the National Bureau of Standards , Vol. 86 , pp. 317-330 , 1981

Shioura-1998 Minimization of an $m$-convex function

Shioura, A.


shmoys1 Computing near-optimal solutions to combinatorial optimization problems

Shmoys, D.B.

1995

url

url



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.



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.


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.


SilSer02a Locating emergency services with priority rules: The priority queuing covering location problem

Silva, F. & Serra, D.

2002



daSilva2002 Uma heuristica lagrangeana para o problema da árvore capacitada de custo mnimo

Silva, J.B.C.~da

Programa de Engenharia de Sistemas e Computação, 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. 200-212 , 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

Simantiraki, E. & Shanno, D.F.


simantiraki2 An infeasible-interior-point method for solving linear complementarity problems

Simantiraki, E. & Shanno, D.F.

1995

url

url



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.


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.


Singh94 Network reliability evaluation by decomposition

Singh, B. & Ghosh, S.


singhal1 Fixed order branch-and-bound methods for mixed-integer programming: The ZOOM system

Singhal, J.; Marsten, R.E. & Morin, T.L.


SinghalMukherjee03 Algorithms for Provisioning Survivable Multicast Sessions against Link



Failures in Mesh Networks

Singhal, N. & Mukherjee, B.

pp. 361-371 , 2003

Sinha99 Approximating shallow-light spanning trees and group Steiner trees

Sinha, A.

1999

Sinha01 Enhancing Ad hoc Routing with Dynamic Virtual Infrastructure

Sinha, P.; Sivakumar, R. & Bharghavan, V.


SSB01 Enhancing ad hoc routing with dynamic virtual infrastructures

Sinha, P.; Sivakumar, R. & Bharghavan, V.

Proceedings of the Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2001) , pp. 1763-1772 , 2001

SirTakZha02 Optimal Wavelength Converter Placement in Optical Networks by Genetic Algorithm

Siregar, J.; Takagi, H. & Zhang, Y.

IEICE Trans. Commun. , Vol. E85-B , pp. 1075-1082 , 2002

Si95 Configuracão de Redes de Distribuicão em Sistemas de Telecomunicacão

Sirihal, A.B.

DCC/UFMG , 1995

SiuCha02 Effectiveness of Optimal Node Assignments in Wavelength Division Multiplexing Networks With Fixed Regular Virtual Topologies



Siu, F. & Chang, R.


Sivakumar98 The Clade Vertebrata: Spines and Routing in Ad Hoc Networks

Sivakumar, R.; Das, B. & Bharghavan, V.

Proceedings of the IEEE Symposium on Computers and Communications , pp. 599-605 , 1998

sivakumar98spine Spine routing in ad hoc networks

Sivakumar, R.; Das, B. & Bharghavan, V.

Cluster Computing , Vol. 1 , pp. 237-248 , 1998

Sivakumar99 CEDAR: A core-extraction distributed ad hoc routing algorithm

Sivakumar, R.; Sinha, P. & Bharghavan, V.


sivavakeesar02 A Prediction-Based Clustering Algorithm to achieve Quality of Service in Mulithop AD HOC Networks

Sivavakeesar, S. & Pavlou, G.

Proceedings of the London Communications Symposium (LCS), London, UK , pp. 17-20 , 2002

Skjott03 Electronic marketplaces and supply chain relationships

Skjott-Larsen, T.; Kotzab, H. & Grieger, M.


SkoKap01 On Cost Allocation in Steiner Tree Networks

Skorin-Kapov, D.



pp. 353-376 , 2001

SkBe94 An efficient characterization of some allocation solutions associated with capacitated network design problems

Skorin-Kapov, D. & Beltran, H.


SkoLab98 Rearrangeable Multihop Lightwave Networks: Congestion Minimization on Regular Topologies

Skorin-Kapov, J. & Labourdette, J.


skol95 On minimum congestion routing in logically rearrangeable multihop lightwave networks

Skorin-Kapov, J. & Labourdette, J.P.


skol96 On minimal congestion routing in rearrangeable lightwave networks

Skorin-Kapov, J. & Labourdette, J.

Proceedings of the 6th international conference on operational research, KOI'96 , pp. 57-61 , 1996

SkoKos03 The Application of Steiner Trees to Delay Constrained Multicast Routing: A Tabu Search Approach

Skorin-Kapov, N. & Kos, M.

Proc. 7th International Conference on Telecommunications ConTEL , 2003

SlGrMa93 An Algorithm for Survivable Network Design Employing Multiple Self-Healing Rings

Slevinsky, J.; Grover, W. & MacGregor, M.



Proceedings of IEEE GLOBECOM 1993 , pp. 1568-1573 , 1993

sloane Challenge Problems: Independent Sets in Graphs

Sloane, N.

2000

sloane2 On single-deletion-correcting codes

Sloane, N.J.A.

Vol. 10 , pp. 273-291 , 2002

SA85 Routing Algorithm for Interconnected Local Area Networks

Sloman, M. & Andriopoulos, X.


VanSlyke72 Network reliability analysis. I

Slyke, R.V. & Frank, H.

Networks , Vol. 1 , pp. 279-90 , 1972

vanslyke1 $L$-shaped linear programs with applications to optimal control and stochastic linear programs

Slyke, R.V. & Wets, R.


bsmith1 The progressive party problem: integer linear programming and constraint programming compared

Smith, B.M.; Brailsford, S.C.; Hubbard, P.M. & Williams, H.P.

Constraints , Vol. 1 , pp. 119-138 , 1996

01smi

url



SONET bidirectional ring capacity analysis: a pragmatic view

Smith, B. & Yackle, C.

Serving Humanity Through Communications , Vol. 1 , pp. 489 - 493 , 1994

jsmith1 Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network

Smith, J.C.


SmithLeeLiebman An $O(n n)$ heuristic algorithm for the rectilinear Steiner minimal tree problem

Smith, J.M.; Lee, D.T. & Liebman, J.S.

Engineering Optimization , Vol. 4 , pp. 179-192 , 1980

SmithLiebman Steiner trees, Steiner circuits, and the interference problem in building design

Smith, J.M. & Liebman, J.S.


SmithJC Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network

Smith, J.


ksmith1 Static and dynamic channel assignment using neural networks

Smith, K. & Palaniswami, M.


Smith-b Existence, Uniqueness, and Stability of Traffic Equilibria



Smith, M.J.


Smith-a How to find Steiner minimal trees in Euclidean $d$-space

Smith, W.D.


Sny91 Lower bounds for rectilinear Steiner trees in bounded space

Snyder, T.L.


snyder1 A priori bounds on the Euclidean TSP

Snyder, T.L. & Steele, J.M.


sohraby01 Digicat Container: A Mechanism for Heterogeneous Traffic Transport over an All-Optical Network

Sohraby, K. & Fatehi, M.T.


Soi81 Reliability indices for topological design of computer communication networks

Soi, I. & Aggarwal, K.


sokkalingam1 Solving inverse spanning tree problems through network flow techniques

Sokkalingam, P.T.; Ahuja, R.K. & Orlin, J.B.




So74 Optimal Facility Location with Concave Costs

Soland, R.


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 réseaux à intégration 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 `ànalytic 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



Minimization of a large-scale quadratic function subject to a spherical constraint

Sorensen, D.C.


SorianoGendreau96 Tabu search algorithms for the maximum clique problem

Soriano, P. & Gendreau, M.

Vol. 26 , pp. 221-242 , 1996

soriano99_desig_sdh Design and dimensioning of survivable SDH networks

Soriano, P.; Wynants, C.; Séguin, R.; Labbé, M.; Gendreau, M. & Fortz, B.

pp. 147-168 , 1999

SoWySeLaGeFo99 Design and Dimensioning of Survivable SDH/SONET Networks

Soriano, P.; Wynants, C.; Séguin, R.; Labbé, M.; Gendreau, M. & Fortz, B.

pp. 147-167 , 1999

Sos00a Optimization of a simplified fleet assignment problem

with metaheuristics: Simulated annealing and GRASP

Sosnowska, D.

2000

Sos99a Optimization of a simplified fleet assignment problem with metaheuristics: Simulated annealing and GRASP

Sosnowska, D.

1999

Soukup



On minimum cost networks with nonlinear costs

Soukup, J.


Soukup/Chow73 Set of test problems for the minimum length connection networks

Soukup, J. & Chow, W.

ACM / SIGMAP Newsletter , Vol. 15 , pp. 48-51 , 1973

South E-Commerce: Implications for Freight

Southworth, F.

2000

CarMedPer96a Integrating heuristics and spatial databases:

a case study

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

tree problem using a memory-based local search strategy

de Souza, M.; Duhamel, C. & Ribeiro, C.

pp. 627-658 , 2003

SouMacOch03a

pdf url



A GRASP-tabu search algorithm for school timetabling

problems

Souza, M.; Maculan, N. & Ochi, L.

pp. 659-672 , 2003

souza2 The graph equipartition problem: optimal solutions, extensions and applications

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.


Spicer-1996 International Survey of Spectrum Assignment for Cellular and PCS.

Federal Communications Commission. http://wireless.fcc.gov/auctions/data/papersAndStudies.html

pdf url

url



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 Side-Conditions

Spielberg, K.


spielman4 Smoothed analysis of termination of linear programming algorithms

Spielman, D.A. & Teng, S.


spielman1 Smoothed analysis: why the simplex algorithm usually takes polynomial time


2001

spielman3 Smoothed analysis of interior-point algorithms: termination


2001

SpiEllBar94 Optical time division multiplexing: Systems and networks

Spirit, D.; Ellis, A. & Barnsley, P.E.


url

url



sporre1a Characterization of the limit point of the central path in semidefinite programming

Sporre, G. & Forsgren, A.

2002

sporre1b Relations between divergence of multipliers and convergence to infeasible points in primal-dual interior methods for nonconvex nonlinear programming

Sporre, G. & Forsgren, A.

2002

spragins94 Telecommunications: Protocols and Design

Spragins, J.


sreeGuru01 A Two-Stage Approach for Virtual Topology Reconfiguration of WDM Optical Networks

Sreenath, N.; Gurucharan, B.H.; Mohan, G. & Murthy, C.S.R.


Sridhar:Park Benders-and-cut algorithm for fixed-charge capacitated network design problem

Sridhar, V. & Park, J.


SrPaGa00 LP-Based Heuristic Algorithms for for Interconnecting Token Rings via Source Routing Bridges

Sridhar, V.; Park, J. & Gavish, B.


url

url



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.


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.


SMM99 A rearrangeable algorithm for the construction of delay-constrained



dynamic multicast trees

Sriram, R.; Manimaran, G. & Murthy, C.S.R.


SiriamEtAl1998 Algorithms for delay-constrained low-cost multicast tree construction



SMM98 Algorithms for delay-constrained low-cost multicast tree construction



Srivaree-ratana02 Estimation of all-terminal network reliability using an artificial neural network

Srivaree-ratana, C.; Konak, A. & Smith, A.


srivastav1 On derandomized approximation algorithms

Srivastav, A. & Stangier, P.

1992

Shekhar-Gaurav Determining link weight system under various objectives for

OSPF networks using a Lagrangian relaxation-based approach

Srivastava, S.; Agrawal, G.; Pióro, M. & Medhi, D.

IEEE eTransactions on Network and Service Management , 2005

StaceyEyersAnido2000 A concave link elimination (CLE) procedure and lower bound for concave



topology, capacity and flow assignment network design problems

Stacey, C.; Eyers, T. & Anido, G.


stallings02 High-Speed Networks and Internets: Performance and Quality of Service

Stallings, W.


Sta98 High-Speed Networks, TCP/IP and ATM Design Principles

Stallings, W.


StGr00a IP Layer Restoration and Network Planning Based on Virtual Protection Cycles

Stamatelakis, D. & Grover, W.D.


StGr00b Theoretical Underpinnings for the Efficiency of Restorable Networks Using Pre-configured Cycles (``$p$-cycles")

Stamatelakis, D. & Grover, W.D.


Stansfield03 Barries to the take-up of electronic commerce among small-medium sized enterprises

Stansfield, M. & Grant, K.

Informing Science , pp. 737-745 , 2003

steele4 Stochastic Calculus and Financial Applications



Steele, J.M.


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.


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.


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.




steinbach1 Markowitz revisited: mean-variance models in financial portfolio analysis

Steinbach, M.C.


Steiner1835 Aufgaben und Lehrsätze, erstere aufzulösen, letztere zu beweisen

Steiner, J.

Journal für die reine und angewandte Mathematik , Vol. 13 , pp. 361-364 , 1835

tuncel5 On a representation of the matching polytope via semidefinite liftings

Stephen, T. & Tunçel, L.


jmstern1 Simulated annealing with a temperature dependent penalty function

Stern, J.M.


rjstern1 Indefinite trust region subproblems and nonsymmetric eigenvalue perturbations

Stern, R.J. & Wolkowicz, H.


99sternbala Multiwavelength Optical Networks: A Layered Approach

Stern, T. & Bala, K.


SteBal00

url



Multiwavelength Optical Networks: A Layered Approach

Stern, T. & Bala, K.


stevens:94 TCP/IP Illustrated, Volume 1: The Protocols

Stevens, W.R.


stewart1 Matrix Algorithms Volume I: Matrix Decompositions

Stewart, G.W.

SIAM , 1998

Stew Introduction to Matrix Computations

Stewart, G.W.


stewart:99 BGP4: Inter-Domain Routing in the Internet

Stewart, J.W.


Stidham92 Pricing and Capacity Decisions for A Service Facility: Stability and Multiple Local Optima

Stidham, S.


StidsenPhD Optimisation problems in optical network design

T. Stidsen

Institute of Mathematical Modelling, Technical University of Denmark , 2002



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.


stoer2 Infeasible-interior-point paths for Sufficient Linear Complementarity Problems and their analyticity

Stoer, J. & Wechs, M.


stoer1 High order infeasible-interior-point methods for Solving Sufficient Linear Complementarity Problems

Stoer, J.; Wechs, M. & Mizuno, S.


des92-4 Design of Survivable Networks

Stoer, M.


mstoer1 A polyhedral approach to multicommodity network design

Stoer, M. & Dahl, G.


StDa94 A Polyhedral Approach to Multicommodity Survivable Network

url



Design



Stoer:Dahl A polyhedral approach to multicommodity survivable network design



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.


StTvy The simplex and projective scaling algorithms as iteratively rewieghted least squares methods

Stone, R.E. & Tovey, C.A.


Stoyan84



Comparison Methods for Queues and Other Stochastic Models

Stoyan, D.

J. Wiley $&$ Sons , 1933

Strader99 Business-to-business electronic commerce and convergent assembly supply chain management

Strader, T.; Lin, F. & Shaw, M.

Journal of Information Technology , Vol. 14 , pp. 361-373 , 1999

Strand-MPLS Converging Protection and Restoration Strategies of the

IP and Optical Layers to Support the Survival of IP Services

Strand, J.

2001

strand01 Importance of Wavelength Conversion in an Optical Network

Strand, J.; Doverspike, R. & Li, G.


Strivastava00 Web usage mining: Discovery and applications of usage patterns from web data

Strivastava, J.; Cooley, R.; Deshpande, M. & Tan, P.N.

ACM SIGKDD Explorations Newsletter , Vol. 1 , 2000

stubbs2 Generating convex polynomial inequalities for mixed 0-1 programs

Stubbs, R.A. & Mehrotra, S.

2001

stubbs1

url



A branch-and-cut method for 0-1 mixed convex programming

Stubbs, R.A. & Mehrotra, S.

1996

sturm12 Error bounds for linear matrix inequalities

Sturm, J.


sturm14 Avoiding numerical cancellation in the interior point method for solving semidefinite programs

Sturm, J.F.


sturm11 Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones

Sturm, J.F.


sturm6 Superlinear convergence of an algorithm for monotone linear complementarity problems, when no strictly complementary solution exists

Sturm, J.F.


sturm9 Primal-Dual Interior Point Approach to Semidefinite Programming

J. F. Sturm

Econometric Institute, Erasmus University , 1997

sturm10 On sensitivity of central solutions in semidefinite programming

url

url

url

url



Sturm, J.F. & Zhang, S.


sturm13 On cones of nonnegative quadratic functions


2001

sturm3 On the long-step path-following method for semidefinite programming



sturm5 An interior point method, based on rank-1 updates, for linear programming



sturm8 On a wide region of centers and primal-dual interior point algorithms for linear programming



sturm2 An $O(nL)$ iteration bound primal-dual cone affine algorithm for linear programming



sturm4 On weighted centers for semidefinite programming


url

url

url

url



1996

sturm1 Symmetric primal-dual path following algorithms for semidefinite programming


1995

sturm7 A dual and interior point approach to solve convex min-max problems


1995

sturmfels1 Variation of cost functions in integer programming

Sturmfels, B. & Thomas, R.R.


SubAziSom99 On Optimal Converter Placement in Wavelength-Routed Networks

Subramaniam, S.; Azizoglu, M. & Somani, A.

IEEE/ACM Transaction on Networks , Vol. 7 , pp. 754-766 , 1999

SubrataZomaya03 A Comparison of Three Artificial Life Techniques for Reporting Cell Planning in Mobile Computing

Subrata, R. & Zomaya, A.

IEEE Transactions on Parallel and Distributed Systems , Vol. 14 , pp. 142-153 , 2003

suck1 Geometric and combinatorial properties of the polytope of binary choice probabilities

Suck, R.


url



sun5 An analytic center cutting plane method for semidefinite feasibility problems

Sun, J.; Toh, K.C. & Zhao, G.Y.


sun3 Global linear and local quadratic convergence of a long-step adaptive-mode interior point method for some monotone variational inequality problems

Sun, J. & Zhao, G.


sun4 A QUADRATICALLY CONVERGENT LONG-STEP INTERIOR POINT METHOD FOR NONLINEAR MONOTONE VARIATIONAL INEQUALITY PROBLEMS

Sun, J. & Zhao, G.

1996

sun2 A QUADRATICALLY CONVERGENT POLYNOMIAL LONG-STEP ALGORITHM FOR A CLASS OF NONLINEAR MONOTONE COMPLEMENTARITY PROBLEMS

Sun, J. & Zhao, G.

1995

sun1 An inexact predictor-corrector method for extended linear-quadratic programming

Sun, J. & Zhu, J.

1994

Zaifu-Yang-2004 The Max-Convolution Approach to Equilibrium Models with Indivisibilities

Sun, N. & Yang, Z.

url

url

url

url



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.


xlsun2 On the relationship between the integer and continuous solutions of convex programs

Sun, X.L. & Li, D.


Sung:Jin Dual-based approach for a hub network design problem under non-restrictive policy

Sung, C. & Jin, H.


Sung95 A routing algorithm for virtual circuit data-networking with unreliable links

Sung, C. & Lee, K.




SunPar95a An algorithm for configuring embedded networks in reconfigurable telecommunication networks

Sung, C. & Park, S.


LotarevEtAl04 Local Optimization in the Steiner Problem on the Euclidean Plane

Suprun, D.L.A. & Uzdemir, A.


Suri01 Profile-Based Routing: A New Framework for MPLS Traffic Engineering

Suri, S.; Waldvogel, M. & Warkhede, P.R.

QofIS'01 , 2001

SuFu94 SDH Network Planning in a Changing Environment

Sutter, A. & Fullsack, J.

Proceedings of the 6th International Network Planning Symposium -- Networks '94 , pp. 149-154 , 1994

SuVaWo98 Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms

Sutter, A.; Vanderbeck, F. & Wolsey, L.


Suurballe Disjoint Paths in a Network

Suurballe, J.W.

Networks , Vol. 4 , pp. 125-145 , 1974



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.


SwTh Graphs, Networks and Algorithms

Swamy, M.N.S. & Thulasiraman, K.

Wiley , 1981

szpankowski1 Average case analysis of algorithms url



Szpankowski, W.

pp. 14.1-14.38 , 1998

szwarc1 The transportation problem with stochastic demands

Szwarc, W.


Cannon:Hoffman Large-scale 0/1 linear programming on distributed workstations

T.~L.~Cannon & K.~L.~Hoffman


tutuncu4 Quadratic convergence of potential-reduction methods for degenerate problems

Tütüncü, R.H.


tutuncu6 Asymptotic behavior of continuous trajectories for primal-dual potential-reduction methods

Tütüncü, R.H.

2001

tutuncu3 A primal-dual variant of the Iri-Imai algorithm for Linear Programming

Tütüncü, R.H.


tutuncu2 An Infeasible-Interior-Point Potential-Reduction Algorithm for Linear Programming

Tütüncü, R.H.

url

url




tutuncu1 Reducing horizontal linear complementarity problems

Tütüncü, R.H. & Todd, M.J.

1993

tutuncu7 Solving semidefinite-quadratic-linear programs using SDPT3

Tütüncü, R.H.; Toh, K.C. & Todd, M.J.


tutuncu5 SDPT3 - a MATLAB software package for semidefinite-quadratic-linear programming, version 3.0

Tütüncü, R.H.; Toh, K.C. & Todd, M.J.

2001

taft:01 Understanding Traffic Dynamics at a Backbone POP

Taft, N.; Bhattacharyya, S.; Jetcheva, J. & Diot, C.

Proc. Workshop on Scalability and Traffic Control in IP Networks, SPIE ITCOM+OPTICOMM Conference , 2001

tah75 Integer Programming: Theory, Applications, and Computations

Taha, H.A.


taillard3 A heuristic column generation method for the heterogeneous fleet VRP

Taillard, E.

1995

taillard1

url



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

Takeda, A.; Dai, Y.; Fukuda, M. & Kojima, M.

1999

takada2 Enumeration of All solutions of a Combinatorial Linear Inequality System Arising from the Polyhedral Homotopy Continuation Method

url

url



Takeda, A.; Kojima, M. & Fujisawa, K.

2000

takriti2 On Robust Optimization of Two-Stage Systems

Takriti, S. & Ahmed, S.

2001

takriti1 Lagrangian solution techniques and bounds for loosely coupled mixed-integer stochastic programs

Takriti, S. & Birge, J.R.


Talim01 Controlling the Robots of Web Search Engines

Talim, J.; Liu, Z.; Nain, P. & Coffman Jr., E.

Proc. ACM Sigmetrics - Performance 2001 Conf. , Vol. 29 , pp. 236-244 , 2001

Talim-sta Optimizing the number of robots in Web search engines

Talim, J.; Liu, Z.; Nain, P. & Coffman Jr., E.


TS90 Asynchronous Teams

Talukdar, S. & de Souza, P.

Second SIAM Conf. on Linear Algebra: Signals, Systems, and Control, San Francisco , 1990

03tam An analytical blocking model for dual-rate sessions in multichannel optical networks

Tamilraj, V. & Subramaniam, S.

Proceedings IEEE Global Telecommunications Conference (GLOBECOM 2001) , Vol.

url



3 , pp. 1515 - 1519 , 2001

tanen96 Computer Networks

Tanenbaum, A.


Ta81 Computer Networks

Tanenbaum, A.


TaWoBa78 Optimization of Teleprocessing Networks with Concentrators and Multiconnected Networks

Tang, D.; Woo, L. & Bahl, L.

IEEE Transactions Comp. , Vol. C-27 , pp. 594-604 , 1978

TangEtAl04 Supporting Dispute Handling in E-Commerce Transactions, a Framework and Related Methodologies

Tang, J.; Fu, A. & Veijalainen, J.

Electronic Commerce Research , Vol. 4 , pp. 393-413 , 2004

TanselFrancisLowe Location on networks: A survey; part I: The $p$-center and $p$-median problems

Tansel, B.C.; Francis, R.L. & Lowe, T.J.


TaoHu03 Optimal Amplifier Placement for Optical Networks

Tao, Y. & Hu, J.

2003



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.


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, &.


Tar85 A strongly polynomial minimum cost circulation algorithm

Tardos, &.


Ta83 Data Structures and Network Algorithms



Tarjan, R.E.

SIAM , 1983

TarjanTrojanowski77 Finding a maximum independent set

Tarjan, R.E. & Trojanowski, A.E.


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



tawarmalani2 Convex extensions and envelopes of lower semi-continuous functions

Tawarmalani, M. & Sahinidis, N.V.


tawarmalani3 Semidefinite relaxations of fractional programs via novel convexification techniques


2000

tawarmalani1 Global optimization of mixed integer nonlinear programs: a theoretical and computational study


1999

TayiEtAl04 Local base station assignment with time intervals in mobile computing environments

Tayi, G.; Rosenkrantz, D. & Ravi, S.


TaylorBolandPhilpott1999 Optimal spanning trees with attenuation and amplification

Taylor, S.; Boland, N. & Philpott, A.

Proceedings of the 15th National Conference of the Australian Society for Operations Research , pp. 1225-1244 , 1999

TayuEtAl05 Cost-Constrained Minimum-Delay Multicasting

Tayu, S.; Al-Mutairi, T. & Ueno, S.

pp. 330-339 , 2005

url

url

url



Teich04 Emerging multiple issue e-auctions

Teich, J.E.; Wallenius, H.; Wallenius, J. & Koppius, O.


TB68 Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph

Teitz, M.B. & Bart, P.


TeBa68 Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph

Teitz, M. & Bart, P.


teixeira:04 Dynamics of Hot-Potato Routing in IP Networks

Teixeira, R.; Shaikh, A.; Griffin, T. & Rexford, J.


teixeira:04a Network Sensitivity to Hot-Potato Disruptions

Teixeira, R.; Shaikh, A.; Griffin, T. & Voelker, G.


Tel Telecom~95

1995

Telle94dom-complexity Complexity of domination-type problems in graphs

Telle, J.A.



Nordic J. of Computing , Vol. 1 , pp. 157-171 , 1994

Tennenholtz-2000 Some tractable combinatorial auctions

Tennenholtz, M.

Proc.~of National Conference on Artificial Intelligence (AAAI) , pp. 98-103 , 2000

terlaky2 An Easy Way to Teach Interior Point Methods

Terlaky, T.

1998

terlaky1 A note on Mascarenhas' counter example about global convergence of the affine scaling algorithm

Terlaky, T. & Tsuchiya, T.

1996

thangiah1 Algorithms for the vehicle routing problems with time deadlines

Thangiah, S.R.; Osman, I.H.; Vinayagamoorthy, R. & Sun, T.

pp. 323-355 , 1993

Econ Survey: E-Management

The~Economist

2000

thia01 Capacity Fairness of WDM Networks with Grooming Capabilities

Thiagarajan, S. & Somani, A.


5thi A capacity correlation model for WDM networks with constrained

url

url



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

Universität zu Köln , 1995

thi95 ABACUS - A Branch-And-CUt System

S. Thienel

Universität zu Köln , 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



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 Integrated-Services Connection-Oriented Networks

Thomas, P.; Teneketzis, D. & Mackie-Mason, J.K.


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Ô(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.


Timmers00 Electronic commerce -- Marketing strategies and business models



Timmers, P.

2000

Timmers98 Business models for electronic markets

Timmers, P.


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.


tits3 An Interior Point Method for Linear Programming, with an Active Set Flavor

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.

url



Mathematical programming , to appear

todd22 Detecting infeasibility in infeasible-interior-point methods for optimization

Todd, M.J.

2003

todd20 The many facets of linear programming

Todd, M.J.


todd21 Semidefinite Optimization

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

Todd, M.J.


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.


todd16

url

url

url

url



On adjusting parameters in homotopy methods for linear programming

Todd, M.J.

1996

todd11 Interior-point algorithms for semi-infinite programming

Todd, M.J.


Todd9 Theory and practice for interior-point methods

Todd, M.J.


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 projective-scaling directions

Todd, M.J.


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

url



Todd, M.J.


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.


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.


todd15 On the Nesterov-Todd direction in semidefinite programming

Todd, M.J.; Toh, K. & Tütüncü, R.H.


url



todd19 Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems

Todd, M.J.; Tuncel, L. & Ye, Y.


todd13 Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming

Todd, M.J. & Ye, Y.


todd12 A lower bound on the number of iterations of long-step and polynomial interior-point methods for linear programming

Todd, M.J. & Ye, Y.

1994

TYe1 A centered projective algorithm for linear programming

Todd, M.J. & Ye, Y.


toh7 Solving large scale semidefinite programs via an iterative solver on the augmented systems

Toh, K.C.

2002

toh2 Some new search directions for primal-dual interior point methods in semidefinite programming

Toh, K.C.


url

url

url



toh4 Solving some large scale semidefinite programs via the conjugate residual method

Toh, K.C. & Kojima, M.


toh3 A note on the calculation of step-lengths in interior-point methods for semidefinite programming

Toh, K.C. & Kojima, M.

1999

toh6 SDPT3 --- a Matlab software package for semidefinite-quadratic-linear programming, version 3.0

Toh, K.C.; Todd, M.J. & Tutuncu, R.

2001

toh1 SDPT3 --- a Matlab software package for semidefinite programming

Toh, K.C.; Todd, M.J. & Tutuncu, R.


toh5 A multiple-cut analytic center cutting plane method for semidefinite feasibility problems

Toh, K.C.; Zhao, G. & Sun, J.


TomasgardAudestad98 Modelling aspects of distributed processing in telecommunications networks

Tomasgard, A.; J.~Audestad; S.~Dye; L.~Stougie; der Vlerk, M. & S.~Wallace


url

url

url

url

url



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.


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.


topaloglu1 An algorithm for approximating piecewise linear concave functions from sample gradients

Topaloglu, H. & Powell, W.B.


To78 Minimizing a Submodular Function on a Lattice



Topkis, D.


torczon1 On the convergence of pattern search algorithms

Torczon, V.


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.


tovey1 Tutorial on computational complexity

Tovey, C.A.


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



An analytic center machine for regression

Trafalis, T.B. & Malyscheff, A.M.

Central European Journal of Operational Research , Vol. to appear , pp. to appear , to appear (2003)

trafalis1 An analytic center machine

Trafalis, T.B. & Malyscheff, A.M.

Machine Learning , Vol. 46 , pp. 203-223 , 2002

Tragantalerngsak:Holt:Ronnqvist An exact method for the two-echelon, single-source, capacitated facility location problem

Tragantalerngsak, S.; Holt, J. & Rönnqvist, M.


trefethen1 Numerical Linear Algebra

Trefethen, L.N. & Bau, D.

SIAM , 1997

trevisan2 Gadgets, approximation, and linear programming

Trevisan, L.; Sorkin, G.B.; Sudan, M. & Williamson, D.P.

SIAM Journal on Computing , Vol. 29(6) , pp. 2074-2097 , 2000

trevisan1 Gadgets, approximation, and linear programming

Trevisan, L.; Sorkin, G.B.; Sudan, M. & Williamson, D.P.

Proceedings of the 37th Annual IEEE Symposium on the Foundations of Computer Science , 1996

trick2 A schedule-and-break approach to sports scheduling

url

url

url



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.


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

Tseng, P.


url



tseng29 Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation

Tseng, P.

2001

tseng31 Convergence Properties of Dikin's Affine Scaling Algorithm for Nonconvex Quadratic Minimization

Tseng, P.

2001

tseng32 An Analysis of the EM Algorithm and Entropy-Like Proximal Point Methods

Tseng, P.

2001

tseng33 Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation

Tseng, P.

2001

tseng22 Co-NP-completeness of some matrix classification problems

Tseng, P.


tseng23 Convergence of Block Coordinate Descent Method for Nondifferentiable Minimization

Tseng, P.

2000

url

url

url

url

url



tseng9 Fortified-descent simplicial search method: A general approach

Tseng, P.


tseng19 Error bounds and superlinear convergence analysis of some Newton-type methods in optimization

Tseng, P.

1999

tseng20 A convergent infeasible interior-point trust-region method for constrained minimization

Tseng, P.

1999

tseng21 Nearest $q$-flat to $m$ points

Tseng, P.

1999

tseng16 A modified forward-backward splitting method for maximalmonotone mappings

Tseng, P.

1998

tseng17 An incremental gradient(-projection) method with momentum term and adaptive stepsize rule

Tseng, P.


tseng18

url

url

url

url

url

url



Error Bounds for Regularized Complementarity Problems

Tseng, P.

1998

tseng3 Merit functions for semi-definite complementarity problems

Tseng, P.


tseng4 Search Directions and Convergence Analysis of Some Infeasible Path-following Methods for the Monotone Semi-Definite LCP

Tseng, P.


tseng11 Convergence and error bound for perturbation of linear programs

Tseng, P.

1997

tseng12 Analysis of a non-interior continuation method based on Chen-Mangasarian smoothing functions for complementarity problems

Tseng, P.

1997

tseng13 Analysis of an infeasible interior path-following method for complementarity problems

Tseng, P.

1997

tseng8 An infeasible path-following method for monotone complementarity problems

url

url

url

url

url



Tseng, P.


tseng2 Search directions and convergence analysis of some infeasible path-following methods for the monotone semi-definite LCP

Tseng, P.

1996

tseng5 Further notes on the existence of search directions in interior-point methods for the monotone semi-definite LCP

Tseng, P.

1996

tseng6 Analysis of infeasible path-following methods using the Alizadeh-Haeberley-Overton direction for the monotone semi-definite LCP

Tseng, P.

1996

Tseng1 Partial affine-scaling for linearly constrained minimization

Tseng, P.


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

url

url

url



Tseng, P. & Bertsekas, D.P.


tseng15 Traffic equilibrium: link flows, path flows and weakly/stronglyacyclic solutions

Tseng, P. & Hagstrom, J.

1998

tseng24 On Some Interior-Point Algorithms for Nonconvex Quadratic Optimization

Tseng, P. & Ye, Y.


Tseng02 The Broadcast Storm Problem in a Mobile Ad Hoc Network

Tseng, Y.; Ni,; S.-Y.; Chen, Y. & Sheu, J.


tsuchiya2 A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming

Tsuchiya, T.


tsuchiya1 A Polynomial Primal-Dual Path-Following Algorithm for Second-order Cone Programming

Tsuchiya, T.

1997

tsuchiya3 Global convergence of the affine scaling methods for

degenerate linear programming problems

url

url

url

url



Tsuchiya, T.


tuncel12 On the Slater condition for the SDP relaxations of nonconvex sets

Tunçel, L.


tuncel10 Generalization of primal-dual interior-point methods to convex optimization problems in conic form

Tunçel, L.

1999

tuncel11 Complexity Analyses of Discretized Successive Convex Relaxation Methods

Tunçel, L.

1999

tuncel7 On the condition numbers for polyhedra in Karmarkar's form

Tunçel, L.


tuncel13 Convex optimization: barrier functions and interior point methods

Tunçel, L.

1998

tuncel4 Primal-dual symmetry and scale invariance of interior-point algorithms for convex optimization

Tunçel, L.

url

url

url

url

url




tuncel8 Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard

Tunçel, L.

1998

tuncel2 Constant potential primal-dual algorithms: a framework

Tunçel, L.


tuncel1 A pseudo-polynomial complexity analysis for interior-point algorithms

Tunçel, L.

1993

tuncel3 On the interplay among entropy, variable metrics and potential functions in interior-point algorithms

Tunçel, L. & Todd, M.J.

1995

tuncel9 On homogeneous convex cones, Caratheodory number, and duality mapping

Tunçel, L. & Xu, S.


Turban97 Auctions and bidding on the Internet: An assessment

Turban, E.


url

url



Turner1 Computing directions for the Karmarkar algorithm

Turner, K.


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



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-and-cut

Uchoa, E. & de Aragão, M.P.


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 multi-reliability 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.



Networks , Vol. 18 , pp. 19-25 , 1988

uy The input/output complexity of transitive closure

Ullman, J.D. & Yannakakis, M.

Annals of Mathematics and Artificial Intelligence , Vol. 3 , pp. 331-360 , 1991

UMTSweb UMTS network planning website

UMTS website ,

2005

urban1 A Primal-Dual Interior-Point Method for Nonconvex Optimization with Multiple Logarithmic Barrier Parameters and with Strong Convergence Properties

Urban, T.; Tits, A. & Lawrence, C.T.

1998

Urb98a Solution procedures for the dynamic facility layout problem

Urban, T.

Annals of Operations Research , pp. 323-342 , 1998

UrbChiRus00a The integrated machine allocation and layout problem

Urban, T.; Chiang, W. & Russel, R.


voros1 A note on the kinks at the mean variance frontier

Vörös, J.; Kriens, J. & Strijbosch, L.W.G.


VaShKuWa96

url

pdf url



Multicommodity Flows in Ring Networks

Vachani, R.; Shulman, A.; Kubat, P. & Ward, J.


Vaidya3 A new algorithm for minimizing convex functions over convex sets

Vaidya, P.M.


Vaid2 An algorithm for linear programming which requires $O(((m+n)n^2+(m+n)^1.5n)L)$ arithmetic operations

Vaidya, P.M.


Vaidya A locally well-behaved potential function and a simple Newton-type method for finding the center of a polytope

Vaidya, P.M.

pp. 79-90 , 1989

Vaidya3old A new algorithm for minimizing convex functions over convex sets

Vaidya, P.M.

Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science , pp. 338-343 , 1989

vaidya4 A technique for bounding the number of iterations in path following algorithms

Vaidya, P.M. & Atkinson, D.S.

pp. 462-489 , 1993

VaHuSm98 A permutation based genetic algorithm for minimum span frequency



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.


VanCaenegem:VanParys:DeTurck:Demeester Dimensioning of survivable WDM networks

Caenegem, B.V.; Parys, W.V.; Turck, F.D. & Demeester, P.


vance2 Branch-and-price algorithms for the one-dimensional cutting stock problem

Vance, P.H.


vance1 Airline crew scheduling: A new formulation and decomposition algorithm

Vance, P.H.; Barnhart, C.; Johnson, E.L. & Nemhauser, G.L.


vanbjn94 Solving binary cutting stock problems by column generation and branch-and-bound

Vance, P.H.; Barnhart, C.; Johnson, E.L. & Nemhauser, G.L.


vandenberghe4 Applications of semidefinite programming

Vandenberghe, L. & Boyd, S.




vandenberghe3 Connections between semi-infinite and semidefinite programming


Proceedings of the International Workshop on Semi-Infinite Programming , pp. 277-294 , 1998

vandenberghe1 Semidefinite Programming



vandenberghe2 Determinant maximization with linear matrix inequality constraints

Vandenberghe, L.; Boyd, S. & Wu, S.

1996

van95 On integer programming decomposition and ways to enforce integrality in the master

Vanderbeck, F.

September 1995 (revised April 1996)

van95b On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm

Vanderbeck, F.

September 1995

vanderbeck4 On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm

Vanderbeck, F.

url

url




vanderbeck5 Exact algorithm for minimizing the number of setups in the one-dimensional cutting stock problem

Vanderbeck, F.


vanderbeck3 Computational study of a column generation algorithm for bin packing and cutting stock problems

Vanderbeck, F.


van98 Exact algorithm for minimising the number of setups in the one-dimensional cutting stock problem

Vanderbeck, F.

1998

van94 Decomposition and Column Generation for Integer Programs

F. Vanderbeck

Universite Catholique de Louvain , 1994

vanderbeck2 An exact algorithm for IP column generation

Vanderbeck, F. & Wolsey, L.A.


vanderbeck1 Valid inequalities for the Lasdon-Terjung production model

Vanderbeck, F. & Wolsey, L.A.




van96 An exact algorithm for IP column generation

Vanderbeck, F. & Wolsey, L.


vanderbei13 Case Studies in Trajectory Optimization: Trains, Planes, and Other Pastimes

Vanderbei, R.J.

2000

vanderbei12 LOQO user's manual - version 3.10

Vanderbei, R.J.


vanderbei5 LOQO: An interior point code for quadratic programming

Vanderbei, R.J.


vanderbei8 Linear Programming: Foundations and Extensions

Vanderbei, R.J.


vanderbei6 Symmetric quasidefinite matrices

Vanderbei, R.J.


vanderbei7 The simplest semidefinite programs are trivial

Vanderbei, R.J.

url




Van3 Interior-point methods: algorithms and formulations

Vanderbei, R.J.


Van2 Splitting dense columns in sparse linear systems

Vanderbei, R.J.


Van1 Affine Scaling for linear programs with Free Variables

Vanderbei, R.J.


Van4 An algorithmic and numerical comparison of several interior-point methods

Vanderbei, R.J.; Duarte, A. & Yang, B.

1994

VMF A Modification of Karmarkar's Linear Programming Algorithm

Vanderbei, R.J.; Meketon, M.S. & Freedman, B.A.


vanderbei9 An interior point algorithm for nonconvex nonlinear programming

Vanderbei, R.J. & Shanno, D.F.


vanderbei11 On Formulating Semidefinite Programming Problems as Smooth

url

url



Convex Nonlinear Optimization Problems

Vanderbei, R.J. & Yurttan, H.

1999

vanderbei10 Using LOQO to solve second-order cone programming problems

Vanderbei, R.J. & Yurttan, H.

1998

vanderplaats1 Structural optimization by methods of feasible directions

Vanderplaats, G.N. & Moses, F.

Computers and Structures , Vol. 3 , pp. 739-755 , 1973

Vannelli2 An adaptation of the interior point method for solving the global routing problem

Vannelli, A.


Vannelli3 An eigenvector solution approach for finding part-machine families in group technology

Vannelli, A. & Hall, R.G.

International Journal on Production Research , Vol. 31 (N2) , pp. 325-349 , 1993

Vannelli1 Interior point optimization methods: theory, implementations and engineering applications

Vannelli, A.; Quintana, V.H. & Vargas, L.

Canadian Journal of Elect. and Comp. Eng. , Vol. 17(2) , pp. 84-94 , 1992

Varadarajan02 Marketing strategy and the Internet: An organizing framework

url



Varadarajan, R. & Yadav, M.S.

Journal of the Academy of Marketing Science , Vol. 30 , pp. 296-312 , 2002

varela99ant Ant Colony Optimisation for Virtual-Wavelength-Path Routing and Wavelength Allocation

Varela, G. & Sinclair, M.

Proceedings of the Congress on Evolutionary Computation , Vol. 3 , pp. 1809-1816 , 1999

varshamov A class of codes for asymmetric channels and a problem from the additive theory of numbers

Varshamov, R.R.

IEEE Trans. Inform. Theory , Vol. IT-19 , pp. 92-95 , 1973

Varshney94 Reliability modeling and performance evaluation of variable link-capacity networks

Varshney, P.; Joshi, A. & Chang, P.


VaskoBarbieriRiekstsReitmeyerStott02 The cable trench problem: combining the shortest path and minimum spanning tree problems

Vasko, F.; Barbieri, R.; Rieksts, B.; Reitmeyer, K. & Stott Jr., K.


Demeester-mkp-book Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS

Vasseur, J.; Pickavet, M. & Demeester, P.


vavasis5 A note on efficient computation of the gradient in semidefinite url



programming

Vavasis, S.

1999

vavasis1 Stable numerical algorithms for equilibrium systems

Vavasis, S.

1992

vav91 Nonlinear optimization: complexity issues

Vavasis, S.


vav90 Quadratic programming is in NP

Vavasis, S.


vavasis4 A simplification to `À primal-dual interior point method whose running time depends only on the constraint matrix''

Vavasis, S. & Ye, Y.

1997

vavasis2 A primal-dual interior point method whose running time depends only on the constraint matrix



vavasis3 Condition numbers for polyhedra with real number data


url




V01 Approximation Algorithms

Vazirani, V.


Vazirani00 Recent results on approximating the Steiner tree problem and its generalizations

Vazirani, V.


Vecchi1 Global wiring by simulated annealing

Vecchi, M.P. & Kirkpatrick, S.


Veciana98 Resource Allocation in Multi-service Networks via Pricing

Veciana, G.D. & Baldick, R.

Computer Networks ISDN Systems , Vol. 30 , pp. 951-962 , 1998

VeeravalliYew02 Network caching strategies for reservation-based multimedia services on high-speed networks

Veeravalli, B. & Yew, E.

Data & Knowledge Engineering , Vol. 41 , pp. 85–-103 , 2002

VeeS99 The Coverage-Capacity Tradeoff in Cellular CDMA Systems

Veeravalli, V. & Sendonaris, A.


VS99



The coverage-capacity tradeoff in cellular CDMA systems

Veeravalli, V. & Sendonaris, A.


Veitch97 ATM network resilience

Veitch, P. & Johnson, D.


VelLag02 Tabu Search with Simple Ejection Chains for Graph Coloring

Velarde, J. & Laguna, M.


velazquez1 Selective Search for Global Optimization of Zero or Small Residual Least-Squares Problems: A Numerical Study

Velazquez, L.; Phillips, G.; Tapia, R.A. & Zhang, Y.

1999

VenkateswaranKodialam1999 Bandwidth allocation in multicast trees with QoS constraints

Venkateswaran, V. & Kodialam, M.

1999

jvera1 A primal-dual symmetric relaxation for homogeneous conic systems

Vera, J.C.; Rivera, J.C. & Pena, J.

2002

vera2 On the complexity of linear programming under finite precision arithmetic

Vera, J.R.

url

url




vera1 Ill-posedness and the complexity of deciding existence of solutions to linear programs

Vera, J.R.


Verhoeven Local search for Steiner trees in graphs

Verhoeven, M.G.A.; Severens, M.E.M. & Aarts, E.H.L.

pp. 117-129 , 1996

VerhoevenDiss Parallel Local Search

M.G.A. Verhoeven

University of Groningen , 1996

VerAar95 Parallel Local Search

Verhoeven, M. & Aarts, E.


VerhoevenSeverens99 Parallel local search for Steiner trees in graphs

Verhoeven, M. & Severens, M.


verweij2 The merchant subtour problem

Verweij, B. & Aardal, K.


verweij1 The Sample Average Approximation Method Applied to Stochastic url



Routing Problems: A Computational Study

Verweij, B.; Ahmed, S.; Kleywegt, A.; Nemhauser, G.L. & Shapiro, A.

2001

vial2 A generic path-following scheme and its application to linear programming and the computation of analytic centers

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.


vicente1 Bilevel and multilevel programming: a bibliography review

Vicente, L.N. & Calamai, P.H.


VickersMayoHeitmannLeeHughes04 Intelligence and individual di.erences in performance on three types of visually presented optimisation problems

Vickers, D.; Mayo, T.; Heitmann, M.; Lee, M. & Hughes, P.

Personality and Individual Differences , Vol. 36 , pp. 1059–-1071 , 2004

Vickrey-1961 Counterspeculation, auctions and competitive sealed tenders

url

url



Vickrey, W.S.

Journal of Finance , Vol. 16 , pp. 8-37 , 1961

VieGon01a Uma Nova Estratégia para Aplicação do GRASP ao problema de alocação de canal

Vieira, C. & Gondim, P.

2001

villalobos2 The Sphere of Convergence of Newton's Method on Two Equivalent Systems from Nonlinear Programming

Villalobos, M.; Tapia, R.A. & Zhang, Y.

1999

villalobos1 The Behavior of Newton-type Methods on Two Equivalent Systems from Linear Programming

Villalobos, M.; Tapia, R.A. & Zhang, Y.

1998

VCJ Generation of disjointly constrained bilinear programming test problems

Vincente, L.N.; Calamai, P.H. & Judice, J.J.


Vit93 Erlang capacity of a power controlled CDMA system

Viterbi, A.M. & Viterbi, A.J.


vitter-survey External memory algorithms and data structures: dealing with MASSIVE DATA

Vitter, J.S.

url

url



ACM Computing Surveys , Vol. 33 , pp. 209-271 , 2001

Vlachos04 Critical success factors of business to business (B2B) e-commerce solutions to supply chain management

Vlachos, I.

pp. 162-175 , 2004

VossAdvances Modern Heuristic Search Methods for the Steiner Tree Problem in Graphs

Vo, S.

pp. 283-323 , 2000

VossSPD Worst case performance of some heuristics for Steiner's problem in directed graphs

Vo, S.


VossDAM Steiner's problem in graphs: heuristic methods

Vo, S.


VossTM On the worst case performance of Takahashi and Matsuyama's Steiner tree heuristic

Vo, S.

1992

Voss Steiner-Probleme in Graphen

Vo, S.

Hain , 1990



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.


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 séquentiels avant test

intégré 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.


VolgenantDuin04 On Steiner Versions of (bi)Connectivity in Network Problems

Volgenant, A. & Duin, C.

Graphs and Combinatorics , Vol. 20 , pp. 263-273 , 2004



vonH77 Simplicial decomposition in nonlinear programming algorithms

von~Hohenbalken, B.


Voss1999 The Steiner tree problem with hop constraints

Voss, S.


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.


vos96d Dynamic tabu search strategies for the traveling purchaser problem

Vo}, S.




VossSPTS Observing logical interdependencies in tabu search - methods and results

Vo}, S.

pp. 41-59 , 1996

Voss99 The Steiner tree problem with hop constraints

Voß, S.


vuong99 Adapting broadcasting sets to topology changes in packet radio networks

Vuong, T.H.P. & Huynh, D.T.

Proceedings of the Eight International Conference on Computer Communications and Networks , pp. 263-268 , 1999

Vygen04 Near-Optimum Global Routing with Coupling, Delay Bounds, and Power Consumption

Vygen, J.

pp. 308-324 , 2004

wachter3 On the Implementation of an Interior-Point Filter Line-Search Algorithm for Large-Scale Nonlinear Programming

Wächter, A. & Biegler, L.T.

2004

wachter2 Global and Local Convergence of Line Search Filter Methods for Nonlinear Programming


2001

url

url



wachter1 Failure of Global Convergence for a Class of Interior Point Methods for Nonlinear Programming



dwagner1 Shortest paths in almost acyclic graphs

Wagner, D.K.


wagner1 Least-change quasi-Newton updates for equality-constrained optimization

Wagner, M. & Todd, M.J.


RCF1075 Distance Vector Multicast Routing Protocol, RFC 1075 -- IETF Network Working Group

Waitzman, D.; Partridge, C. & Deering, S.

1988

WakNag Dynamic Supernetworks for the Integration of Social Networks and Supply Chains with Electronic Commerce: Modeling and Analysis of Buyer-Seller Relationships with Computations

Wakolbinger, T. & Nagurney, A.

Netnomics , Vol. 6 , pp. 153-185 , 2004

des83-1 Steiner trees, partial 2-trees, and minimum IFI networks

Wald, J. & Colbourn, C.

Networks , Vol. 13 , pp. 159-167 , 1983

Walke

url



Mobile Radio Networks

Walke, B.H.


W80 Mechanisms for Broadcast and selective broadcast

D. Wall


Wall80 Mechanisms for Broadcast and Selective Broadcast

D. Wall


W82 Mechanisms for broadcast and selective broadcast

D.W. Wall

Computer Science Department, Stanford University , 1982

wallace1 Decision making under uncertainty: is sensitivity analysis any good?

Wallace, S.


wallace2 Investing in arcs in a network to maximize the expected max flow

Wallace, S.W.

Networks , Vol. 17 , pp. 87-103 , 1987

alwallace1 Managing disruptions to critical interdependent infrastructures in the context of the 2001 World Trade Center attack

Wallace, W.A.; Mendonça, D.; Lee, E.; Mitchell, J.E. & Chow, J.

2003



waltz1 KNITRO-Direct: a hybrid interior algorithm for nonlinear optimization

Waltz, R.; Morales, J.L.; Nocedal, J. & Orban, D.

2003

1bwan Grooming of arbitrary traffic in SONET/WDM rings

Wan, P.J.; Liu, L. & Frieder, O.

Proceedings IEEE Global Telecommunications Conference (GLOBECOM 1999) , Vol. 1B , pp. 1012 - 1016 , 1999

WanLecNotes Lecture Notes on Wireless Networking: OVSF-CDMA Code Assignment in Wireless Ad Hoc Networks

Wan, P.

2004

wan04 Distributed construction of connected dominating set in wireless ad hoc networks

Wan, P.; Alzoubi, K.M. & Frieder, O.


Wan04a Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks



wan03 A Simple Heuristic for Minimum Connected Dominating Set in Graphs



url



Wan02b Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks

Wan, P.; Alzoubi, K. & Frieder, O.


Wan02a Minimum-Energy Broadcasting in Static Ad Hoc Wireless Networks

Wan, P.; Calinescu, G.; Li, X. & Frieder, O.


18wan Grooming of arbitrary traffic in SONET/WDM BLSRs

Wan, P.; Calinescu, G.; Liu, L. & Frieder, O.


Wan04b Minimum-Power Multicast Routing in Static Ad Hoc Wireless Networks

Wan, P.; Calinescu, G. & Yi, C.


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.


WLJ02



Heuristic algorithms for packing of multiple-group multicasting

Wang, C.; Liang, C. & Jan, R.


WangLiangJan02 Heuristic algorithms for packing of multiple-group multicasting

Wang, C.; Liang, C. & Jan, R.


Wang97a Optimal broadcast scheduling in packet radio networks using mean field annealing

Wang, G. & Ansari, N.

IEEE Journal on Sleceted Areas in Communications , Vol. 15 , pp. 250-260 , 1997

WangFangWangSun TSDLMRA: an efficient multicast routing algorithm based on Tabu search

Wang, H.; Fang, J.; Wang, H. & Sun, Y.

Journal of Network and Computer Applications , Vol. 27 , pp. 77–-90 , 2004

19jiadov Improved approaches for cost-effective traffic grooming in WDM ring networks: ILP formulations and single-hop and multihop connections

Wang, J.; Cho, W.; R. Vemuri, V. & Mukherjee, B.

Lightwave Technology, Journal of , Vol. 19 , pp. 1645 - 1653 , 2001

wan01 Improved Approaches for Cost-effective Traffic Grooming in WDM Ring Networks: ILP Formulations and Single-hop and Multihop Connections

Wang, J.; Cho, W.; Vemuru, V. & Mukherjee, B.


3wan Improved approaches for cost-effective traffic grooming in WDM ring networks: nonuniform traffic and bidirectional ring



Wang, J.; R. Vemuri, V.; Cho, W. & Mukherjee, B.

ICC 2000 , Vol. 3 , pp. 1295 - 1299 , 2000

WangJia99 Fixed Topology Steiner Trees and Spanning Forests

Wang, L. & Jia, X.


Wang98 Pricing of Integrated Service Networks

Q. Wang

Carnegie Mellon University , 1998

Wang01 State-Dependent Pricing and its Economic Implications

Wang, Q. & Peha, J.M.

Telecommunications Systems: Modeling, Analysis, Design, and Management , Vol. 18 , pp. 315-329 , 2001

Wang97 Optimal pricing for integrated-services networks with guaranteed quality of service

Wang, Q.; Peha, J.M. & Sirbu, M.A.

1997

Wang97b Optimal Pricing for Integrated-Services Networks

Wang, Q.; Peha, J.M. & Sirbu, M.A.

pp. 353-376 , 1997

twang1 An interior point potential reduction method for constrained equations

Wang, T.; Monteiro, R.D.C. & Pang, J.




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.


WangCrowcroft1996 Quality-of-service routing for supporting multimedia applications



Wang, Z. & Crowcroft, J.


wang:01 Internet Traffic Engineering without Full Mesh Overlaying

Wang, Z.; Wang, Y. & Zhang, L.


ward1 Minimum-aggregate-concave-cost multicommodity flows in strong-series-parallel networks

Ward, J.A.


Ward63 Hierarchical grouping to optimize an objective function

Ward, J.H.

Journal of American Statistical Association , Vol. 58 , pp. 236-244 , 1963

War52 Some theoretical aspects of road traffic research

Wardrop, J.

Proceedings of the Institute of Civil Engineers -- Part II , pp. 325-378 , 1952

WaWiZa99 Exact Algorithms for Plane Steiner Tree Problems: A Computational Study

Warme, D.; Winter, P. & Zachariasen, M.

pp. 81-116 , 2000

warners1 A potential reduction approach to the radio link frequency assignment problem

Warners, J. P.

Faculty of Technical Mathematics and Informatics, Delft University of Technology ,



1995

warners4 A two-phase algorithm for solving a class of hard satisfiability problems

Warners, J.P. & van Maaren, H.


warners2 Potential reduction algorothms for structured combinatorial optimization problems

Warners, J.P.; Terlaky, T.; Roos, C. & Jansen, B.


warners3 A potential reduction approach to the frequency assignment problem

Warners, J.P.; Terlaky, T.; Roos, C. & Jansen, B.


Wa91 An algorithm for designing rings for survivable fiber network

Wasem, O.


WasemGrossTiapa1995 Forecasting broadband demand between geographic areas

Wasem, O.; Gross, A. & Tiapa, G.


WaWuCa94 Survivable SONET Networks - Design Methodology

Wasem, O.; Wu, T. & Cardwell, R.


WatHirMik01 Parallel evolutionary multi-criterion optimization for mobile



telecommunication networks optimization

Watanabe, S.; Hiroyasu, T. & Miki, M.

Proceedings of the EUROGEN 2001 Conference , pp. 167-172 , 2001

des87-2 Edge-connectivity augmentation problems

Watanabe, T. & Nakamura, A.

Computer and System Sciences , Vol. 35 , pp. 96-144 , 1987

Watanabe98 Solving optimization problems by using a Hopfield neural network and genetic algorithm combination

Watanabe, Y.; Mizuguchi, N. & Fujii, Y.

Syst. Comput. Japan , Vol. 29 , pp. 68-73 , 1998

watson1 Theory of globally convergent probability-one homotopies for nonlinear programming

Watson, L.T.


watts Small Worlds: The Dynamics of Networks Between Order and Randomness

Watts, D.


watts2 Collective dynamics of ``small-world'' networks

Watts, D. & Strogatz, S.

Nature , Vol. 393 , pp. 440-442 , 1998

wau96 Design of the Optical Path Layer in Multiwavelength Cross-Connected Networks



Wauters, N. & Demeester, P.


waxman Routing of multipoint connections

Waxman, B.

IEEE Journal Selected Areas in Communications , Vol. 6 , pp. 1617-1622 , 1998

W88 Routing of multipoint connections

Waxman, B.


WaxmanImase Worst-case performance of Rayward-Smith's Steiner tree heuristic

Waxman, B. & Imase, M.


wayne1 A new property and a faster algorithm for baseball elimination

Wayne, K.D.


Weber03 The fragmentation of America's telecommunications system: the operational implications of network unbundling

Weber, J.


WE94 The trade-offs of multicast trees and algorithms

Wei, L. & Estrin, D.

1994



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.


weintraub1 A cutting plane approach for chance constrained linear programs

Weintraub, A. & Vera, J.


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.


weismantel1 On the 0/1 knapsack problem

Weismantel, R.


02weg The value of system level integration

Wellbrock, G. & Guild, K.



LEOS 2002 , Vol. 2 , pp. 369 - 370 , 2002

WelPow67 An upper bound to the chromatic number of a graph and its application to time-table problems

Welsh, D. & Powell, M.

Comp. J. , Vol. ??10?? , pp. 85-86 , 1967

01wen Adaptive routing and wavelength assignment algorithms in WDM grooming networks

Wen, H.; He, R.; Li, L. & Wang, S.

ICCT 2003 , Vol. 1 , pp. 693 - 696 , 2003

00wen A plane-construction traffic grooming algorithm in WDM mesh networks

Wen, H.; He, R.; Li, L. & Wang, S.

PDCAT'2003 , pp. 263 - 267 , 2003

Weng85 Generalized Steiner problem and hexagonal coordinate system (in Chinese)

Weng, J.F.

Acta Math. Appl. Sinica , Vol. 8 , pp. 383-397 , 1985

Weng01 Steiner trees an curved surfaces

Weng, J.

Graphs and Combinatorics , Vol. 17 , pp. 353-363 , 2001

WY93 Greedy Algorithms for the on-line Steiner tree and generalized Steiner problems

Westbrook, J. & Yan, D.

3rd Workshop on Algorithms and data structures (WADS '93) , pp. 621-633 , 1993



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.


00wes ULH-optimized grooming in optical mesh networks

Weston-Dawkes, J.


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.




wets1 Challenges in stochastic programming

Wets, R.J.


wets2 Stochastic programs with fixed recourse: the equivalent deterministic program

Wets, R.J.


Mend90 Optimal Incentive-Compatible Priority Pricing for the M/M/1 Queue

Whang, S. & Mendelson, H.


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.


white1 A linear programming approach to solving bilinear programmes

White, D.J.


White A quadratic facility location problem



White, J.A.


rel90-1 Reliability computations for planar networks

Whited, D.; Shier, D. & Jarvise, J.


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 für Angewandte Informatik und formale Beschreibungsverfahren, University



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.


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.


willemain3 Insights on modeling from a dozen experts

Willemain, T.R.


willenborg2 Elements of Statistical Disclosure Control



Willenborg, L. & de Waal, T.

Springer , 2000

willenborg1 Statistical Disclosure Control in Practice

Willenborg, L. & de Waal, T.

Springer , 1996

williams1 Connections between integer linear programming and constraint logic programming --- an overview and introduction to the cluster of articles

Williams, H.P. & Wilson, J.M.


williams2 Representations of the all_different predicate of constraint satisfaction in integer programming

Williams, H.P. & Yan, H.


01wil The role of the wideband digital cross-connect system in survivable ring networks

Williams, J. & Johnson, J.

Geneva. Technical Program, Conference Record , Vol. 1 , pp. 237 - 244 , 1993

Wil00 Developing IP Multicast Networks: The Definitive Guide to Designing and Deploying CISCO IP Multicast Networks

Williamson, B.

Cisco Press , 2000

williamson2 The primal-dual method for approximation algorithms

Williamson, D.P.




williamson1 Computational experience with anapproximation algorithm on large-scale Euclidean matching instances

Williamson, D.P. & Goemans, M.X.


des95-9 A primal-dual approximation algorithm for generalized Steiner network problems


Williamson04 Information systems development within supply chain management

Williamson, E.A.; Harrison, D.K. & Jordan, M.

International Journal of Information Management , Vol. 24 , pp. 375-385 , 2004

Windrum03 Factors affecting the adoption of intranets and extranets by SMEs: A UK study

Windrum, P. & de~Berranger, P.

2003

jared:02 Traffic engineering between neighboring domains

Winick, J.; Jamin, S. & Rexford, J.

2002

Wins94 Operations research applications and algorithms

Winston, W.L.

Duxbury Press , 1994

Winter02



Optimal Steiner hull algorithm

Winter, P.

Computational Geometry , Vol. 23 , pp. 163-169 , 2002

WinterReductions Reductions for the rectilinear Steiner tree problem

Winter, P.

1994

WinterObstacles Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs

Winter, P.


des87-1 Steiner problems in networks : a survey

Winter, P.

Networks , Vol. 17 , pp. 129-167 , 1987

W87 Steiner problem in networks: A survey

Winter, P.

Networks , Vol. 17 , pp. 129-167 , 1987

WinterNetworks Steiner problem in networks: a survey

Winter, P.

Networks , Vol. 17 , pp. 129-167 , 1987

des86-1 Topological network synthesis

Winter, P.

Combinatorial Optimization - Como 1986 , Vol. 1403 , pp. 282-303 , 1986



des86-2 Generalized Steiner problem in series-parallel

networks

Winter, P.


Wi86 Generalized Steiner Problem in Series-Parallel Networks

Winter, P.


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.




WS92 Path-distance heuristics for the Steiner problem in undirected networks

Winter, P. & Smith, J.

Algorithmica , pp. 309-327 , 1992

WinterZachariasen04 Two-Connected Steiner Networks: Structural Properties

Winter, P. & Zachariasen, M.


Wieselthier00 On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks

Wiselthier, J.; Nguyen, G. & Ephremides, A.


WitHeeHel03 Scalable distributed discovery of resource paths in telecommunication networks using cooperative ant-like agents

Wittner, O.; Heegaard, P. & Helvik, B.

Proceedings of the 2003 Congress on Evolutionary Computation , 2003

Wo67 Methods of nonlinear programming

Wolfe, P.

pp. 97-131 , 1973

Wo70 Convergence theory in nonlinear programming

Wolfe, P.

pp. 1-36 , 1970



Wolff82 Poisson Arrivals See Time Averages

Wolff, R.


wolkowicz3 Simple Efficient Solutions for Semidefinite Programming

Wolkowicz, H.

2001

wolkowicz5 Semidefinite programming for discrete optimization and matrix completion problems

Wolkowicz, H. & Anjos, M.F.


wolkowicz1 Semidefinite programming relaxations for the graph partitioning problem

Wolkowicz, H. & Zhao, Q.

Discrete Applied Mathematics , Vol. 96/97 , pp. 461-479 , 1999

wolkowicz2 Semidefinite programming relaxations for the set partitioning problem

Wolkowicz, H. & Zhao, Q.

1996

wolsey4 Strong formulations for mixed integer programs: valid inequalities and extended formulations

Wolsey, L.A.


wolsey3

url

url

url



Integer Programming

Wolsey, L.A.

John Wiley , 1998

wolsey1 MIP modelling of changeovers in production planning and scheduling problems

Wolsey, L.A.


wolsey2 Valid inequalities for mixed integer programs with generalized and variable upper bound constraints

Wolsey, L.A.


Wolsey98 Integer Programming

Wolsey, L.


Wo89 Submodularity and Valid Inequalities in Capacitated Fixed Charge Networks

Wolsey, L.


Wong84 A dual ascent approach for Steiner tree problems on a directed graph

Wong, R.T.


Wo84 A Dual Ascent Algorithm for the Steiner Problem in Directed Graphs



Wong, R.


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.


Woolston The design of centralized networks with reliability and availability constraints

Woolston, K. & Albin, S.




WoolstonAlbin1988 The design of centralized networks with reliability and availability constraints

Woolston, K. & Albin, S.


mwright4 What, if anything, is new in optimization?

Wright, M.H.

2000

mwright2 Ill-Conditioning and Computational Error in Interior Methods for Nonlinear Programming

Wright, M.H.


mwright3 The Interior-Point Revolution in Constrained Optimization

Wright, M.H.

1998

mwright1 Why a pure Newton barrier step may be infeasible

Wright, M.H.


swright5 On the convergence of the Newton/log-barrier method

Wright, S.


swright11 Recent developments in interior point methods

url

url

url

url

url



Wright, S.

pp. 311-333 , 2000

swright13 Optimization on computational grids

Wright, S.

2000

swright2 Modified Cholesky Factorizations in Interior-Point Algorithms for Linear Programming

Wright, S.


swright8 Effects of finite-precision arithmetic on interior-point methods for nonlinear programming

Wright, S.

1998

swright7 Modifying SQP for Degenerate Problems

Wright, S.

1997

swright6 Primal-dual interior point methods

Wright, S.

SIAM , 1996

swright3 Stability of augmented system factorizations in interior-point methods

Wright, S.

url

url

url

url

url



1994

swright9 The role of linear objective functions in barrier methods

Wright, S. & Jarre, F.


swright10 Properties of the log-barrier function on degenerate nonlinear programs

Wright, S. & Orban, D.

1999

swright4 A superlinear infeasible-interior-point algorithm for monotone complementarity problems

Wright, S. & Ralph, D.


swright1 A superquadratic infeasible-interior-point method for linear complementarity problems

Wright, S. & Zhang, Y.


swright12 Constraint identification and algorithm stabilization for degenerate nonlinear programs

Wright, S.J.


swright14 On reduced convex QP formulations of monotone LCPs

Wright, S.J.


url

url



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.


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



mobile computing and communications , pp. 7-14 , 1999

wu99dom On calculating connected dominating set for efficient routing in ad hoc wireless networks

Wu, J. & Li, H.

Proceedings of the Third ACM International Workshop on Discrete

Algorithms and Methods for Mobile Computing and Communications

, pp. 7-14 , 1999

Wu03 Power-aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets

Wu, J.; Wu, B. & Stojmenovic, I.

Wireless Communications and Mobile Computing , Vol. 4 , pp. 425-438 , 2003

WuFlorHe EMME/2 Implementation of the SCAG-II Model: Data Structure, System Analysis and Computation

Wu, J.H.; Florian, M. & He, S.G.

2000

WuEtAl00 Multicast routing with multiple QoS constraints in ATM networks

Wu, J.; Hwang, R. & Lu, H.

Information Sciences , Vol. 124 , pp. 29-57 , 2000

10wut An economic feasibility study for a broadband virtual path SONET/ATM self-healing ring architecture

Wu, T.; Kong, D. & Lau, R.


des88-1 Optimum routing for fiber optic network



design: models and applications

Wu, T. & Cardwell, R.

Proc. ICC' 88 , pp. 54-60 , 1988

02wuk A broadband virtual path SONET/ATM self-healing ring architecture and its economic feasibility study

Wu, T.; Kong, D. & Lau, R.


wu1 The Bayesian Statistical Approach to the Phase Problem in X-ray Crystallography

Wu, Z.; Phillips, G.; Tapia, R. & Zhang, Y.

1999

wu2 An Efficient Newton's Method for Entropy Maximization in Phase Determination

Wu, Z.; Phillips, G.; Tapia, R. & Zhang, Y.

1999

Wynants:Book Network Synthesis Problems

Wynants, C.


XIAO3 Providing Quality of Service in the Internet

X. X. Xiao

Michigan State University , 2000

Xia05



Solving the combinatorial double auction problem

Xia, M.; Stallaert, J. & Whinston, A.B.


00xia A traffic grooming algorithm based on shared protection in WDM mesh networks

Xiang, B.; Wang, S. & Li, L.

PDCAT'2003. , pp. 254 - 258 , 2003

Xiao04 A Simultaneous routing and resource allocation via dual decomposition

Xiao, L.; Johansson, M. & Boyd, S.


XIAO2 Traffic Engineering with MPLS in the Internet

Xiao, X.; Hannan, A.; Bailey, B. & Ni, L.

IEEE Network Magazine , pp. 28-33 , 2000

xiao:00 Traffic Engineering with MPLS in the Internet

Xiao, X.; Hannan, A.; Bailey, B. & Ni, L.


XIAO1 Internet QoS: A Big Picture

Xiao, X. & Ni, L.M.


xie1 Principal component analysis combined with truncated-Newton minimization for dimensionality reduction of chemical databases

Xie, D.; Singh, S.B.; Fluder, E.M. & Schlick, T.




00chq Performance analysis of multi-hop traffic grooming in mesh WDM optical networks

Xin, C. & Qiao, C.

ICCCN 2003 , pp. 237 - 242 , 2003

07xin Traffic grooming in mesh WDM optical networks - performance analysis

Xin, C.; Qiao, C. & Dixit, S.


00cyc An integrated lightpath provisioning approach in mesh optical networks

Xin, C.; Ye, Y.; Dixit, S. & Qiao, C.


00yin An agent-based traffic grooming and management mechanism for IP over optical networks

Xin, C.; Ye, Y.; Dixit, S. & Qiao, C.

Proceedings , pp. 425 - 430 , 2002

Xiong Optimal design of restorable ATM mesh networks

Xiong, Y.

IEEE ATM Workshop, Proceedings , pp. 394-399 , 1998

ye22 A Note on Approximating the 2-Catalog Segmentation Problem

Xu, D.; Zhang, J. & Ye, Y.

2002

url



XuChi01a Effective heuristic procedure for a field technician

scheduling problem

Xu, J. & Chiu, S.


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.


jxu1 Tabu search for dynamic routing communications network design

Xu, J.; Chiu, S.Y. & Glover, F.


XuChGl99 Optimizing a Ring-based Private Line Telecommunication Network Using Tabu Search

pdf url



Xu, J.; Chiu, S. & Glover, F.


XuChiGlo97 Tabu search for dynamic routing communications network design



Xu1a A probabilistic tabu search for the telecommunications network design


Combinatorial Optimization: Theory and Practice , Vol. 1 , pp. 69-94 , 1996

Xu2a Using tabu search to solve Steiner tree-star problem in telecommunications network design



XuHongJingCaiGu03 An efficient hierarchical timing-driven Steiner tree algorithm for global routing

Xu, J.; Hong, X.; Jing, T.; Cai, Y. & Gu, J.

INTEGRATION, the VLSI journal , Vol. 35 , pp. 69-–84 , 2003

02xu Reducing electronic multiplexing in WDM rings: an evolutionary approach

Xu, J. & Zeng, Q.

ICII 2001 - Beijing. , Vol. 2 , pp. 168 - 173 , 2001

Xu02 An Ad Hoc Network with Mobile Backbones

Xu, K.; Hong, X. & Gerla, M.

Proceedings of the International Conference on Communications , pp. 3138-3143 ,



2002

sxu2 The Global Linear Convergence of an Infeasible Non-Interior Path-Following Algorithm for Complementarity Problems with Uniform P-Functions

Xu, S.

1996

sxu1 A Polynomial Time Interior-Point Path Following Agorithm for LCP Based on Chen-Harker-Kanzow Smoothing Techniques

Xu, S. & Burke, J.

1996

xu3 An $O(nL)$-iteration large-step infeasible path-following algorithm for linear programming

Xu, X.

1994

Xu1b A simplified homogeneous and self-dual linear programming algorithm and its implementation

Xu, X.; Hung, P.F. & Ye, Y.


Xu2b A generalized homogeneous and self-dual algorithm for linear programming

Xu, X. & Ye, Y.


XueXiao05 A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained Multicast Tree under a Steiner Topology

url

url



Xue, G. & Xiao, W.


xue2 An efficient algorithm for minimizing a sum of $P$-norms

Xue, G. & Ye, Y.


xue1 An efficient algorithm for minimizing a sum of Euclidean norms with applications

Xue, G. & Ye, Y.


xue03 Price-based resource allocation in wireless ad-hoc networks

Xue, Y.; Li, B. & Nahrstedt, K.

Proc. IWQoS 2003 , 2003

YAGED2 Minimum Cost Design for Circuit Switched Networks

Yaged, B.

Networks , Vol. 3 , pp. 193-224 , 1973

yag71 Minimum cost routing for static network models

Yaged, B.

Networks , Vol. 1 , pp. 139-172 , 1971

YagIba96a Genetic and local search algorithms as robust and

simple optimization tools

Yagiura, M. & Ibakari, T.

url



pp. 63-82 , 1996

YagYamIba98a A variable depth search algorithm with branching search for the generalized assignment problem

Yagiura, M.; Yamaguchi, T. & Ibakari, T.

1998

Yai00 A game theoretic framework for bandwidth allocation and pricing of elastic connections in broadband networks: Theory and algorithms

Yaiche, H.; Mazumdar, R. & Rosenberg, C.

IEEE/ACM Transaction on Networking , Vol. 8 , pp. 667-678 , 2000

yamakawa1 A parallel primal-dual interior point method for multicommodity flow problems with quadratic costs

Yamakawa, E.; Matsubara, Y. & Fukushima, M.


yamashita1 Superlinear and quadratic convergence of some primal-dual interior point methods for constrained optimization

Yamashita, H. & Yabe, H.


yamashita2 An Infeasible Interior Proximal Method for Convex Programming Problems with Linear Constraints

Yamashita, N.; Kanzow, C.; Morimoto, T. & Fukushima, M.

2000

hyan1 Tight representation of logical constraints as cardinality rules

Yan, H. & Hooker, J.N.

url




YanDeogunAli03 Routing in sparse splitting optical networks with multicast traffic

Yan, S.; Deogun, J. & Ali, M.

Computer Networks , Vol. 41 , pp. 89–-113 , 2003

yan1 Cutting planes for mixed-integer knapsack polyhedra

Yan, X. & Boyd, E.A.


Yang89 Efficient computation of most probably states for communication networks with multimode components

Yang, C. & Kubat, P.


rel90-2 On Generating Most Probable States for

Networks with Multimode Components

Yang, C.

1990

YanLia03 Design of Light-Tree Based Logical Topologies for Multicast Streams in Wavelength Routed Optical Networks

Yang, D. & Liao, W.


YangWing Optimal and suboptimal solution algorithms for the wiring problem

Yang, Y.Y. & Wing, O.



Proceedings of the International Symposium on Circuit Theory , pp. 154-158 , 1972

YangaMohapatra04 Multicasting in MPLS domains

Yanga, B. & Mohapatra, P.

Computer Communications , Vol. 27 , pp. 162–-170 , 2004

Yao82 On constructing minimum spanning trees in $k$-dimensional spaces and related problems

Yao, A.C.


yao1 LQ Control without Riccati Equations: Stochastic Systems

Yao, D.; Zhang, S. & Zhu, X.Y.

1999

ddyao1 Stochastic Modeling and Optimization with Applications in Queues, Finance, and Supply Chains

Yao, D.D.; Zhang, H.Q. & Zhou, X.Y.


01yao Design of hybrid waveband-switched networks with OEO traffic grooming

Yao, S. & Mukherjee, B.


Yat95 A framework for uplink power control in cellular radio systems

Yates, R.D.


url



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.


ye:2003 A Recursive Random Search Algorithm for Large-Scale Network Parameter Configuration

Ye, T. & Kalyanaraman, S.


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

Ye, Y.

2002

ye16 A .699-Approximation Algorithm for Max-Bisection

Ye, Y.


ye11 Approximating quadratic programming with bound and quadratic constraints

url

url

url



Ye, Y.


ye12 On the complexity of approximating a KKT point of quadratic programming

Ye, Y.


ye15 Approximating global quadratic optimization with convex quadratic constraints

Ye, Y.

1998

Ye10 On homogeneous and self-dual algorithms for LCP

Ye, Y.


ye13 Approximating quadratic optimization with linear and boolean constraints

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.

url

url




ye9 How partial knowledge helps to solve linear programs

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.


Ye915 On the finite convergence of interior-point algorithms for linear programming

Ye, Y.


Ye3 An $O(n^3L)$ potential reduction algorithm for linear programming

Ye, Y.


Ye4 Recovering optimal basic variables in Karmarkar's polynomial algorithm for linear programming

Ye, Y.


url



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.


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.; Güler, O.; Tapia, R.A. & Zhang, Y.


YeK1 Recovering Optimal Dual Solutions in Karmarkar's Polynomial Algorithm for Linear Programming

Ye, Y. & Kojima, M.


YePar1



A class of linear complementarity problems solvable in polynomial time

Ye, Y. & Pardalos, P.M.


YeTd1 Containing and shrinking ellipsoids in the path following algorithm

Ye, Y. & Todd, M.J.


YeTM An $O(nL)$-iteration homogeneous and self-dual linear programming algorithm

Ye, Y.; Todd, M.J. & Mizuno, S.


YeTse An extension of Karmarkar's projective algorithm for convex quadratic programming

Ye, Y. & Tse, E.


ye17 Approximation of Dense-$n2$-Subgraph and the Complement of Min-Bisection

Ye, Y. & Zhang, J.

1999

ye17old .602 Approximation of the Complement of Min-Bisection and .519 Approximation of Dense-n/2-Subgraph

Ye, Y. & Zhang, J.

1999

ye18 New results on quadratic minimization

url

url

url



Ye, Y. & Zhang, S.

2001

YeeLin92a A routing algorithm for virtual circuit data networks with multiple sessions per O-D pair

Yee, J. & Lin, F.

Networks , Vol. 22 , pp. 185-208 , 1992

YenLin2001a Near-optimal delay constrained routing in virtual circuit networks

Yen, H. & Lin, F.


YenLin2001b Backbone network design with QoS requirements

Yen, H. & Lin, F.


YenLin05 Near-optimal tree-based access network design

Yen, H. & Lin, F.


YenSchaeferSmith01 A stochastic SONET network design problem

Yen, J.; A.~Schaefer & C.~Smith

2001

YenCarChaGarNgu00a Constraint solving for inkjet print mask design

Yen, J.; Carlsson, M.; Chang, M.; Garcia, J. & Nguyen, H.

Journal of Imaging Science and Technology , Vol. 44 , pp. 391-397 , 2000



yen71 Finding the K Shortest Loopless Paths In a Network

Yen, J.


Yeo02 An efficient broadcast scheduling algorithm for TDMA ad hoc networks

Yeo, J.; Lee, H. & Kim, S.


yildirim1 Sensitivity analysis in linear programming and semidefinite programming using interior-point methods

Yildirim, E.A. & Todd, M.J.


yildirim3 An Interior-Point Approach to Sensitivity Analysis in Degenerate Linear Programs

Yildirim, E.A. & Todd, M.J.

2000

yildirim2 Warm-start strategies in interior-point methods for linear programming

Yildirim, E.A. & Wright, S.J.

2000

YilTriCheLia03a A heuristic for mining association rules in polynomial time

Yilmaz, E.; Triantaphyllou, E.; Chen, J. & Liao, T.


YooBan97 Design, Analysis, and Implementation of Wavelength-Routed All-Optical

url

url

url



Networks: Routing and Wavelength Assignment Approach

Yoo, J. & Banerjee, S.

IEEE Communications Surveys, Broadband Networks Area , Vol. ?? , pp. ??-?? , 1997

03moo Traffic grooming and light-path routing in WDM ring networks with hop-count constraint

Yoon, M.

ICC 2001 , Vol. 3 , pp. 731 - 737 , 2001

Yoon98 Design of distributed fiber transport network with hubbing topology

Yoon, M.; Baek, Y. & Tcha, D.


yoshimoto1 The mean-variance approach to portfolio optimization subject to transaction costs

Yoshimoto, A.


04yuz An integrated DWDM optical network design with traffic grooming

Yu, J. & Zhou, E.

ICC 2002 , Vol. 4 , pp. 2131 - 2136 , 2002

Yuan-ipom2003 A Bi-Criteria Optimization Approach for Robust OSPF Routing

Yuan, D.

Proc. IEEE Workshop on IP Operations and Management (IPOM'2003) , pp. 91-98 , 2003

Yuan01 Optimization models and methods for communication network design and routing



D. Yuan

Division of Optimization, Department of Mathematics, Linköping 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

Y}ld}r}m, E.A.

2001

yildirim5 On sensitivity analysis in conic programming

Y}ld}r}m, E.A.

2001

zabinsky1 Pure adaptive search in global optimization

Zabinsky, Z.B. & Smith, R.L.


Zach01 The rectilinear Steiner problem: A Tutorial

Zachariasen, M.

pp. 467-507 , 2001

url

url



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.


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. 1085-1096 , 2000

zaman1 Review of the academic evidence on the relationship between teaching and research in higher education

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

url



Za69 Minimum Concave Cost Flows in Certain Networks

Zangwill, W.


Za67 The convex simplex method

Zangwill, W.


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. 594-602 , 1996

Zelikovsky97 A series of approximation algorithms for the acyclic directed Steiner tree problem

Zelikovsky, A.


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



Zelikovsky, A.Z.


ZelikovskyIPL A faster approximation algorithm for the Steiner tree problem in graphs

Zelikovsky, A.Z.


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.


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.


ZennerEtAl03 Emerging Uses of SIP in Service Provider Networks

Zenner, G.; Jones, M. & Patel, A.




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

Zhang, D. & Zhang, Y.

1997

ZhYa02 Finding protection cycles in DWDM networks

Zhang, H. & Yang, O.

Proceedings of IEEE International Conference on Communications (ICC 2002) , Vol. 5 , pp. 2756-2760 , 2002

ye19 Improved Analyses of Facility Location Algorithms

Zhang, J. & Ye, Y.

2001

ye20 Improved Approximations for Facility Location Problems with Outliers

Zhang, J. & Ye, Y.

2001

02lin A dynamic traffic grooming algorithm in multi-granularity heterogeneous optical WDM mesh networks

Zhang, L. & Poo, G.

Communications and Signal Processing, 2003 and the Fourth Pacific Rim Conference on Multimedia , Vol. 2 , pp. 1286 - 1289 , 2003

url

url

url



szhang2 Quadratic minimization and semidefinite relaxation

Zhang, S.


szhang3 Global error bounds for convex conic problems

Zhang, S.


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.


03shu Dynamic traffic grooming algorithms for reconfigurable SONET over WDM networks

Zhang, S. & Ramamurthy, B.


08zha An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings

Zhang, X. & Qiao, C.


zha00 An Effective and Comprehensive Approach for Traffic Grooming and



Wavelength Assignment in SONET/WDM Rings

Zhang, X. & Qiao, C.


Zhang2000 Neural Networks in Optimization

Zhang, X.


zhang10 User's guide to LIPSOL: Linear Programming Interior Point Solvers v0.4

Zhang, Y.


zhang4 On Extending some Primal-dual Interior-Point Algorithms From Linear Programming To Semidefinite Programming

Zhang, Y.


zhang5 Solving Large-Scale Linear Programs by Interior-Point MethodsUnder the MATLAB Environment

Zhang, Y.


zhang7 On the convergence of a class of infeasible interior-point methods

for the horizontal linear complementarity problem

Zhang, Y.


zhang11 url



On Numerical Solution of the Maximum Volume Ellipsoid Problem

Zhang, Y. & Gao, L.

2001

yzhang:03 Fast, Accurate Computation of Large-Scale IP Traffic Matrices from Link Loads

Zhang, Y.; Roughan, M.; Duffield, N. & Greenberg, A.


ZhangRoughanDuffieldGreenberg2003 Fast accurate computation of large-scale IP traffic matrices from link loads

Zhang, Y.; Roughan, M.; Duffield, N. & Greenberg, A.

Proceedings of INFOCOMM 2003 , 2003

zhang8 On the superlinear and quadratic convergence of

primal--dual interior point linear programming algorithms

Zhang, Y.; Tapia, R.A. & Dennis, J.E.


Zhang1 On the Superlinear and Quadratic Convergence of Primal-Dual Interior-Point Linear Programming Algorithms

Zhang, Y.; Tapia, R. & Dennis Jr., J.


zhang9 On Convergence of Minimization Methods: Attraction, Repulsion and Selection

Zhang, Y.; Tapia, R. & Velazquez, L.

1999

Zhang3

url



On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms

Zhang, Y. & Zhang, D.


zha94 A Heuristic Wavelength Assignment Algorithm for Multihop WDM Networks with Wavelength Routing and Wavelength Reuse

Zhang, Z. & Acampora, A.

in Proc. IEEE INFOCOM 94 , pp. 534-543 , 1994

zha95 A Heuristic Wavelength Assignment Algorithm for Multihop WDM Networks with Wavelength Routing and Wavelength Re-use

Zhang, Z. & Acampora, A.


Zhang92 On the non-bifurcated routing in virtual circuit communication networks

Zhang, Z. & Hartmann, H.

European transactions on Telecommunications , Vol. 3 , pp. 45-53 , 1992

zha03 Dynamic Traffic Grooming Algorithms for Reconfigurable SONET over WDM Networks

Zhang, Z. & Ramamurthy, B.

IEEE Journal on Selected Areas in Telecommunications , Vol. 21 , pp. 1165-1172 , 2003

zhao6 A log-barrier method with Benders decomposition for solving two-stage stochastic linear programs

Zhao, G.


zhao4 Barrier function in the Lagrangian dual method for solving multi- url



stage stochastic nonlinear programs

Zhao, G.

1998

zhao5 Interior point algorithms for linear complementarity problems based on large neighborhoods of the central path

Zhao, G.


zhao3 Log-Barrier Decomposition Methods For Solving two-stage Stochastic Programs

Zhao, G.

1997

zhao1 Interior Point Methods With Decomposition For Linear Programs

Zhao, G.

1996

zhao2 On the rate of local convergence of high-order infeasible-path-following algorithms for $P_*$-LCP with or without strictly complementary solutions

Zhao, G. & Sun, J.

1997

Zhao Variational Inequalities in General Equilibrium: Analysis and Computation

L. Zhao

Division of Applied Mathematics, Brown University , 1989

ZhaoDaf

url

url

url



General Economic Equilibrium and Variational Inequalities

Zhao, L. & Dafermos, S.


ZhaoNag A Network Formalism for Pure Exchange Economic Equilibria

Zhao, L. & Nagurney, A.

pp. 363-386 , 1993

qzhao2 Semidefinite programming for assignment and partitioning problems

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.


zhemin03 Traffic Grooming in optical WDM mesh networks using the blocking island paradigm

Zhemin, D. & Hamdi, M.


03ding Clustering techniques for traffic grooming in optical WDM mesh networks

Zhemin, D. & Hamdi, M.


zhe04 Optical WDM Networks

url



Zheng, J. & Mouftah, H.

Wiley Interscience , 2004

Zheng:Grover:MacGregor Dependence of network capacity requirements on the allowable flow convergence overloads in ATM backup VP restoration

Zheng, Y.; Grover, W. & MacGregor, M.


ZOK93 A copy network with shared buffers for large-scale multicast ATM switching

Zhong, W.D.; Onozato, Y. & Kaniyil, J.


Zhongqi93 Using neural networks to solve Steiner tree problem

Zhongqi, J.; Huaying, S. & ming, G.H.

IEEE TENCON '93 , pp. 807-810 , 1993

00don Backup group multiplexing: an integrated restoration strategy for IP over WDM optical networks

Zhou, D. & Lai, T.

Computer Networks and Mobile Computing, 2001. Proceedings. 2001 International Conference on , pp. 235 - 240 , 2001

zhou1 Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming

Zhou, G. & Toh, K.


11hzhu A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks



Zhu, H.; Zang, H.; Zhu, K. & Mukherjee, B.


zhuZhangZhuM03 A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks

Zhu, H.; Zang, H.; Zhu, K. & Mukherjee, B.

IEEE/ACM Trans. Netw. , Vol. 11 , pp. 285-299 , 2003

Zhu03 Electronic business adoption by European firms: A cross-country assessment of the facilitators and inhibitors

Zhu, K.; Kraemer, K. & Xu, S.

European Journal of Information Systems , Vol. 12 , pp. 251-268 , 2003

03zhumuk A review of traffic grooming in WDM optical networks: architectures and challenges

Zhu, K. & Mukherjee, B.


00key On-line approaches for provisioning connections of different bandwidth granularities in WDM mesh networks



20kzhu Traffic grooming in an optical WDM mesh network



Zhu:Mukherjee Traffic grooming in an optical WDM mesh network

doi





01zan Exploiting the benefits of virtual concatenation in optical transport networks

Zhu, K.; Mukherjee, B. & Zang, H.


21kzhu A comprehensive study on next-generation optical grooming switches

Zhu, K.; Zang, H. & Mukherjee, B.


3kzhu Design of WDM mesh networks with sparse grooming capability

Zhu, K.; Zang, H. & Mukherjee, B.


17key Traffic engineering in multigranularity heterogeneous optical WDM mesh networks through dynamic traffic grooming

Zhu, K.; Zhu, H. & Mukherjee, B.


ZPG95 A source-based algorithm for delay-constrained minimum-cost multicasting

Zhu, Q.; Parsa, M. & Garcia-Luna-Aceves, J.


xzhu1 On Implementing Self-Regular Proximity Based Feasible IPMs url



Zhu, X.; Peng, J.; Terlaky, T. & Zhang, G.

2004

xxzhu1 Automated design method for heat exchanger network using block decomposition and heuristic rules

Zhu, X.X.


ZHM00 The antenna placement problem for mobile radio networks: An evolutionary approach

Zimmerman, J.; Höns, R. & Mühlenbein, H.

8th International Conference on Telecommunications Systems , pp. 358-366 , 2000

ZimHM00 The antenna placement problem for mobile radio networks: An evolutionary approach

Zimmermann, J.; Höns, R. & Mühlenbein, H.

Proceedings of the 8th Int. Conference on

Telecommunications Systems

, pp. 358-366 , 2000

Zimmermann02 Efficient DNA sticker algorithms for NP-complete graph problems

Zimmermann, K.

Computer Physics Communications , Vol. 144 , pp. 297–-309 , 2002

ZoBe77 A breakthrough in spectrum conserving frequency assignment technology

Zoellner, J. & Beall, C.

IEEE Transactions on Electromagnetic Compatiblity , Vol. 19 , pp. 313-319 , 1977

zwick1 Outward rotations: a tool for rounding solutions of url



semidefinite programming relaxations, with applications to

MAX CUT and other problems

Zwick, U.

Proceedings of 31st STOC , pp. 679-687 , 1999

zymkos04 Design of Survivable Optical Networks by Demand-wise Shared Protection

Zymolka, A. & Koster, A.


luczak Random trees and random graphs

}uczak, T.


luczak91 A note on the sharp concentration of the chromatic number of random graphs

}uczak, T.


luczak90 Components behavior near the critical point of the random graph process

}uczak, T.


lpw The structure of a random graph near the point of the phase transition

}uczak, T.; Pittel, B. & Wierman, J.


PNNI Private Network-Network Interface Specification Version 1.1 (PNNI 1.1)



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.


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.


netflow Netflow, C.

cisco01 Comparing Metro WDM Systems: Unidirectional vs. Bidirectional Implementations

Systems, C.

2001

CISCOOSPF



OSPF design guide

Cisco~Systems~Inc.

2001

CLW Optimal Robot Scheduling for Web Search Engines

Coffman Jr., E.G.; Liu, Z. & Weber, R.


Coffman98 Optimal Robot Scheduling for Web Search Engines

Coffman Jr., E.; Liu, Z. & Weber, R.


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.

url



Networks , Vol. 44 , pp. 73-83 , 2004

desimone2 Exact ground states of two-dimensional $ J$ Ising spin glasses

Simone, C.D.; Diehl, M.; Jünger, 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.; Jünger, 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

url



Steiner trees and polyhedra

Biha, M.D.; Kerivin, H. & Mahjoub, A.


ElBakry1 A study of indicators for identifying zero variables in interior--point methods

El--Bakry, A.S.; Tapia, R.A. & Zhang, Y.


03elbaw The evolution to optical-switching-based core networks

El-Bawah, T.S.; Agrawal, A.; Poppe, F.; Sofman, L.B.; Papadimitriou, D. & Rousseau, B.


FAPweb A website devoted to frequency assignment

FAP website ,

2000

farias4 A family of facets for the p-median polytope

de Farias Jr., I.R.


farias1 A generalized assignment problem with special ordered sets: a polyhedral approach

de Farias Jr., I.R.; Johnson, E.L. & Nemhauser, G.L.


farias2 Facets of the Complementarity Knapsack Polytope

url

url



de Farias Jr., I.R.; Johnson, E.L. & Nemhauser, G.L.

2000

farias5 A Polyhedral Study of the Cardinality Cosntrained Knapsack Problem

de Farias Jr., I.R. & Nemhauser, G.L.


farias3 A Family of Inequalities for the Generalized Assignment Polytope

de Farias Jr., I.R. & Nemhauser, G.L.


Fed E-Commerce Trends in the Market for Freight. Task 3 Freight Trends Scans

Federal~Highway~Administration

2000

ForFul62a Flows in Networks


Princeton Univ. Press , 1962

Galv77 The Optimal Location of Facilities on a Network

R.D. Galvão

Imperial College , 1977

GaRa89 A Method for Solving to Optimality Uncapacitated Location Problems

Galvão, R. & Raggi, L.


url

url



GrotschelMartinWeismantel1 Packing Steiner trees: Polyhedral investigations



GrotschelMartinWeismantel2 Packing Steiner trees: A cutting plane algorithm and computational results



Humes1992 A projection-feasible directions method for the continuous capacity and flow assignment

Humes~Jr., C.

Applied and Computational Mathematics , Vol. 11 , pp. 243-254 , 1992

Ill Opinion No. 96-10, Topic: Electronic Communications; Confidentiality of Client Information; Advertising and Solicitation

Illinois~State~Bar~Association ,

1997

Int Internet Usage Statistics -- The Big Picture

Internet~World~Stats ,

2005

E.360 QoS Routing & Related Traffic Engineering Methods for Multiservice TDM

ITU-T~Recommendations

2002

Kr56 On the Shortest Spanning Tree of a Graph and the Travelling Salesman

url

url



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.


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.


maple601 Maple 6.01. Waterloo Maple

Maple

PromelSteger02 The Steiner Tree Problem

Prömel, H.J. & Steger, A.

Vieweg , 2002



PromelSteger RNC-approximation algorithms for the Steiner problem

Prömel, H.J. & Steger, A.

Vol. 1200 , pp. 559-570 , 1997

RodriguezMartinSalazarGonzalez04 Decomposition Approaches for a Capacitated Hub Problem

Rodríguez-Martín, I. & Salazar-González, 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



Mesh Network Grooming and restoration optimized for optical bypass

Weston-Dawkes, J. & Baroni, S.

Technical Proceedings of the National Fiber Optic Engineers Conference (NDOEF 2002) , pp. 1438-1449 , 2002

YAGED1 Long Range Planning for Communications Networks

B. Yaged~Jr.

Polytechnic Institute of Brooklyn , 1971

cariden Cariden~MATE~Framework

2005

spguru OpNet~SP~Guru

2005

Uengoer04 Off-Centers: A New Type of Steiner Points for Computing Size-Optimal Quality-Guaranteed Delaunay Triangulations

Üngör, A.

pp. 152-161 , 2004

BCGS04 Mobile Ad Hoc Networking

Wiley-IEEE Press , 2004

pardalos14 Quantitative Neuroscience

Kluwer , 2004

Sim Handbook of Quantitative Supply Chain Analysis: Modeling in the E-Business Era

url




simchilevi1 Handbook of Quantitative Supply Chain Analysis

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


abello1 Handbook of Massive Data Sets


apr02 Handbook of Massive Data Sets


DBLP:conf/antalg/2002 Ant Algorithms, Third International Workshop, ANTS 2002, Brussels, Belgium, September 12-14, 2002, Proceedings

Vol. 2463 , 2002

Elliot02 Electronic commerce: B2C strategies and models

John Wiley , 2002

FloudasPardalos02

url

url



Encyclopedia of Optimization (in 6 volumes)


Geunes02 Supply chain optimization: Applications and algorithms


PardalosResende02 Handbook of Applied Optimization


PardalosRomeijn2002 Handbook of Global Optimization, Vol. 2


Stoj02 Handbook of Wireless Networks and Mobile Computing

Wiley InterScience , 2002

DCIndustries01 Steiner Trees in Industries

Kluwer , 2001

NFL2 New century, new look for NFL

2001

Perk01 Ad Hoc Networking


ribeiro1 Essays and surveys in metaheuristics


DSRAdvances00

url



Advances in Steiner Trees

Kluwer , 2000

elghaoui1 Advances in Linear Matrix Inequality Methods in Control

SIAM , 2000

Pardalos3a Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems


PHR00 Mobile Networks and Computing

American Mathematical Society , 2000

Willcocks00 Moving to e-business

Random House , 2000

wolkowicz4 Handbook of Semidefinite Programming: Theory, Algorithms, and Applications


av External Memory Algorithms


NFL1 NFL realigns to eight divisions of four

1999

aarts1 Local search in combinatorial optimization


url

url



DP98 Network Design: Connectivity and Facilities Location


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


PDP98 Multichannel Optical Networks: Theory and Practice


ziemba1 Worldwide asset and liability modeling


APP Multilevel optimization -- Algorithms and applications


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



local-search97-1 Local Search in Combinatorial Optimization

John Wiley & Sons Ltd. , 1997

jt Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge


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


Michie94 Machine learning, neural and statistical classification

Ellis Horwood , 1994

DP93a Network Optimization Problems: Algorithms, Complexity and Applications



World Scientific , 1993

golden1 Vehicle Routing 2000: Advances in Time-Windows, Optimality, Fast Bounds, & Multi-Depot Routing

American Sciences Press , 1993

gruw93a Handbook of convex geometry


Ree93b Modern Heuristic Techniques for Combinatorial Problems

Blackwell Scientific Publications , 1993

Reeves1993 Modern heuristic techniques for combinatorial problems

John Wiley , 1993

flop91 Recent Advances in Global Optimization


OSL IBM Optimization Subroutine Library Guide and Reference

1990

erwe88 Numerical techniques for stochastic optimization


LawlerTSP The Traveling Salesman Problem

John Wiley , 1985

SAS



SAS User's Guide

1985

tsp85-1 The Traveling Salesman Problem


DS Towards Global Optimisation

North-Holland , 1975, 1978

cplex2000 ILOG CPLEX

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



http://www.springer.com/978-0-387-30662-9

Documents

0387306625 Bibliography