| Publication | Date of Publication | Type |
|---|
Replication and sequencing of unreliable jobs on m parallel machines: new results
Computers & Operations Research | 2025-12-02 | Paper |
Solving crop planning and rotation problems in a sustainable agriculture perspective
Computers & Operations Research | 2023-09-13 | Paper |
Mathematical programming formulations and metaheuristics for biological sample transportation problems in healthcare
Computers & Operations Research | 2022-09-27 | Paper |
Replication and sequencing of unreliable jobs on parallel machines
Computers & Operations Research | 2022-03-09 | Paper |
A new upper bound for the multiple knapsack problem
Computers & Operations Research | 2022-03-07 | Paper |
| A MILP model for biological sample transportation in healthcare | 2020-12-15 | Paper |
A new upper bound for the multiple knapsack problem
(available as arXiv preprint) | 2020-10-08 | Paper |
Robust single machine scheduling with a flexible maintenance activity
Computers & Operations Research | 2019-04-18 | Paper |
Scheduling nonpreemptive jobs on parallel machines subject to exponential unrecoverable interruptions
Computers & Operations Research | 2018-07-11 | Paper |
Optimal radio resources and transmission formats assignment in OFDMA systems
Computers & Operations Research | 2016-11-10 | Paper |
A lower bound on the Hamiltonian path completion number of a line graph
Applied Mathematics and Computation | 2016-01-18 | Paper |
Solving graph partitioning problems arising in tagless cache management
Lecture Notes in Computer Science | 2015-10-16 | Paper |
| On the Sequential Multiknapsack polytope | 2014-06-12 | Paper |
The list scheduling algorithm for scheduling unreliable jobs on two parallel machines
Discrete Applied Mathematics | 2014-05-05 | Paper |
Optimal power control in OFDMA cellular networks
Networks | 2011-06-22 | Paper |
A polynomial algorithm for the multiple knapsack problem with divisible item sizes
Information Processing Letters | 2010-08-16 | Paper |
Sequencing unreliable jobs on parallel machines
Journal of Scheduling | 2009-08-28 | Paper |
Algorithms for multiprocessor scheduling with two job lengths and allocation restrictions
Journal of Scheduling | 2009-08-28 | Paper |
Optimal packet-to-slot assignment in mobile telecommunications
Operations Research Letters | 2009-08-14 | Paper |
Radio resource allocation problems for OFDMA cellular systems
Computers & Operations Research | 2008-12-17 | Paper |
A bi-objective coordination setup problem in a two-stage production system
European Journal of Operational Research | 2008-04-24 | Paper |
Packet scheduling in third-generation mobile systems with UTRA-TDD air interface
Annals of Operations Research | 2008-03-31 | Paper |
Local search algorithms for finding the Hamiltonian completion number of line graphs
Annals of Operations Research | 2008-01-25 | Paper |
Minimum Dominating Trail Set for Two-Terminal Series Parallel Graphs
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems
Journal of Scheduling | 2007-05-15 | Paper |
| scientific article; zbMATH DE number 2230240 (Why is no real title available?) | 2005-11-18 | Paper |
Process selection and sequencing in a two-agents production system
4OR | 2004-06-11 | Paper |
A linear algorithm for the Hamiltonian completion number of the line graph of a cactus.
Discrete Applied Mathematics | 2004-03-14 | Paper |
On dual based lower bounds for the sequential ordering problem with precedences and due dates
Annals of Operations Research | 2004-01-06 | Paper |
A branch and bound algorithm for the minimum storage-time sequencing problem
Naval Research Logistics | 2003-11-10 | Paper |
| scientific article; zbMATH DE number 1846736 (Why is no real title available?) | 2002-12-17 | Paper |
A linear algorithm for the Hamiltonian completion number of the line graph of a tree
Information Processing Letters | 2002-07-14 | Paper |
Set-up coordination between two stages of a supply chain
Annals of Operations Research | 2002-06-09 | Paper |
