| Publication | Date of Publication | Type |
|---|
A practical approach for dealing with hard knapsack problems using general-purpose integer programming software
International Transactions in Operational Research | 2025-01-09 | Paper |
When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners
Engineering Optimization | 2023-10-10 | Paper |
Simple strategies that generate bounded solutions for the multiple‐choice multi‐dimensional knapsack problem: a guide for OR practitioners
International Transactions in Operational Research | 2023-10-04 | Paper |
A comprehensive empirical demonstration of the impact of choice constraints on solving generalizations of the 0–1 knapsack problem using the integer programming option of CPLEX®
Engineering Optimization | 2022-12-23 | Paper |
What is the best greedy-like heuristic for the weighted set covering problem?
Operations Research Letters | 2018-10-02 | Paper |
The generalized Steiner cable-trench problem with application to error correction in vascular image analysis
Operations Research Proceedings 2016 | 2017-12-01 | Paper |
Formulating and solving a radio astronomy antenna connection problem as a generalized cable-trench problem: an empirical study
International Transactions in Operational Research | 2017-10-02 | Paper |
Using an interval graph approach to efficiently solve the housing benefit data retrieval problem
International Transactions in Operational Research | 2013-03-19 | Paper |
Using Pinochle to motivate the restricted combinations with repetitions problem
International Journal of Mathematical Education in Science and Technology | 2011-07-27 | Paper |
Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems
International Transactions in Operational Research | 2010-01-29 | Paper |
Metaheuristics for meltshop scheduling in the steel industry
The Journal of the Operational Research Society | 2007-11-29 | Paper |
An empirical study of hybrid genetic algorithms for the set covering problem
The Journal of the Operational Research Society | 2006-02-21 | Paper |
Coal blending models for optimum cokemaking and blast furnace operation
The Journal of the Operational Research Society | 2005-06-07 | Paper |
A large-scale application of the partial coverage uncapacitated facility location problem
The Journal of the Operational Research Society | 2005-05-23 | Paper |
Penalty-based sequencing strategy implemented within a knowledge-based system
The Journal of the Operational Research Society | 2005-01-13 | Paper |
A matching approach for replenishing rectangular stock sizes
The Journal of the Operational Research Society | 2005-01-10 | Paper |
The cable trench problem: Combining the shortest path and minimum spanning tree problems
Computers & Operations Research | 2002-10-10 | Paper |
A hierarchical approach for one-dimensional cutting stock problems in the steel industry that maximizes yield and minimizes overgrading
European Journal of Operational Research | 1999-11-25 | Paper |
Using a Facility Location Algorithm to Determine Optimum Cast Bloom Lengths
The Journal of the Operational Research Society | 1996-08-05 | Paper |
Optimizing Continuous Caster Product Dimensions: An Example of a Nonlinear Design Problem in the Steel Industry
SIAM Review | 1995-06-13 | Paper |
A Practical Solution to a Cargo Loading Problem at Bethlehem Steel
The Journal of the Operational Research Society | 1995-05-15 | Paper |
A computational note on the Martello-Toth knapsack algorithm
European Journal of Operational Research | 1995-02-19 | Paper |
A Practical Approach for Determining Rectangular Stock Sizes
The Journal of the Operational Research Society | 1994-05-05 | Paper |
A real-time one-dimensional cutting stock algorithm for balanced cutting patterns
Operations Research Letters | 1994-04-06 | Paper |
Adapting Branch-and-Bound for Real-World Scheduling Problems
The Journal of the Operational Research Society | 1993-11-14 | Paper |
Bethlehem steel combines cutting stock and set covering to enhance customer service
Mathematical and Computer Modelling | 1993-01-16 | Paper |
Solving large set covering problems on a personal computer
Computers & Operations Research | 1988-01-01 | Paper |
Hybrid heuristics for minimum cardinality set covering problems
Naval Research Logistics Quarterly | 1986-01-01 | Paper |
An efficient heuristic for large set covering problems
Naval Research Logistics Quarterly | 1984-01-01 | Paper |
Using a facility location algorithm to solve large set covering problems
Operations Research Letters | 1984-01-01 | Paper |
