Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDINFORMS Journal on Computing, Volume 10
Volume 10, Number 1, Winter 1998
- Geir Dahl
, Mechthild Stoer:
A Cutting Plane Algorithm for Multicommodity Survivable Network Design Problems. 1-11 - Michael R. Bartolacci, S. David Wu:
A Virtual Clustering Approach for Routing Problems in Telecommunication Networks. 12-24 - Frederick Kaefer, June S. Park:
Interconnecting LANs and a FDDI Backbone Using Transparent Bridges: A Model and Solution Algorithms. 25-39 - Sabyasachi Mitra, Ishwar Murthy:
A Dual Ascent Procedure with Valid Inequalities for Designing Hierarchical Network Topologies. 40-55 - Matthew J. Realff, George Stephanopoulos:
On the Application of Explanation-Based Learning to Acquire Control Knowledge for Branch and Bound Algorithms. 56-71 - Marne C. Cario, Barry L. Nelson:
Numerical Methods for Fitting and Simulating Autoregressive-to-Anything Processes. 72-81 - Gianfranco Ciardo, Joshua Gluckman, David M. Nicol:
Distributed State Space Generation of Discrete-State Stochastic Models. 82-93 - Enver Yücesan, Lee W. Schruben:
Complexity of Simulation Models: A Graph Theoretic Approach. 94-106 - Edward Rothberg, Bruce Hendrickson:
Sparse Matrix Ordering Methods for Interior Point Linear Programming. 107-113 - Ronald Armstrong, Shanhong Gu, Lei Lei:
An Efficient Algorithm for a Class of Two-Resource Allocation Problems. 114-120
Volume 10, Number 2, Spring 1998
- Pablo Moscato, Michael G. Norman:
On the Performance of Heuristics on Finite and Infinite Fractal Instances of the Euclidean Traveling Salesman Problem. 121-132 - Matteo Fischetti, Juan José Salazar González, Paolo Toth:
Solving the Orienteering Problem through Branch-and-Cut. 133-148 - Andreas T. Ernst, Mohan Krishnamoorthy:
An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems. 149-162 - Yu-Li Chou, H. Edwin Romeijn, Robert L. Smith:
Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems. 163-179 - Luis Eduardo Neves Gouveia:
Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints. 180-188 - Hemant K. Bhargava, Ramayya Krishnan, Peter Piela:
On Formal Semantics and Analysis of Typed Modeling Languages: An Analysis of Ascend. 189-208 - Paul S. Bradley, Olvi L. Mangasarian, W. Nick Street:
Feature Selection via Mathematical Programming. 209-217 - Jonathan Eckstein, Michael C. Ferris:
Operator-Splitting Methods for Monotone Affine Variational Inequalities, with a Parallel Application to Optimal Control. 218-235 - Julia L. Higle:
Variance Reduction and Objective Function Evaluation in Stochastic Linear Programs. 236-247 - István Maros, Gautam Mitra:
Strategies for Creating Advanced Bases for Large-Scale Linear Programming Problems. 248-260
Volume 10, Number 3, Summer 1998
- H. Paul Williams, John M. Wilson:
Connections Between Integer Linear Programming and Constraint Logic Programming - An Overview and Introduction to the Cluster of Articles. 261-264 - Les G. Proll, Barbara Smith:
Integer Linear Programming and Constraint Programming Approaches to a Template Design Problem. 265-275 - Ken Darby-Dowman, James Little:
Properties of Some Combinatorial Optimization Problems and Their Effect on the Performance of Integer Programming and Constraint Logic Programming. 276-286 - Alexander Bockmayr, Thomas Kasper:
Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming. 287-300 - Hachemi Bennaceur, Idir Gouachi, Gérard Plateau:
An Incremental Branch-and-Bound Method for the Satisfiability Problem. 301-308 - Ram D. Gopal, Paulo B. Góes, Robert S. Garfinkel:
Interval Protection of Confidential Information in a Database. 309-322 - José H. Dulá, Richard V. Helgason, N. Venugopal:
An Algorithm for Identifying the Frame of a Pointed Finite Conical Hull. 323-330 - Rajeev Motwani, Vijay A. Saraswat, Eric Torng:
Online Scheduling with Lookahead: Multipass Assembly Lines. 331-340 - H. A. J. Crauwels, Chris N. Potts, Luk N. Van Wassenhove:
Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem. 341-350 - Robert A. Benhenni:
An Approximate Analysis of a UNIX Macro Process Scheduler. 351-357
Volume 10, Number 4, Fall 1998
- Hemant K. Bhargava, Ramayya Krishnan:
Feature Article - The World Wide Web: Opportunities for Operations Research and Management Science. 359-383 - Gordon H. Bradley, Arnold H. Buss:
Commentary - Dynamic, Distributed, Platform Independent OR/MS Applications - A Network Perspective. 384-387 - Robert Fourer:
Commentary - Predictions for Web Technologies in Optimization. 388-389 - Arthur M. Geoffrion:
Commentary - A New Horizon for OR/MS. 390-392 - Michael A. Trick:
]ary - The World Wide Web: It's the Customers. 393-395 - Hemant K. Bhargava, Ramayya Krishnan:
Rejoinder - OR/MS, Electronic Commerce, and the Virtual INFORMS Community. 396-398 - Sumit Sarkar, Deb Ghosh:
Partitioning the Attribute Set for a Probabilistic Reasoning System. 399-416 - E. Andrew Boyd, Rusty Burlingame, Kenneth Lindsay:
An Efficient Algorithm for Solving an Air Traffic Management Model of the National Airspace System. 417-426 - Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh:
Lifted Cover Inequalities for 0-1 Integer Programs: Computation. 427-437 - Edward C. Sewell:
A Branch and Bound Algorithm for the Stability Number of a Sparse Graph. 438-447 - Carl M. Harris, William G. Marchal:
Distribution Estimation Using Laplace Transforms. 448-458 - Bruce L. Golden:
Appreciation to Referees. 459-460
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 05:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
