Publication | Date of Publication | Type |
---|
Solving dynamic satellite image data downlink scheduling problem via an adaptive bi-objective optimization algorithm | 2023-11-13 | Paper |
A three-phase matheuristic algorithm for the multi-day task assignment problem | 2023-09-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q5888248 | 2023-04-24 | Paper |
Introduction to QUBO | 2022-11-15 | Paper |
Complexity and Polynomially Solvable Special Cases of QUBO | 2022-11-15 | Paper |
Mathematical Programming Models and Exact Algorithms | 2022-11-15 | Paper |
Fast Heuristics and Approximation Algorithms | 2022-11-15 | Paper |
The Bipartite QUBO | 2022-11-15 | Paper |
QUBO Software | 2022-11-15 | Paper |
The Rank-One Quadratic Assignment Problem | 2022-06-27 | Paper |
The bipartite Boolean quadric polytope | 2022-06-09 | Paper |
Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms | 2021-01-07 | Paper |
A class of exponential neighbourhoods for the quadratic travelling salesman problem | 2020-07-29 | Paper |
Combinatorial optimization with interaction costs: complexity and solvable cases | 2019-11-28 | Paper |
Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems | 2019-10-18 | Paper |
Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis | 2019-02-22 | Paper |
The generalized vertex cover problem and some variations | 2019-01-14 | Paper |
A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems | 2018-08-17 | Paper |
The quadratic minimum spanning tree problem and its variations | 2018-08-17 | Paper |
The Boolean quadratic programming problem with generalized upper bound constraints | 2018-07-11 | Paper |
Clustered maximum weight clique problem: algorithms and empirical analysis | 2018-07-11 | Paper |
Markov chain methods for the bipartite Boolean quadratic programming problem | 2018-05-29 | Paper |
A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions | 2018-05-24 | Paper |
A characterization of linearizable instances of the quadratic minimum spanning tree problem | 2018-03-01 | Paper |
The bilinear assignment problem: complexity and polynomially solvable special cases | 2017-12-01 | Paper |
On a linearization technique for solving the quadratic set covering problem and variations | 2017-11-09 | Paper |
Quadratic bottleneck knapsack problems | 2017-06-27 | Paper |
Experimental analysis of heuristics for the bottleneck traveling salesman problem | 2017-04-04 | Paper |
The minimum cost perfect matching problem with conflict pair constraints | 2016-11-14 | Paper |
The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis | 2016-11-10 | Paper |
The bipartite quadratic assignment problem and extensions | 2016-10-07 | Paper |
Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs | 2016-07-06 | Paper |
A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph | 2016-06-09 | Paper |
https://portal.mardi4nfdi.de/entity/Q5501313 | 2015-08-03 | Paper |
The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases | 2015-07-24 | Paper |
The quadratic balanced optimization problem | 2015-04-09 | Paper |
Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms | 2014-12-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q2865865 | 2013-12-11 | Paper |
Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs | 2013-08-16 | Paper |
Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem | 2012-12-28 | Paper |
Spanning cactus of a graph: Existence, extension, optimization, and approximation | 2012-11-22 | Paper |
Heuristic algorithms for the bipartite unconstrained 0-1 quadratic programming problem | 2012-10-13 | Paper |
The minimum spanning tree problem with conflict constraints and its variations | 2012-06-20 | Paper |
An O(n4) Algorithm for the QAP Linearization Problem | 2012-05-24 | Paper |
Three value TSP and linkages with the three value linear spanning 2-forests | 2012-03-19 | Paper |
Strong and weak edges of a graph and linkages with the vertex cover problem | 2012-03-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q2998795 | 2011-05-10 | Paper |
Quadratic bottleneck problems | 2011-04-14 | Paper |
On generalized balanced optimization problems | 2011-03-02 | Paper |
The balanced traveling salesman problem | 2010-12-23 | Paper |
SC-Hamiltonicity and Its Linkages with Strong Hamiltonicity of a Graph | 2010-12-03 | Paper |
SC-Hamiltonian graphs and digraphs: new necessary conditions and their impacts | 2010-10-19 | Paper |
A simplex algorithm for network flow problems with piecewise linear fractional objective function | 2010-09-22 | Paper |
On the Approximability of the Vertex Cover and Related Problems | 2010-07-20 | Paper |
Bottleneck flows in unit capacity networks | 2010-06-16 | Paper |
The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm | 2010-06-11 | Paper |
An efficient heuristic algorithm for the bottleneck traveling salesman problem | 2010-03-15 | Paper |
The bottleneck \(k\)-MST | 2009-12-04 | Paper |
Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem | 2009-11-23 | Paper |
Integer Programming: Optimization and Evaluation Are Equivalent | 2009-10-20 | Paper |
An edge-reduction algorithm for the vertex cover problem | 2009-08-14 | Paper |
A strongly polynomial simplex method for the linear fractional assignment problem | 2009-03-04 | Paper |
Very large-scale variable neighborhood search for the generalized assignment problem | 2009-02-24 | Paper |
Anti-stalling Pivot Rule for Linear Programs with Totally Unimodular Coefficient Matrix | 2008-12-01 | Paper |
VLSN search algorithms for partitioning problems using matching neighbourhoods | 2008-07-29 | Paper |
Minmax strongly connected subgraphs with node penalties | 2008-07-01 | Paper |
On linear multiplicative programming. | 2008-01-25 | Paper |
On cost matrices with two and three distinct values of Hamiltonian paths and cycles | 2007-11-16 | Paper |
Learning multicriteria fuzzy classification method PROAFTN from data | 2007-02-19 | Paper |
A simplex algorithm for piecewise-linear fractional programming problems | 2007-01-22 | Paper |
Variations of the prize‐collecting Steiner tree problem | 2006-09-12 | Paper |
Approximate Local Search in Combinatorial Optimization | 2005-02-21 | Paper |
Lexicographic balanced optimization problems | 2004-07-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4461903 | 2004-05-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q4461917 | 2004-05-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q4461918 | 2004-05-18 | Paper |
On bottleneck assignment problems under categorization. | 2004-02-14 | Paper |
Weighted graphs with all Hamiltonian cycles of the same length | 2003-09-25 | Paper |
Improved estimators for the selected location parameters | 2003-08-31 | Paper |
TSP heuristics: domination analysis and complexity | 2003-06-02 | Paper |
A survey of very large-scale neighborhood search techniques | 2002-09-17 | Paper |
Domination analysis of some heuristics for the traveling salesman problem | 2002-06-24 | Paper |
On the nature of the binomial distribution | 2002-06-23 | Paper |
The traveling salesman problem: new polynomial approximation algorithms and domination analysis | 2001-01-01 | Paper |
Constrained balanced optimization problems | 2000-01-20 | Paper |
Multiple bottleneck assignment problem | 1999-11-08 | Paper |
An \(O(m\log n)\) algorithm for the max+sum spanning tree problem | 1999-05-05 | Paper |
Optimal expansion of capacitated transshipment networks | 1998-10-07 | Paper |
Minmax combinatorial optimization | 1998-08-16 | Paper |
Minimum dispersion problems | 1998-03-04 | Paper |
On locating a single path-like facility in a general graph | 1997-10-05 | Paper |
The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms | 1997-08-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q4896283 | 1997-02-11 | Paper |
Constrained matroidal bottleneck problems | 1996-09-29 | Paper |
On \(k\)-sum optimization | 1996-08-01 | Paper |
An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem | 1996-07-24 | Paper |
A fast algorithm for a class of bottleneck problems | 1996-07-02 | Paper |
Generalized Bottleneck Problems∗ | 1996-06-23 | Paper |
Minmax linear knapsack problem with grouped variables and gub | 1995-08-17 | Paper |
Polynomial Algorithms for a Class of Discrete Minmax Linear Programming Problems | 1995-07-24 | Paper |
A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem | 1995-06-12 | Paper |
A Tabu Search Algorithm for the Resource-Constrained Assignment Problem | 1995-05-28 | Paper |
Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem | 1994-11-08 | Paper |
On combined minmax-minsum optimization | 1994-09-13 | Paper |
Erratum on: Travelling salesman problem under categorization | 1994-03-24 | Paper |
Categorized Assignment Scheduling: a Tabu Search Approach | 1994-01-02 | Paper |
Group centre and group median of a tree | 1993-06-29 | Paper |
Minimum perfect bipartite matchings and spanning trees under categorization | 1993-01-17 | Paper |
Traveling salesman problem under categorization | 1993-01-16 | Paper |
K-Sum Linear Programming | 1993-01-16 | Paper |
A linear time algorithm for the maximum capacity path problem | 1991-01-01 | Paper |
k-sum optimization problems | 1990-01-01 | Paper |
Minmax linear programmes with grouped variables | 1989-01-01 | Paper |
Group centre and group median of a network | 1989-01-01 | Paper |
Minimum deviation problems | 1988-01-01 | Paper |