| Publication | Date of Publication | Type |
|---|
Road network, landing location, and routing optimization for forest smallholders landscapes
International Transactions in Operational Research | 2025-01-08 | Paper |
Dissimilar arc routing problems
Networks | 2024-05-03 | Paper |
Robust Models for the Kidney Exchange Problem
INFORMS Journal on Computing | 2022-06-27 | Paper |
A multi-objective Monte Carlo tree search for forest harvest scheduling
European Journal of Operational Research | 2020-01-23 | Paper |
Forest harvest scheduling with clearcut and core area constraints
Annals of Operations Research | 2017-12-15 | Paper |
Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints
European Journal of Operational Research | 2017-11-23 | Paper |
Lifted Euclidean inequalities for the integer single node flow set with upper bounds
European Journal of Operational Research | 2016-10-07 | Paper |
The mixed capacitated arc routing problem with non-overlapping routes
European Journal of Operational Research | 2016-10-06 | Paper |
New insights on integer-programming models for the kidney exchange problem
European Journal of Operational Research | 2015-07-29 | Paper |
Modeling target volume flows in forest harvest scheduling subject to maximum area restrictions
Top | 2014-10-08 | Paper |
Imposing Connectivity Constraints in Forest Planning Models
Operations Research | 2014-06-26 | Paper |
A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability
International Transactions in Operational Research | 2013-11-14 | Paper |
Mixing polyhedra with two non divisible coefficients
Mathematical Programming. Series A. Series B | 2012-10-15 | Paper |
A branch-and-price approach for harvest scheduling subject to maximum area restrictions
Computational Optimization and Applications | 2012-07-10 | Paper |
Modeling forest core area with integer programming
Annals of Operations Research | 2012-03-08 | Paper |
Strong formulation for the spot 5 daily photograph scheduling problem
Journal of Combinatorial Optimization | 2010-12-21 | Paper |
A compact formulation of a mixed-integer set
Optimization | 2010-09-21 | Paper |
Effective formulation reductions for the quadratic assignment problem
Computers \& Operations Research | 2010-06-11 | Paper |
Mixing MIR inequalities with two divisible coefficients
Mathematical Programming. Series A. Series B | 2010-04-15 | Paper |
A New Mixed-Integer Programming Model for Harvest Scheduling Subject to Maximum Area Restrictions
Operations Research | 2009-08-13 | Paper |
Reformulation by discretization: application to economic lot sizing
Operations Research Letters | 2008-01-11 | Paper |
Lifting two-integer knapsack inequalities
Mathematical Programming. Series A. Series B | 2007-03-05 | Paper |
Description of 2-integer continuous knapsack polyhedra
Discrete Optimization | 2006-10-10 | Paper |
On the multiple integer knapsack polyhedra
| 2006-07-03 | Paper |
Polyhedral description of the integer single node flow set with constant bounds
Mathematical Programming. Series A. Series B | 2006-01-13 | Paper |
A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints
European Journal of Operational Research | 2004-11-22 | Paper |
scientific article; zbMATH DE number 1683923 (Why is no real title available?)
| 2002-08-07 | Paper |
Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs
Operations Research Letters | 2001-12-05 | Paper |
Lower bounds in lot-sizing models: A polyhedral study
Mathematics of Operations Research | 2001-11-26 | Paper |
A polyhedral approach to a production planning problem
Annals of Operations Research | 2001-01-17 | Paper |
A cutting plane approach to capacitated lot-sizing with start-up costs
Mathematical Programming. Series A. Series B | 1997-11-11 | Paper |
