Country: Canada

Found 531 papers in total
On the strength of relaxations of multidimensional knapsack problems
On the strength of relaxations of multidimensional knapsack problems
1994,
Branch-and-bound algorithms for integer programming problems typically employ bounds...
A polynomial time algorithm for the guillotine pallet loading problem
A polynomial time algorithm for the guillotine pallet loading problem
1994,
A polynomial time algorithm is presented for solving the two-dimensional guillotine...
LP-based method for the multi-sheet cutting stock problem
LP-based method for the multi-sheet cutting stock problem
1994,
The rectangular cutting-stock problem consists in laying out a specified list of...
A computer based interactive approach to a two-stage cutting stock problem
A computer based interactive approach to a two-stage cutting stock problem
1994,
In this article, the authors present a computer interactive system, developed for a...
A search-based heuristic for the two-dimensional bin-packing problem
A search-based heuristic for the two-dimensional bin-packing problem
1994,
A heuristic algorithm combining priority rules with a restricted search procedure is...
Optimal channel allocation for cellular mobile systems with nonuniform traffic distribution
Optimal channel allocation for cellular mobile systems with nonuniform traffic distribution
1994,
The problem of optimally allocating available communication channels in a cellular...
Optimization of overall excavation costs in a coal strip mine
Optimization of overall excavation costs in a coal strip mine
1994,
Coal strip mines are usually large scale operations that excavate millions of tons of...
Some complexity issues in a class of knapsack problems: What makes a knapsack problem ‘hard’?
Some complexity issues in a class of knapsack problems: What makes a knapsack problem ‘hard’?
1994,
The authors propose a new class of knapsack problems by assuming that the sizes of the...
A survey of parallel algorithms for one-dimensional integer knapsack problems
A survey of parallel algorithms for one-dimensional integer knapsack problems
1994,
This article surveys several methods that can be used to solve integer knapsack...
Exact algorithms for the Setup Knapsack problem
Exact algorithms for the Setup Knapsack problem
1994,
The Setup Knapsack problem consists in selecting items from a set of disjoint families...
A fast approximation algorithm for the subset-sum problem
A fast approximation algorithm for the subset-sum problem
1994,
A new fully polynomial approximation scheme for the subset-sum problem is presented....
On the complexity of the process shop
On the complexity of the process shop
1994,
The authors consider the problem of scheduling a two-stage processing system where...
Scheduling periodic jobs compactly within a fixed time period in open shops
Scheduling periodic jobs compactly within a fixed time period in open shops
1994,
A graph-theoretical model for a periodic scheduling problem in an open shop is...
AHP rank reversal, normalization and aggregation rules
AHP rank reversal, normalization and aggregation rules
1994,
The authors analyze the Belton and Gear rank reversal problem within an axiomatic...
Assigning the tasks of a tree-like program to a computer network: A survey of recent works
Assigning the tasks of a tree-like program to a computer network: A survey of recent works
1994,
The authors consider a set of n processors p 1 ,p 2 ,...,p n which communicate via a...
The Linear-quadratic Bilevel Programming Problem
The Linear-quadratic Bilevel Programming Problem
1994,
Recently the authors have developed a Sequential LCP (SLCP) algorithm for the solution...
A facility location problem with aggregate capacity
A facility location problem with aggregate capacity
1994,
A variant of the classical capacitated facility location problem is formulated, and...
Computational accuracy and infinitesimals in data envelopment analysis
Computational accuracy and infinitesimals in data envelopment analysis
1993,
The role of the non-Archimedean construct • in the CCR and BCC models is...
Planning the supply of nursing services at a medical centre with non-stationary demand
Planning the supply of nursing services at a medical centre with non-stationary demand
1993,
Editor: please supply abstract.
Exact and heuristic procedures for the Traveling Salesman Problem with Precedence Constraints, based on dynamic programming
Exact and heuristic procedures for the Traveling Salesman Problem with Precedence Constraints, based on dynamic programming
1994,
The Traveling Salesman Problem with Precedence Constraints is to find an hamiltonian...
Optimal rectangular decomposition of a binary relation: Application to documentary databases
Optimal rectangular decomposition of a binary relation: Application to documentary databases
1994,
A rectangle of a binary relation R is a couple of two sets ( A,B) such that...
Capacity expansion and contraction of a facility with economies of scale
Capacity expansion and contraction of a facility with economies of scale
1993,
The authors present a model of capacity expansion in which capacity can be either...
Prediction of warranty costs during a given period of time
Prediction of warranty costs during a given period of time
1993,
This paper considers simple warranty policies where a one-time expense, possibly...
The bilingual server system: A queueing model featuring fully and partially qualified servers
The bilingual server system: A queueing model featuring fully and partially qualified servers
1993,
Numerous organizations are required to provide service in two languages in the same...
Papers per page: