Hoesel, Stan van (Constantinus Peter Maria) 1961
Overview
Works:  84 works in 156 publications in 2 languages and 304 library holdings 

Roles:  Author, Contributor, Other, Honoree 
Publication Timeline
.
Most widely held works by
Stan van Hoesel
Polyhedral results for the edge capacity polytope by
Stan van Hoesel(
)
4 editions published in 2000 in English and held by 28 WorldCat member libraries worldwide
Abstract: "Network loading problems occur in the design of telecommunication networks, in many different settings. The polyhedral structure of this problem is important in developing solution methods for the problem. In this paper we investigate the polytope of the problem restricted to one edge of the network (the edge capacity problem). We describe classes of strong valid inequalities for the edge capacity polytope, and we derive conditions under which these constraints define facets. As the edge capacity problem is a relaxation of the network loading problem, their polytopes are intimately related. We, therefore, also give conditions under which the inequalities of the edge capacity polytope define facets of the network loading polytope. Furthermore, some structural properties are derived, such as the relation of the edge capacity polytope to the knapsack polytope. We conclude the theoretical part of this paper with some lifting theorems, where we show that this problem is polynomially solvable for most of our classes of valid inequalities. The derived inequalities are tested on (i) the edge capacity problem itself and (ii) a variant of the network loading problem. The results show that the inequalities substantially reduce the number of nodes needed in a branchandcut approach. Moreover, they show the importance of the edge subproblem for solving network loading problems."
4 editions published in 2000 in English and held by 28 WorldCat member libraries worldwide
Abstract: "Network loading problems occur in the design of telecommunication networks, in many different settings. The polyhedral structure of this problem is important in developing solution methods for the problem. In this paper we investigate the polytope of the problem restricted to one edge of the network (the edge capacity problem). We describe classes of strong valid inequalities for the edge capacity polytope, and we derive conditions under which these constraints define facets. As the edge capacity problem is a relaxation of the network loading problem, their polytopes are intimately related. We, therefore, also give conditions under which the inequalities of the edge capacity polytope define facets of the network loading polytope. Furthermore, some structural properties are derived, such as the relation of the edge capacity polytope to the knapsack polytope. We conclude the theoretical part of this paper with some lifting theorems, where we show that this problem is polynomially solvable for most of our classes of valid inequalities. The derived inequalities are tested on (i) the edge capacity problem itself and (ii) a variant of the network loading problem. The results show that the inequalities substantially reduce the number of nodes needed in a branchandcut approach. Moreover, they show the importance of the edge subproblem for solving network loading problems."
Models and algorithms for singleitem lot sizing problems by
Stan van Hoesel(
Book
)
5 editions published in 1991 in English and held by 22 WorldCat member libraries worldwide
5 editions published in 1991 in English and held by 22 WorldCat member libraries worldwide
Treewidth: computational experiments(
)
1 edition published in 2001 in English and held by 18 WorldCat member libraries worldwide
1 edition published in 2001 in English and held by 18 WorldCat member libraries worldwide
Treewidth computational experiments by
Arie M. C. A Koster(
Book
)
4 editions published between 2001 and 2002 in English and held by 15 WorldCat member libraries worldwide
Abstract: "Many NPhard graph problems can be solved in polynomial time for graphs with bounded treewidth. Equivalent results are known for pathwidth and branchwidth. In recent years, several studies have shown that this result is not only of theoretical interest but can successfully be applied to find (almost) optimal solutions or lower bounds for many optimization problems. To apply a tree decomposition approach, the treewidth of the graph has to be determined, independently of the application at hand. Althouh for fixed k, linear time algorithms exist to solve the decision problem 'treewidth [<or =] k', their practical use is very limited. The computational tractability of treewidth has been rarely studied so far. In this paper, we compare four heuristics and two lower bounds for instances from applications such as the frequency assignment problem and the vertex coloring problem. Three of the heuristics are based on wellknown algorithms to recognize triangulated graphs. The fourth heuristic recursively improves a tree decomposition by the computation of minimal separating vertex sets in subgraphs. Lower bounds can be computed from maximal cliques and the minimum degree of induced subgraphs. A computational analysis shows that the treewidth of several graphs can be identified by these methods. For other graphs, however, more sophisticated techniques are necessary."
4 editions published between 2001 and 2002 in English and held by 15 WorldCat member libraries worldwide
Abstract: "Many NPhard graph problems can be solved in polynomial time for graphs with bounded treewidth. Equivalent results are known for pathwidth and branchwidth. In recent years, several studies have shown that this result is not only of theoretical interest but can successfully be applied to find (almost) optimal solutions or lower bounds for many optimization problems. To apply a tree decomposition approach, the treewidth of the graph has to be determined, independently of the application at hand. Althouh for fixed k, linear time algorithms exist to solve the decision problem 'treewidth [<or =] k', their practical use is very limited. The computational tractability of treewidth has been rarely studied so far. In this paper, we compare four heuristics and two lower bounds for instances from applications such as the frequency assignment problem and the vertex coloring problem. Three of the heuristics are based on wellknown algorithms to recognize triangulated graphs. The fourth heuristic recursively improves a tree decomposition by the computation of minimal separating vertex sets in subgraphs. Lower bounds can be computed from maximal cliques and the minimum degree of induced subgraphs. A computational analysis shows that the treewidth of several graphs can be identified by these methods. For other graphs, however, more sophisticated techniques are necessary."
Polynomial time algorithms for some multilevel lotsizing problems with production capacities by
Stan van Hoesel(
Book
)
11 editions published in 2002 in English and held by 15 WorldCat member libraries worldwide
11 editions published in 2002 in English and held by 15 WorldCat member libraries worldwide
Economic lotsizing with startup costs : the convex hull by
Stan van Hoesel(
Book
)
7 editions published between 1991 and 1992 in English and held by 10 WorldCat member libraries worldwide
7 editions published between 1991 and 1992 in English and held by 10 WorldCat member libraries worldwide
Polyhedral techniques in combinatorial optimization by
K Aardal(
Book
)
7 editions published in 1995 in English and held by 9 WorldCat member libraries worldwide
7 editions published in 1995 in English and held by 9 WorldCat member libraries worldwide
On the complexity of postoptimality analysis of 0/1 programs by
Stan van Hoesel(
Book
)
3 editions published between 1991 and 1996 in English and held by 8 WorldCat member libraries worldwide
3 editions published between 1991 and 1996 in English and held by 8 WorldCat member libraries worldwide
Parametric analysis of setup cost in the economic lotsizing model without speculative motives by
Albert P.M Wagelmans(
Book
)
2 editions published between 1998 and 1999 in English and held by 7 WorldCat member libraries worldwide
2 editions published between 1998 and 1999 in English and held by 7 WorldCat member libraries worldwide
An overview of Stackelberg pricing in networks by
Stan van Hoesel(
Book
)
2 editions published between 2005 and 2006 in English and held by 6 WorldCat member libraries worldwide
2 editions published between 2005 and 2006 in English and held by 6 WorldCat member libraries worldwide
On the pcoverage problem on the real line by
Stan van Hoesel(
Book
)
2 editions published between 1991 and 2006 in English and held by 5 WorldCat member libraries worldwide
2 editions published between 1991 and 2006 in English and held by 5 WorldCat member libraries worldwide
An O(n log n) algorithm for the twomachine flow shop problem with variable machine speeds by
Stan van Hoesel(
Book
)
3 editions published in 1993 in English and held by 5 WorldCat member libraries worldwide
3 editions published in 1993 in English and held by 5 WorldCat member libraries worldwide
Polyhedral characterization of the economic lotsizing problem with startup costs by
Stan van Hoesel(
Book
)
2 editions published between 1992 and 1993 in English and held by 5 WorldCat member libraries worldwide
2 editions published between 1992 and 1993 in English and held by 5 WorldCat member libraries worldwide
An O(n log n) algorithm for the twomachine flow shop problem with controllable machine speeds by
Stan van Hoesel(
Book
)
2 editions published between 1991 and 1995 in English and held by 5 WorldCat member libraries worldwide
2 editions published between 1991 and 1995 in English and held by 5 WorldCat member libraries worldwide
Preemptive scheduling on a hypercube by
Stan van Hoesel(
Book
)
2 editions published in 1989 in German and English and held by 5 WorldCat member libraries worldwide
2 editions published in 1989 in German and English and held by 5 WorldCat member libraries worldwide
Using geometric techniques to improve dynamic programming algoritms for the economic lotsizing problem and extensions by
Stan van Hoesel(
Book
)
2 editions published between 1992 and 1993 in English and held by 5 WorldCat member libraries worldwide
2 editions published between 1992 and 1993 in English and held by 5 WorldCat member libraries worldwide
Economic lotsizing: an O(n log n)algorithm that runs in linear time in the Wagnerwhitin case by
A. P. M Wagelmans(
Book
)
4 editions published in 1989 in English and held by 5 WorldCat member libraries worldwide
4 editions published in 1989 in English and held by 5 WorldCat member libraries worldwide
Polyhedral techniques in combinatorial optimization by
K Aardal(
Book
)
4 editions published in 1995 in English and held by 4 WorldCat member libraries worldwide
Abstract: "The polyhedral approach is one of the most powerful techniques available for solving hard combinatorial optimization problems. The main idea behind the technique is to consider the linear relaxation of the integer conbinatorial optimization problem, and try to iteratively strengthen the linear formulation by adding violated strong valid inequalities, i.e., inequalities that are violated by the current fractional solution but satisfied by all feasible solutions, and that define highdimensional faces, preferably facets, of the convex hull of feasible solutions. If we have the complete description of the convex hull of feasible solutions all extreme points of this formulation are integral, which means that we can solve the problem as a linear programming problem. Linear programming problems are known to be computationally easy. In Part I of this article we discuss theoretical aspects of polyhedral techniques. Here we will mainly concentrate on the computational aspects. In particular we discuss how polyhedral results are used in cutting plane algorithms. We also consider a few theoretical issues not treated in Part I. We conclude the article by briefly mentioning some alternative techniques for solving combinatorial optimization problems."
4 editions published in 1995 in English and held by 4 WorldCat member libraries worldwide
Abstract: "The polyhedral approach is one of the most powerful techniques available for solving hard combinatorial optimization problems. The main idea behind the technique is to consider the linear relaxation of the integer conbinatorial optimization problem, and try to iteratively strengthen the linear formulation by adding violated strong valid inequalities, i.e., inequalities that are violated by the current fractional solution but satisfied by all feasible solutions, and that define highdimensional faces, preferably facets, of the convex hull of feasible solutions. If we have the complete description of the convex hull of feasible solutions all extreme points of this formulation are integral, which means that we can solve the problem as a linear programming problem. Linear programming problems are known to be computationally easy. In Part I of this article we discuss theoretical aspects of polyhedral techniques. Here we will mainly concentrate on the computational aspects. In particular we discuss how polyhedral results are used in cutting plane algorithms. We also consider a few theoretical issues not treated in Part I. We conclude the article by briefly mentioning some alternative techniques for solving combinatorial optimization problems."
Routing trains through a railway station based on a node packing model by
P. J Zwaneveld(
Book
)
2 editions published in 1997 in English and held by 4 WorldCat member libraries worldwide
2 editions published in 1997 in English and held by 4 WorldCat member libraries worldwide
The partial constraint satisfaction problem: facets and lifting theorems by
Arie M. C. A Koster(
Book
)
2 editions published in 1997 in English and held by 4 WorldCat member libraries worldwide
In this paper the partial constraint satisfaction problem (PCSP) is introduced and formulated as a {0,1}programming problem. We define the partial constraint satisfaction polytope as the convex hull of feasible solutions for this programming problem. As examples of the class of problems studied we mention the frequency assignment problem and the maximum satisfiability problem. Lifting theorems are presented and some classes of facetdefining valid inequalities for PCSP are given. Computational results show that these valid inequalities reduce the gap between LPvalue and IPvalue substantially
2 editions published in 1997 in English and held by 4 WorldCat member libraries worldwide
In this paper the partial constraint satisfaction problem (PCSP) is introduced and formulated as a {0,1}programming problem. We define the partial constraint satisfaction polytope as the convex hull of feasible solutions for this programming problem. As examples of the class of problems studied we mention the frequency assignment problem and the maximum satisfiability problem. Lifting theorems are presented and some classes of facetdefining valid inequalities for PCSP are given. Computational results show that these valid inequalities reduce the gap between LPvalue and IPvalue substantially
more
fewer
Audience Level
0 

1  
General  Special 
Related Identities
 Wagelmans, Albert P.M. (Albert Peter Marie) 1960 Other Honoree Author
 Koster, Arie M. C. A. Author
 Bodlaender, Hans L.
 Kolen, A.W.J. (Anthonius Wilhelmus Johannes) Author
 Aardal, Karen (K.I.) Author
 KonradZuseZentrum für Informationstechnik Berlin
 Wolsey, L.A. (Laurence A.)
 Kroon, L.G. (Leo Gijsbert) 1958
 Zwaneveld, Peter (Peter Jos) 1969 Author
 Goossens, JanWillem (JanWillem Henricus Mathijs) 1975 Author
Useful Links
Alternative Names
Hoesel, C. P. M. van
Hoesel, Constantinus Peter Maria van
Hoesel, Constantinus van
Hoesel, S. van
Hoesel, Stan P.M. van 1961
Hösel, Stan P. M. van
Stan van Hoesel Dutch mathematician
Stan van Hoesel matemático neerlandés
Stan van Hoesel matematikan holandez
Stan van Hoesel wiskundige
Van Hoesel, Stan
Languages