期刊： DISCRETE OPTIMIZATION, 2021; 41 ()
The paper considers two-agent simultaneous optimization problems on an unbounded serial-batching machine, in which the objective function of agent A i......
期刊： DISCRETE OPTIMIZATION, 2021; 39 ()
Consider the group testing problem with an input set of size n and the number of defective items being d = 1, that allows at most y positive responses......
期刊： DISCRETE OPTIMIZATION, 2019; 32 ()
Let G = (V(G), E(G)) be a weighted digraph with vertex set V(G) = {v(1), v(2), ..., v(n)} and arc set E(G), where the arc weights are nonzero nonnegat......
期刊： DISCRETE OPTIMIZATION, 2019; 34 ()
In this paper, we study a multiple-terminal extension of the classic Hamiltonian path problem where m salesmen are initially located at different depo......
期刊： DISCRETE OPTIMIZATION, 2019; 34 ()
In this paper, we study single-machine scheduling problems with due dates, positional due indices, deadlines and positional deadlines. The scheduling ......
期刊： DISCRETE OPTIMIZATION, 2018; 27 ()
The quadratic minimum spanning tree problem and its variations such as the quadratic bottleneck spanning tree problem, the minimum spanning tree probl......
期刊： DISCRETE OPTIMIZATION, 2018; 28 ()
In a recent paper, Braun et al. (2014) have addressed a single-processor scheduling problem with time restrictions. Given a fixed integer B >= 2, t......
期刊： DISCRETE OPTIMIZATION, 2017; 23 ( )
In this paper, we consider the online strip packing problem, in which a list of online rectangles has to be packed without overlap or rotation into on......
期刊： DISCRETE OPTIMIZATION, 2017; 25 ( )
We consider the Pareto-scheduling with bi-criteria on a single machine in which each task has a positional due index. Two bi-criteria problems are con......
期刊： DISCRETE OPTIMIZATION, 2017; 25 ( )
The independent vertex edge domination number and the upper non-enclaving number of a graph G are denoted by i(ve)(G) and Psi(G), respectively. Boutri......
