2976 search results - page 193 / 596 » On the bounded integer programming |
178
click to vote
SIGCSE
2000
ACM
15 years 10 months ago
2000
ACM
Undergraduates are usually introduced to synchronization in operating systems through a discussion of classical problems such as reader-writer or producers-consumers. The traditio...
184
click to vote
CRYPTO
1991
Springer
15 years 10 months ago
1991
Springer
Recent results in interactive proof systems [?][?] [?] seem to indicate that it is easier for a prover in a single prover interactive proof system to cheat the verifier than it i...
162
click to vote
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, b...
164
click to vote
EOR
2008
15 years 6 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
153
click to vote
DAM
1999
15 years 6 months ago
1999
The Stacker-Crane Problem (SCP) isa sequencing problem, arising inscheduling and transportation, that consists of nding the minimum cost cycle on a mixed graph with oriented arcs ...