| Publication | Date of Publication | Type |
|---|
Algorithms for a two-machine no-wait flow shop scheduling problem with two competing agents
Journal of Combinatorial Optimization | 2024-10-21 | Paper |
Approximation algorithms and a hardness result for the three-machine proportionate mixed shop
Algorithmic Aspects in Information and Management | 2023-10-16 | Paper |
A local search 4/3-approximation algorithm for the minimum 3-path partition problem
Journal of Combinatorial Optimization | 2022-10-31 | Paper |
Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph
Journal of Combinatorial Optimization | 2022-04-13 | Paper |
Improved approximation algorithms for two-stage flexible flow shop scheduling
Journal of Combinatorial Optimization | 2021-05-11 | Paper |
Approximation algorithms for the three-machine proportionate mixed shop scheduling
Theoretical Computer Science | 2019-12-27 | Paper |
A local search \(4/3\)-approximation algorithm for the minimum 3-path partition problem
| 2019-10-11 | Paper |
Online scheduling with unit processing times and processing set restrictions
Journal of the Operations Research Society of China | 2019-10-04 | Paper |
Approximation algorithms for two-machine flow-shop scheduling with a conflict graph
| 2018-10-04 | Paper |
Capacity inverse minimum cost flow problems under the weighted Hamming distance
Optimization Letters | 2016-09-21 | Paper |
Competitive ratios for preemptive and non-preemptive online scheduling with nondecreasing concave machine cost
Information Sciences | 2016-07-08 | Paper |
scientific article; zbMATH DE number 6535313 (Why is no real title available?)
| 2016-01-25 | Paper |
Inverse maximum flow problems under the combining norms
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2014-04-03 | Paper |
Minimizing the maximum bump cost in linear extensions of a poset
Journal of Combinatorial Optimization | 2013-12-02 | Paper |
Weighted inverse maximum perfect matching problems under the Hamming distance
Journal of Global Optimization | 2013-04-08 | Paper |
Weighted inverse minimum cut problem under the sum-type Hamming distance
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management | 2012-07-16 | Paper |
Minimizing the sum cost in linear extensions of a poset
Journal of Combinatorial Optimization | 2011-03-17 | Paper |
A polynomially solvable case of optimal linear extension problem of a poset
Journal of Combinatorial Optimization | 2010-12-21 | Paper |
Inverse minimum cost flow problems under the weighted Hamming distance
European Journal of Operational Research | 2010-09-09 | Paper |
Constrained inverse min-max spanning tree problems under the weighted Hamming distance
Journal of Global Optimization | 2009-07-13 | Paper |
Inverse Min-Max Spanning Tree Problem Under the Weighted Sum-Type Hamming Distance
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies | 2009-03-03 | Paper |
Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
Theoretical Computer Science | 2008-05-28 | Paper |
A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE
Asia-Pacific Journal of Operational Research | 2008-05-20 | Paper |
Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values
Progress in Natural Science | 2007-10-26 | Paper |
Inverse maximum flow problems under the weighted Hamming distance
Journal of Combinatorial Optimization | 2007-10-12 | Paper |
