Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Th.M. Liebling
Information about the author Th.M. Liebling will soon be added to the site.
Found
11 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Decision-aiding methodology for the school bus routing and scheduling problem
2005
We consider the school bus routing and scheduling problem, where transportation demand...
Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
2005
We address the weighted max-cut problem, or equivalently the problem of maximizing a...
Disjoint paths in the plane
1995
Given n pairs of points in the Euclidean plane, we address the problem of finding...
Rolling horizon scheduling in a rolling-mill
1997
This paper treats a production planning problem in an aluminum manufacturing plant...
Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results
1995
The authors present an O(pën) algorithm for the problem of finding disjoint...
Tree polytope on 2-trees
1994
The authors give a complete polyhedral characterization of the tree polytope (convex...
New approaches in modelling and simulation growth processes in material sciences
1992
This paper surveys two interdisciplinary projects dealing with modelling growth...
Referee assignment for volleyball championships: A competition between three local search heuristics
1992
The authors model the problem of assigning referees to matches of volleyball...
Modeling the satellite placement problem as a network flow problem with one side constraint
1991
The placement of telecommunication satellites in the geostationary orbit (GSO) gives...
A note on order preserving matchings
1989
The authors study order preserving injections or bipartite matchings from poset V 1 to...
From linear separability to unimodality: A hierarchy of pseudo-Boolean functions
1988
When an injective pseudo-Boolean function f : B n ⇒&λτ;∼ is...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers