Photo of Rene Peeters
  • Warandelaan 2, Koopmans Building, room K 433

    5037 AB Tilburg

    Netherlands

19912016
If you made any changes in Pure these will be visible here soon.

Research Output 1991 2016

2016

Urban freight transportation: Challenges, failure, and successes

Kant, G., Quak, H., Peeters, R. & Woensel van, T., 2016, Logistics and Supply Chain Innovation: Bridging the Gap between Theory and Practice. Zijm, H., Klumpp, M., Clausen, U. & Ten Hompel, M. (eds.). Heidelberg: Springer International, Vol. 3. p. 127-139 14 p. (Lecture Notes in Logistics).

Research output: Chapter in Book/Report/Conference proceedingChapterScientificpeer-review

Urban transportation
Freight transportation
Logistics
2015

Determining which Orders to Outsource in the Vehicle Routing Problem with Order Outsourcing

Huijink, S., Kant, G. & Peeters, R., 14 Oct 2015, Tilburg: CentER, Center for Economic Research, 18 p. (CentER Discussion Paper; vol. 2015-049).

Research output: Working paperDiscussion paperOther research output

Outsourcing
Vehicle routing problem
Costs
Common carrier
Trucks
2014
381 Downloads (Pure)

An Adaptable Variable Neighborhood Search for the Vehicle Routing Problem with Order Outsourcing

Huijink, S., Kant, G. & Peeters, M. J. P., 7 Oct 2014, Tilburg: Operations research, 30 p. (CentER Discussion Paper; vol. 2014-062).

Research output: Working paperDiscussion paperOther research output

File
Variable neighborhood search
Outsourcing
Vehicle routing problem
Costs
Common carrier
2012

The maximum order of adjacency matrices with a given rank

Haemers, W. H. & Peeters, M. J. P., 2012, In : Designs Codes and Cryptography. 65, 3, p. 223-232

Research output: Contribution to journalArticleScientificpeer-review

Adjacency Matrix
Induced Subgraph
Odd
Zero
Graph in graph theory

The maximum order of reduced square (0,1)-matrices with a given rank

Haemers, W. H. & Peeters, M. J. P., 2012, In : Electronic Journal of Linear Algebra. 24, p. 3-6

Research output: Contribution to journalArticleScientificpeer-review

(0, 1)-matrices
Adjacency Matrix
Graph in graph theory
Graph theory
Symmetry
2011
235 Downloads (Pure)

The Maximum Order of Reduced Square(0, 1)-Matrices with a Given Rank

Haemers, W. H. & Peeters, M. J. P., 2011, Tilburg: Operations research, (CentER Discussion Paper; vol. 2011-113).

Research output: Working paperDiscussion paperOther research output

File
(0, 1)-matrices
Adjacency Matrix
Graph theory
Symmetry
Graph in graph theory
2010
308 Downloads (Pure)

The Maximum Order of Adjacency Matrices With a Given Rank

Haemers, W. H. & Peeters, M. J. P., 2010, Tilburg: Operations research, 11 p. (CentER Discussion Paper; vol. 2010-116).

Research output: Working paperDiscussion paperOther research output

File
Adjacency Matrix
2004
252 Downloads (Pure)

A Lagrangean Relaxtion Based Algorithm for Solving Set Partitioning Problems

van Krieken, M. G. C., Fleuren, H. A. & Peeters, M. J. P., 2004, Tilburg: Operations research, 21 p. (CentER Discussion Paper; vol. 2004-44).

Research output: Working paperDiscussion paperOther research output

File
Experiments
2003
224 Downloads (Pure)

Problem Reduction in Set Partitioning Problems

van Krieken, M. G. C., Fleuren, H. A. & Peeters, M. J. P., 2003, Tilburg: Operations research, 21 p. (CentER Discussion Paper; vol. 2003-80).

Research output: Working paperDiscussion paperOther research output

File
Experiments
238 Downloads (Pure)

The maximum edge biclique problem is NP-complete

Peeters, M. J. P., 2003, In : Discrete Applied Mathematics. 131, p. 651-654 4 p.

Research output: Contribution to journalArticleScientificpeer-review

File
2002

Estimating daily fat yield from a single milking on test day for herds with a robotic milking system

Peeters, M. J. P. & Galesloot, P., 2002, In : Journal of Dairy Science. 85, 3, p. 682-688 6 p.

Research output: Contribution to journalArticleScientificpeer-review

315 Downloads (Pure)

On the p-ranks of the adjacency matrices of distance regular graphs

Peeters, M. J. P., 2002, In : Journal of Algebraic Combinatorics. 15, 2, p. 127-149 22 p.

Research output: Contribution to journalArticleScientificpeer-review

File
2000
428 Downloads (Pure)

The Maximum Edge Biclique Problem is NP-Complete

Peeters, M. J. P., 2000, Tilburg: Operations research. 5 p. (FEW Research Memorandum; vol. 789)

Research output: Book/ReportReportProfessional

File
Bicliques
NP-complete problem
Bipartite Graph
Induced Subgraph
Polynomial time
1999
398 Downloads (Pure)

Binary codes of strongly regular graphs

Haemers, W. H., Peeters, M. J. P. & van Rijckevorsel, J. M., 1999, In : Designs Codes and Cryptography. 17, p. 187-209 22 p.

Research output: Contribution to journalArticleScientificpeer-review

File
1998
240 Downloads (Pure)

Binary Codes of Strongly Regular Graphs

Haemers, W. H., Peeters, M. J. P. & van Rijckevorsel, J. M., 1998, Tilburg: Operations research. 23 p. (FEW Research Memorandum; vol. 762)

Research output: Book/ReportReportProfessional

File
1997
315 Downloads (Pure)

Strongly regular graphs that are locally a disjoint union of hexagons

Peeters, M. J. P., 1997, In : European Journal of Combinatorics. 18, p. 579-589 10 p.

Research output: Contribution to journalArticleScientificpeer-review

File
1996
466 Downloads (Pure)

Orthogonal Representations over Finite Fields and the Chromatic Number of Graphs

Peeters, M. J. P., 1996, In : Combinatorica. 16, 3, p. 417-431 15 p.

Research output: Contribution to journalArticleScientificpeer-review

File
1995
9 Downloads (Pure)

On the p-ranks of net graphs

Peeters, M. J. P., 1995, In : Designs, Codes and Cryptography. 5, 2, p. 139-153

Research output: Contribution to journalArticleProfessional

File
247 Downloads (Pure)

Ranks and structure of graphs

Peeters, M. J. P., 1995, [n.n.]. 113 p.

Research output: ThesisDoctoral ThesisScientific

File
117 Downloads (Pure)

Uniqueness of Strongly Regular Graphs Having Minimal p-Rank

Peeters, R., 1995, In : Linear Algebra and its Applications. 226-228, September, p. 9-31

Research output: Contribution to journalArticleProfessional

File
1994
269 Downloads (Pure)

On the p-ranks of the adjacency matrices of distance-regular graphs

Peeters, M. J. P., 1994, Unknown Publisher. 20 p. (Research memorandum / Tilburg University, Department of Economics; vol. FEW 656)

Research output: Book/ReportReportProfessional

File
P-rank
Distance-regular Graph
Adjacency Matrix
Unit matrix
1993
200 Downloads (Pure)

On the p-ranks of Latin square graphs

Peeters, M. J. P., 1993, Unknown Publisher. (Research memorandum / Tilburg University, Department of Economics; vol. FEW 600)

Research output: Book/ReportReportProfessional

File
217 Downloads (Pure)

Orthogonal representations over finite fields and the chromatic number of graphs

Peeters, M. J. P., 1993, Unknown Publisher. (Research memorandum / Tilburg University, Department of Economics; vol. FEW 622)

Research output: Book/ReportReportProfessional

File
200 Downloads (Pure)

Strongly regular graphs that are locally a disjoint union of hexagons

Peeters, M. J. P., 1993, Unknown Publisher. 11 p. (Research memorandum / Tilburg University, Faculty of Economics and Business Administration; vol. FEW 625)

Research output: Book/ReportReportProfessional

File
195 Downloads (Pure)

Uniqueness of strongly regular graphs having minimal p-rank

Peeters, M. J. P., 1993, Unknown Publisher. (Research memorandum / Tilburg University, Department of Economics; vol. FEW 626)

Research output: Book/ReportReportProfessional

File
1991
293 Downloads (Pure)

On coloring j-unit sphere graphs

Peeters, M. J. P., 1991, Unknown Publisher. (Research memorandum / Tilburg University, Department of Economics; vol. FEW 512)

Research output: Book/ReportReportProfessional

File