| Publication | Date of Publication | Type |
|---|
| An improved augmented neural-network approach for scheduling problems | 2012-06-18 | Paper |
| Heuristics and augmented neural networks for task scheduling with non-identical machines | 2006-10-25 | Paper |
| A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem | 2005-10-13 | Paper |
| Augmented neural networks for task scheduling. | 2003-10-14 | Paper |
| A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution. | 2003-09-07 | Paper |
| New formulations and solution procedures for the hop constrained network design problem. | 2003-06-09 | Paper |
| Selecting hierarchical facilities in a service-operations environment | 2003-05-19 | Paper |
| Routing and capacity assignment in backbone communication networks under time varying traffic conditions | 2002-11-17 | Paper |
| An efficient procedure for designing single allocation hub and spoke systems | 2002-04-17 | Paper |
| Heuristic procedure neural networks for the CMST problem | 2002-03-12 | Paper |
| Planning and coordination of production and distribution facilities for multiple commodities | 2001-10-14 | Paper |
| Hybrid fiber co-axial CATV network design with variable capacity optical network units | 2000-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4495206 | 2000-08-10 | Paper |
| Primary and secondary route selection in backbone communication networks | 1998-10-18 | Paper |
| Routing in packet-switched communication networks with different criticality classes of communicating node pairs | 1998-08-03 | Paper |
| New formulation and relaxation to solve a concave-cost network flow problem | 1998-07-06 | Paper |
| Topological Design of Centralized Computer Networks | 1998-07-06 | Paper |
| Routing and capacity assignment in backbone communication networks | 1997-11-25 | Paper |
| Production, Transportation, and Distribution Planning in a Multi-Commodity Tri-Echelon System | 1997-08-03 | Paper |
| Tabu search for graph partitioning | 1996-11-25 | Paper |
| The Capacitated Carrier Transportation Problem: An Application of the Axial Three-Dimensional Transportation Problem with Heuristic | 1995-10-25 | Paper |
| Efficient Algorithms for Solving the Shortest Covering Path Problem | 1995-05-28 | Paper |
| New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation | 1995-01-11 | Paper |
| Primary and Secondary Route Selection in Backbone Computer Networks | 1994-05-10 | Paper |
| Capacitated emergency facility siting with multiple levels of backup | 1993-12-20 | Paper |
| Locating concentrators in centralized computer networks | 1993-01-16 | Paper |
| Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem | 1992-09-27 | Paper |
| Algorithms for the Multi-Resource Generalized Assignment Problem | 1992-06-26 | Paper |
| The hierarchical network design problem with transshipment facilities | 1992-06-26 | Paper |
| Surrogate Constraints in Integer Programming | 1992-06-25 | Paper |
| The Maximal Covering Location Problem with Capacities on Total Workload | 1991-01-01 | Paper |
| The Hierarchical Network Design Problem: A New Formulation and Solution Procedures | 1991-01-01 | Paper |
| An assignment problem with queueing time cost | 1990-01-01 | Paper |
| Optimal Reorganization Policies for Stationary and Evolutionary Databases | 1990-01-01 | Paper |
| The capacitated maximal covering location problem with backup service | 1989-01-01 | Paper |
| Efficient algorithms for the capacitated concentrator location problem | 1987-01-01 | Paper |
| A heuristic solution procedure for the multiconstraint zero-one knapsack problem | 1987-01-01 | Paper |
| An integer programming model for the allocation of databases in a distributed computer system | 1986-01-01 | Paper |
| Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality | 1985-01-01 | Paper |
| Zero-one integer programs with few contraints - lower bounding theory | 1985-01-01 | Paper |
| Zero-one integer programs with few constraints - Efficient branch and bound algorithms | 1985-01-01 | Paper |
