Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
J.F. Pekny
Information about the author J.F. Pekny will soon be added to the site.
Found
7 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Lower bounds for nonlinear assignment problems using many body interactions
1998
This paper concerns lower bounding techniques for the general α-adic assignment...
A decomposition heuristic for scheduling the general batch chemical plant
1997
In this paper a heuristic decomposition algorithm for scheduling the generalized batch...
A branch-and-cut algorithm for Vehicle Routing Problems
1994
The authors present a branch-and-cut algorithm for the identical customer Vehicle...
Exact solution of large asymmetric travelling salesman problems
1991
The travelling salesman problem is one of a class of difficult problems in...
A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
1992
A parallel branch and bound algorithm that solves the asymmetric traveling salesman...
Solution of large dense transportation problems using a parallel primal algorithm
1990
The authors implemented a version of primal transportation algorithm on a 14 processor...
Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem
1989
Computational results are presented for a parallel branch and bound algorithm that...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers