Publication | Date of Publication | Type |
---|
An exact algorithm for the preemptive single machine scheduling of equal-length jobs | 2022-06-22 | Paper |
Conditional Markov Chain search for the simple plant location problem improves upper bounds on twelve Körkel-Ghosh instances | 2019-07-25 | Paper |
Linear assignment problems in combinatorial optimization | 2018-10-22 | Paper |
The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems | 2017-08-24 | Paper |
A Pseudo-Boolean Approach to the Market Graph Analysis by Means of the p-Median Model | 2017-06-26 | Paper |
Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem | 2016-09-13 | Paper |
Lower and Upper Bounds for the Preemptive Single Machine Scheduling Problem with Equal Processing Times | 2016-09-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q3178057 | 2016-07-08 | Paper |
Preemptive scheduling in a two-stage supply chain to minimize the makespan | 2015-12-28 | Paper |
Cell formation in industrial engineering. Theory, algorithms and experiments | 2015-09-28 | Paper |
Data aggregation for \(p\)-median problems | 2015-08-24 | Paper |
A tolerance-based heuristic approach for the weighted independent set problem | 2015-02-16 | Paper |
Pareto-optimal front of cell formation problem in group technology | 2015-01-16 | Paper |
Online heuristic for the preemptive single machine scheduling problem of minimizing the total weighted completion time | 2014-10-29 | Paper |
Improvements to MCS algorithm for the maximum clique problem | 2014-04-08 | Paper |
https://portal.mardi4nfdi.de/entity/Q2867325 | 2013-12-11 | Paper |
Efficient computation of tolerances in the weighted independent set problem for trees | 2013-11-11 | Paper |
An exact model for cell formation in group technology | 2013-10-21 | Paper |
Flexible PMP Approach for Large-Size Cell Formation | 2013-01-30 | Paper |
Global tolerances in the problems of combinatorial optimization with an additive objective function | 2013-01-14 | Paper |
Lower tolerance-based branch and bound algorithms for the ATSP | 2012-11-15 | Paper |
Extremal values of global tolerances in combinatorial optimization with an additive objective function | 2012-09-27 | Paper |
Data Correcting Approaches in Combinatorial Optimization | 2012-09-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q3117085 | 2012-02-16 | Paper |
A Computational Study of the Pseudo-Boolean Approach to the p-Median Problem Applied to Cell Formation | 2011-09-09 | Paper |
Complexity evaluation of benchmark instances for the \(p\)-median problem | 2011-08-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q3084797 | 2011-03-25 | Paper |
Towards Cellular Automata Football Models with Mentality Accounting | 2010-10-04 | Paper |
Equivalent instances of the simple plant location problem | 2010-05-16 | Paper |
Maximization of submodular functions: theory and enumeration algorithms | 2009-06-30 | Paper |
Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems | 2009-03-31 | Paper |
Tolerance-based Algorithms for the Traveling Salesman Problem | 2008-12-01 | Paper |
Game ‘Life’ with Anticipation Property | 2008-11-27 | Paper |
Tolerance-based branch and bound algorithms for the ATSP | 2008-04-24 | Paper |
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP | 2008-04-17 | Paper |
Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP | 2008-04-15 | Paper |
Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems | 2008-02-21 | Paper |
Some Basics on Tolerances | 2008-01-04 | Paper |
Optimal Order Allocation with Discount Pricing | 2008-01-04 | Paper |
Iterative patching and the asymmetric traveling salesman problem | 2006-06-30 | Paper |
The isometries of the cut, metric and hypermetric cones | 2006-06-26 | Paper |
Graph-Theoretic Concepts in Computer Science | 2005-12-08 | Paper |
Experimental and Efficient Algorithms | 2005-11-30 | Paper |
A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem | 2005-10-18 | Paper |
Data Correcting Algorithms in Combinatorial Optimization | 2005-09-28 | Paper |
Branch and peg algorithms for the simple plant location problem | 2005-02-23 | Paper |
Branch and peg algorithms for the simple plant location problem. | 2004-02-14 | Paper |
Solving the simple plant location problem using a data correcting approach | 2003-10-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q4425659 | 2003-09-11 | Paper |
https://portal.mardi4nfdi.de/entity/Q4785575 | 2003-01-05 | Paper |
The Data-Correcting Algorithm for the Minimization of Supermodular Functions | 2000-10-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q3815874 | 1987-01-01 | Paper |
Decomposition of the location problem | 1986-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3776515 | 1986-01-01 | Paper |
A correcting algorithm for solving allocation type problems | 1984-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3722253 | 1984-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3219034 | 1983-01-01 | Paper |
Optimization of parametric series with allowance for cost of obtaining information | 1982-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3664833 | 1982-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3690583 | 1982-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3898346 | 1979-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3880598 | 1977-01-01 | Paper |