#### Filter Results:

- Full text PDF available (15)

#### Publication Year

1981

2011

- This year (0)
- Last 5 years (0)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Gerard Sierksma, Han Hoogeveen
- Journal of Graph Theory
- 1991

- Diptesh Ghosh, Gerard Sierksma
- J. Heuristics
- 2002

Neighborhood search heuristics like local search and its variants are some of the most popular approaches to solve discrete optimization problems of moderate to large size. Apart from tabu search, most of these heuristics are memoryless. In this paper we introduce a new neighborhood search heuristic that makes effective use of memory structures in a way… (More)

- Marek Libura, Edo S. Van der Poort, Gerard Sierksma, Jack A. A. van der Veen
- Discrete Applied Mathematics
- 1998

- Bart H. Boon, Gerard Sierksma
- European Journal of Operational Research
- 2003

- Gert A. Tijssen, Gerard Sierksma
- Math. Program.
- 1998

This paper shows the relationship between degeneracy degrees and multiplicities in linear programming models. The usual definition of degeneracy is restricted to vertices of a polyhedron. We introduce degeneracy for nonempty subsets of polyhedra and show that for linear programming models for which the feasible region contains at least one vertex holds that… (More)

- Marcel Turkensteen, Diptesh Ghosh, Boris Goldengorin, Gerard Sierksma
- European Journal of Operational Research
- 2008

The selection of entries to be included/excluded in Branch and Bound algorithms is usually done on the basis of cost values. We consider the class of Depth First Search algorithms, and we propose to use upper tolerances to guide the search for optimal solutions. In spite of the fact that it needs time to calculate tolerances, our computational experiments… (More)

- Boris Goldengorin, Diptesh Ghosh, Gerard Sierksma
- Computers & OR
- 2003

The simple plant location problem is a well-studied problem in combinatorial optimization. It is one of deciding where to locate a set of plants so that a set of clients can be supplied by them at the minimum cost. This problem often appears as a subproblem in other combinatorial problems. Several branch and bound techniques have been developed to solve… (More)

- Manoj Changat, Henry Martyn Mulder, Gerard Sierksma
- Discrete Mathematics
- 2005

A feasible family of paths in a connected graphG is a family that contains at least one path between any pair of vertices in G. Any feasible path family defines a convexity on G. Well-known instances are: the geodesics, the induced paths, and all paths. We propose a more general approach for such ‘path properties’. We survey a number of results from this… (More)

- Edo S. Van der Poort, Marek Libura, Gerard Sierksma, Jack A. A. van der Veen
- Computers & OR
- 1999

In this paper we use arc tolerances, instead of arc costs, to improve Branch-and-Bound type algorithms for the Asymmetric Traveling Salesman Problem (ATSP). We derive new tighter lower bounds based on exact and approximate bottleneck upper tolerance values of the Assignment Problem (AP). It is shown that branching by tolerances provides a more rational… (More)