default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDINFORMS Journal on Computing, Volume 11
Volume 11, Number 1, Winter 1999
- Laurent D. Michel, Pascal Van Hentenryck:
Localizer: A Modeling Language for Local Search. 1-14 - Kate A. Smith:
Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research. 15-34 - Mark A. Fleischer, Sheldon H. Jacobson:
Information Theory and the Finite-Time Behavior of the Simulated Annealing Algorithm: Experimental Results. 35-43 - Manuel Laguna, Rafael Martí
:
GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization. 44-52 - Alain Hertz, Gilbert Laporte, Pierrette Nanchen Hugo:
Improvement Procedures for the Undirected Rural Postman Problem. 53-62 - Olivier Guieu, John W. Chinneck:
Analyzing Infeasible Mixed-Integer and Integer Linear Programs. 63-77 - Zhi-Long Chen, Warren B. Powell:
Solving Parallel Machine Scheduling Problems by Column Generation. 78-94 - Erling D. Andersen:
On Exploiting Problem Structure in a Basis Identification Procedure for Linear Programming. 95-103 - Wilbert E. Wilhelm, Pradip Som:
Analysis of Stochastic Assembly with GI-Distributed Assembly Time. 104-116 - Zonghao Gu, George L. Nemhauser, Martin W. P. Savelsbergh:
Lifted Cover Inequalities for 0-1 Integer Programs: Complexity. 117-123
Volume 11, Number 2, Spring 1999
- Alberto Caprara, David Pisinger, Paolo Toth:
Exact Solution of the Quadratic Knapsack Problem. 125-137 - William J. Cook, André Rohe:
Computing Minimum-Weight Perfect Matchings. 138-148 - Jeffery L. Kennington, Jason E. Whitler:
An Efficient Decomposition Algorithm to Optimize Spare Capacity in a Telecommunications Network. 149-160 - James P. Kelly, Jiefeng Xu:
A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem. 161-172 - Jeff T. Linderoth, Martin W. P. Savelsbergh:
A Computational Study of Search Strategies for Mixed Integer Programming. 173-187 - Larry J. LeBlanc, Jerome Chifflet, Philippe Mahey:
Packet Routing in Telecommunication Networks with Path and Flow Restrictions. 188-197 - Charles Fleurent, Fred W. Glover:
Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory. 198-204 - Gérard Cornuéjols, Milind Dawande:
A Class of Hard Small 0-1 Programs. 205-210 - Gerhard J. Woeginger:
An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine. 211-216
Volume 11, Number 3, Summer 1999
- Paul S. Bradley, Usama M. Fayyad, Olvi L. Mangasarian:
Mathematical Programming for Data Mining: Formulations and Challenges. 217-238 - Hemant K. Bhargava:
Data Mining by Decomposition: Adaptive Search for Hypothesis Generation. 239-247 - Siddhartha Bhattacharyya:
Direct Marketing Performance Modeling Using Genetic Algorithms. 248-257 - Selwyn Piramuthu:
Feature Selection for Financial Credit-Risk Evaluation Decisions. 258-266 - Akhil Kumar, Ignacio Olmeda:
A Study of Composite or Hybrid Classifiers for Knowledge Discovery. 267-277 - Michael V. Mannino, Vijay S. Mookerjee:
Optimizing Expert Systems: Heuristics for Efficiently Generating Low-Cost Information Acquisition Strategies. 278-291 - Igor Averbakh, Oded Berman:
Parallel Complexity of Additive Location Problems. 292-298 - Prabhudev Konana, Sudha Ram:
Semantics-Based Transaction Processing for Real-Time Databases: The Case of Automated Stock Trading. 299-315 - Harvey J. Greenberg:
Matrix Sensitivity Analysis from an Interior Solution of a Linear Program. 316-327
Volume 11, Number 4, Fall 1999
- William J. Wolfe:
A Fuzzy Hopfield-Tank Traveling Salesman Problem Model. 329-344 - Andrea Lodi, Silvano Martello, Daniele Vigo:
Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems. 345-357 - Vittorio Maniezzo:
Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem. 358-369 - Antonio Frangioni, Giorgio Gallo:
A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems. 370-393 - Joseph Abate, Ward Whitt:
Computing Laplace Transforms for Numerical Inversion Via Continued Fractions. 394-405 - Zeger Degraeve, Linus Schrage:
Optimal Integer Solutions to Industrial Cutting Stock Problems. 406-419 - Brett W. Schug, Matthew J. Realff:
Propagation of Interval Values in Simple Processing Networks. 420-431
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 2025-02-27 22:34 CET 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:
