Abstract. Given an optimization problem with a composite of a convex and componentwise increasing function with a convex vector function as objective function, by means of the conj...
A multiple objective programming approach for the analytic network process (ANP) is proposed to obtain all local priorities for crisp or interval judgments at one time, even in an...
This paper proposes a multiple dependent (or deferred) state sampling plan by variables for the inspection of normally distributed quality characteristics. The decision upon the a...
The unconstrained quadratic binary program (UQP) is proving to be a successful modeling and solution framework for a variety of combinatorial optimization problems. Experience rep...
Bahram Alidaee, Fred Glover, Gary A. Kochenberger,...
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
Mariam Tagmouti, Michel Gendreau, Jean-Yves Potvin