Jacques A. Ferland

According to our database1, Jacques A. Ferland authored at least 53 papers between 1971 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Forest harvest and sawmills: An integrated tactical planning model.
Comput. Electron. Agric., 2019

2017
A Capacitated Vehicle Routing Problem With Synchronized Pick-Ups and Drop-Offs: The Case of Medication Delivery and Supervision in the DR Congo.
IEEE Trans. Engineering Management, 2017

2016
A computational study of hybrid approaches of metaheuristic algorithms for the cell formation problem.
J. Oper. Res. Soc., 2016

2015
A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines.
J. Glob. Optim., 2015

2014
An exact cooperative method for the uncapacitated facility location problem.
Math. Program. Comput., 2014

A variable neighbourhood descent algorithm for the open-pit mine production scheduling problem with metal uncertainty Open.
J. Oper. Res. Soc., 2014

2013
Genotype-phenotype heuristic approaches for a cutting stock problem with circular patterns.
Eng. Appl. Artif. Intell., 2013

2012
Genetic algorithm and large neighbourhood search to solve the cell formation problem.
Expert Syst. Appl., 2012

An exact method with variable fixing for solving the generalized assignment problem.
Comput. Optim. Appl., 2012

2011
Assigning judges to competitions of several rounds using Tabu search.
Eur. J. Oper. Res., 2011

Generalized resolution search.
Discret. Optim., 2011

A meta-heuristic approach for cell formation problem.
Proceedings of the 2011 Symposium on Information and Communication Technology, 2011

Simulated Annealing Method with Different Neighborhoods for Solving the Cell Formation Problem.
Proceedings of the ECTA and FCTA 2011, 2011

A Stochastic Optimization Method for Solving the Machine-Part Cell Formation Problem.
Proceedings of the Advanced Intelligent Computing - 7th International Conference, 2011

2010
Metaheuristic methods based on Tabu search for assigning judges to competitions.
Ann. Oper. Res., 2010

2009
Activity list representation for a generalization of the resource-constrained project scheduling problem.
Eur. J. Oper. Res., 2009

2008
New representation to reduce the search space for the resource-constrained project scheduling problem.
RAIRO Oper. Res., 2008

An inexact proximal point method for solving generalized fractional programs.
J. Glob. Optim., 2008

2007
Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem.
J. Sched., 2007

A tabu search approach for solving a difficult forest harvesting machine location problem.
Eur. J. Oper. Res., 2007

Structured Neighborhood Tabu Search for Assigning Judges to Competitions.
Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling, 2007

2006
Physician Scheduling in Emergency Rooms.
Proceedings of the Practice and Theory of Automated Timetabling VI, 2006

2005
Preface.
Ann. Oper. Res., 2005

2004
Aggregate production planning problem. A new algorithm.
Electron. Notes Discret. Math., 2004

2001
Efficient and Local Efficient Solutions for Assignment Type Problems.
RAIRO Oper. Res., 2001

Generalized Assignment Type Goal Programming Problem: Application to Nurse Scheduling.
J. Heuristics, 2001

Scheduling using tabu search methods with intensification and diversification.
Comput. Oper. Res., 2001

2000
Scheduling the flying squad nurses of a hospital using a multi-objective programming model.
Ann. Oper. Res., 2000

1997
α-Covex Sets and Strong Quasiconvexity.
Math. Oper. Res., 1997

Generalized Assignment-Type Problems: A Powerful Modeling Scheme.
Proceedings of the Practice and Theory of Automated Timetabling II, 1997

1996
Criteria for differentiable generalized monotone maps.
Math. Program., 1996

An Object-Oriented Methodology for Solving Assignment-Type Problems with Neighborhood Search Techniques.
Oper. Res., 1996

Genetic and hybrid algorithms for graph coloring.
Ann. Oper. Res., 1996

1993
Allocating Games for the NHL Using Integer Programming.
Oper. Res., 1993

Preventive maintenance scheduling of power generating units.
Ann. Oper. Res., 1993

Object-oriented implementation of heuristic search methods for Graph Coloring, Maximum Clique, and Satisfiability.
Proceedings of the Cliques, 1993

Genetic Hybrids for the Quadratic Assignment Problem.
Proceedings of the Quadratic Assignment and Related Problems, 1993

1992
Generalized convexity on affine subspaces with an application to potential functions.
Math. Program., 1992

Exchanges procedures for timetabling problems.
Discret. Appl. Math., 1992

1991
Algorithms for generalized fractional programming.
Math. Program., 1991

1990
Decision Support System for the School Districting Problem.
Oper. Res., 1990

1989
Convergence of interval-type algorithms for generalized fractional programming.
Math. Program., 1989

A large scale timetabling problem.
Comput. Oper. Res., 1989

1988
Partial linearization for generalized fractional programming.
ZOR Methods Model. Oper. Res., 1988

1986
Convex quadratic programming with one constraint and bounded variables.
Math. Program., 1986

1985
Timetabling problem for university as assignment of activities to resources.
Comput. Oper. Res., 1985

1984
A Tactical Planning Model for Rail Freight Transportation.
Transp. Sci., 1984

1983
Duality in generalized linear fractional programming.
Math. Program., 1983

1982
Criteria for quasi-convexity and pseudo-convexity: Relationships and comparisons.
Math. Program., 1982

1980
School bus routes generator in urban surroundings.
Comput. Oper. Res., 1980

1972
Mathematical programming problems with quasi-convex objective functions.
Math. Program., 1972

Maximal domains of quasi-convexity and pseudo-convexity for quadratic functions.
Math. Program., 1972

1971
On pseudo-convex functions of nonnegative variables.
Math. Program., 1971


  Loading...