Antoon Kolen

Q: What Schools Are Affiliated With Antoon Kolen

Antoon Kolen is affiliated with the following schools: University of Amsterdam, Tilburg University, Eindhoven University of Technology, Maastricht University, Erasmus University Rotterdam

Antoon Kolen's AcademicInfluence.com Rankings

Antoon Kolen

Economics

#3549

World Rank

#4019

Historical Rank

Econometrics

#108

World Rank

#112

Historical Rank

economics Degrees

Antoon Kolen

Mathematics

#5885

World Rank

#8238

Historical Rank

Measure Theory

#4078

World Rank

#4805

Historical Rank

mathematics Degrees

Download Badge

Economics
Mathematics

Antoon Kolen's Degrees

PhD Mathematics University of Amsterdam
Masters Mathematics University of Amsterdam

Why Is Antoon Kolen Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Anthonius Wilhelmus Johannes Kolen was a Dutch mathematician and Professor at the Maastricht University, in the Department of Quantitative Economics. He is known for his work on dynamic programming, such as interval scheduling and mathematical optimization.

(See a Problem?)

Antoon Kolen's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Economic Lot Sizing: An O(n log n) Algorithm That Runs in Linear Time in the Wagner-Whitin Case (1992) (503)
Vehicle Routing with Time Windows (1987) (335)
Interval scheduling: A survey (2007) (225)
Totally-Balanced and Greedy Matrices (1985) (153)
Minimizing the number of tool switches on a flexible machine (1994) (152)
The partial constraint satisfaction problem: Facets and lifting theorems (1998) (120)
Genetic Local Search in Combinatorial Optimization (1994) (108)
Throughput rate optimization in the automated assembly of printed circuit boards (1991) (100)
Combinatorial optimization algorithm and complexity: Prentice-Hall, Englewood Cliffs, 1982, 496 pages, $49.50 (1983) (98)
Solving covering problems and the uncapacitated plant location problem on trees (1983) (78)
Solving partial constraint satisfaction problems with tree decomposition (2002) (69)
Finding efficient solutions for rectilinear distance location problems efficiently (1981) (58)
On the computational complexity of (maximum) class scheduling (1991) (54)
Solving frequency assignment problems via tree-decomposition (1999) (35)
Robust One-Period Option Hedging (2006) (29)
A dynamic programming algorithm for the local access telecommunication network expansion problem (2000) (27)
On the computational complexity of (maximum) shift class scheduling (1991) (25)
Tree network and planar rectilinear location theory (1986) (25)
Optimal Solutions for Frequency Assignment Problems via Tree Decomposition (1999) (23)
Sensitivity Analysis of List Scheduling Heuristics (1994) (23)
Combinatorics in operations research (1996) (22)
A super-balanced hypergraph has a nest point (1980) (20)
A Dual Algorithm for the Economic Lot-Sizing Problem (1991) (20)
License class design: complexity and algorithms (1992) (20)
Equidistant codes with distance 12 (1977) (18)
A genetic algorithm for the partial binary constraint satisfaction problem: an application to a frequency assignment problem (2007) (17)
An analysis of shift class design problems (1994) (16)
Lower bounds for minimum interference frequency assignment probems (2000) (15)
The Round-Trip p-Center and Covering Problem on a Tree (1985) (14)
Solving Frequency Assignment Problems via Tree-Decomposition1 (1999) (13)
Technical Note - Equivalence between the Direct Search Approach and the Cut Approach to the Rectilinear Distance Location Problem (1981) (11)
Combinatorics in OR (1990) (9)
A general framework for shortest path algorithms (1992) (8)
A dynamic programming algorithm for the local access network expansion problem (1996) (4)
A polynomial-time algorithm for solving the set covering problem on a totally-balanced matrix (1981) (3)
Thepartialconstraintsatisfactionproblem:Facetsandlifting theorems (1998) (2)
A Decision Support System for a Location-Allocation-Routing Problem (1988) (2)
Complexity of location problems on networks (1979) (2)
Economic Lot-Sizing: An O(N Log N)-Algorithm That Runs In Linear Time Wagner-Within Case (1989) (2)
Totally-balanced and greedy matrices : (preprint) (1982) (1)
The p-median problem with mutual communication on a tree : (preprint) (1979) (1)
A two commodity flow formulation for the vehicle routing problem (1988) (1)
The Strong Perfect Graph Conjecture Holds for Coupled Interval Graphs (1992) (0)
CALMA Radio Link Frequency Assignment Project Technical Annexe T-2 . 1 : A-Supplementary Report (2008) (0)
Sensitivity Analysis of List Scheduling Heuristics Sensitivity Analysis of List Scheduling Heuristics (1994) (0)
Solving covering problems and the uncapacitated plant location problem ontrees : (preprint) (1982) (0)
The Tool Fuzzy-Detector for Evaluation of Dairy Farm Management with Fuzzy Sets (1995) (0)
Duality and the nonlinear round-trip -center and covering problems on a tree : (preprint) (1980) (0)
On "A cut approach to the rectilinear distance facility location problem by j.-c. picard and h.d. ratliff : (preprint)" (1979) (0)
Book review (1994) (0)

This paper list is powered by the following services:

Other Resources About Antoon Kolen

en.wikipedia.org

What Schools Are Affiliated With Antoon Kolen?

Antoon Kolen is affiliated with the following schools:

Antoon Kolen's Academic­Influence.com Rankings

Antoon Kolen's Degrees

Why Is Antoon Kolen Influential?

Antoon Kolen's Published Works

Published Works

Other Resources About Antoon Kolen

What Schools Are Affiliated With Antoon Kolen?

Antoon Kolen's AcademicInfluence.com Rankings