| Publication | Date of Publication | Type |
|---|
| Different Formulations for Solving the HeaviestK-Subgraph Problem | 2023-05-05 | Paper |
| Approximate And Exact Solution Methods For The Hyperbolic 0-1 Knapsack Problem | 2023-04-24 | Paper |
| Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation | 2017-10-04 | Paper |
| Optimal Migration Planning of Telecommunication Equipment | 2017-09-12 | Paper |
| A tabu search approach for the reconstruction of binary images without empty interior region | 2017-07-05 | Paper |
| Exact quadratic convex reformulations of mixed-integer quadratically constrained problems | 2016-08-25 | Paper |
| Reconstruction of Bicolored Images | 2016-03-10 | Paper |
| Mathematical optimization ideas for biodiversity conservation | 2015-07-29 | Paper |
| A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation | 2014-07-11 | Paper |
| 2-stage robust MILP with continuous recourse variables | 2014-05-06 | Paper |
| Reconstructing convex matrices by integer programming approaches | 2013-12-20 | Paper |
| An efficient compact quadratic convex reformulation for general integer quadratic programs | 2013-02-25 | Paper |
| Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem | 2012-06-08 | Paper |
| Extending the QCR method to general mixed-integer programs | 2012-02-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3081839 | 2011-03-09 | Paper |
| Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem | 2010-05-06 | Paper |
| Optimal selection of forest patches using integer and fractional programming | 2010-05-03 | Paper |
| Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method | 2009-06-23 | Paper |
| Linear Reformulations of Integer Quadratic Programs | 2009-05-13 | Paper |
| Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations | 2008-11-19 | Paper |
| A deterministic approximation algorithm for the densest \(k\)-subgraph problem | 2008-05-27 | Paper |
| Multiway cut and integer flow problems in trees | 2007-05-29 | Paper |
| Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem | 2007-03-05 | Paper |
| Solution of a fractional combinatorial optimization problem by mixed integer programming | 2006-12-11 | Paper |
| Minimising total average cycle stock subject to practical constraints | 2005-05-23 | Paper |
| An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem | 2005-01-12 | Paper |
| Designing radio-mobile access networks based on synchronous digital hierarchy rings | 2004-11-12 | Paper |
| Mixed integer programming for the 0--1 maximum probability model. | 2004-03-15 | Paper |
| Approximation algorithms for fractional knapsack problems | 2003-04-02 | Paper |
| Method for the analysis and design of class characteristic migrations during object system evolution | 2002-08-14 | Paper |
| Best reduction of the quadratic semi-assignment problem | 2002-06-17 | Paper |
| Integer programming to schedule a hierarchical workforce with variable demands | 2000-10-11 | Paper |
| A new upper bound for the 0-1 quadratic knapsack problem | 1999-11-08 | Paper |
| A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem | 1997-07-08 | Paper |
| Linear programming for the \(0-1\) quadratic knapsack problem | 1996-01-01 | Paper |
| An algorithm for finding the \(K\)-best allocations of a tree structured program | 1995-07-20 | Paper |
| Minimization of a quadratic pseudo-Boolean function | 1995-05-15 | Paper |
| Solving the uncapacited plant location problem on trees | 1995-03-01 | Paper |
| An efficient algorithm for a task allocation problem | 1994-08-21 | Paper |
| Partitioning multiple-chain-like task across a host-satellite system | 1994-02-24 | Paper |
| Placement Des Taches D’Un Programme A Structure Arborescente Sur Un Reseau De Processeurs: Synthese De Resultats Recents | 1994-01-01 | Paper |
| An efficient algorithm for the 3-satisfiability problem | 1993-01-16 | Paper |
| Placement de tâches dans un système distribué et dualité lagrangienne | 1992-12-14 | Paper |
| Persistency in quadratic 0-1 optimization | 1992-09-26 | Paper |
| Unconstrained 0-1 optimization and Lagrangean relaxation | 1990-01-01 | Paper |
| A decomposition method for minimizing quadratic pseudo-Boolean functions | 1989-01-01 | Paper |
| A comparison of three algorithms for reducing the profile of a sparse matrix | 1989-01-01 | Paper |
| On interval graphs and matrice profiles | 1986-01-01 | Paper |
| Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3216685 | 1984-01-01 | Paper |
| Comparaison expérimentale d'algorithmes pour les problèmes de recouvrement et de maximisation d'une fonction pseudo-booléenne | 1983-01-01 | Paper |
| Optimal implementation of selectors in a data-base | 1982-01-01 | Paper |
| Implémentation optimale d'une relation dans une base de données relationnelle par un système de projecteurs | 1982-01-01 | Paper |
| Une nouvelle méthode pour le problème de partitionnement fondée sur une évaluation par excès de la solution | 1981-01-01 | Paper |
| Réductions et conditions d'optimalité dans le problème de l'ensemble stable de poids maximal | 1981-01-01 | Paper |
| An upper bound on the size of the largest cliques in a graph | 1981-01-01 | Paper |
| Modèle adaptant les politiques de personnel aux besoins prévisionnels | 1978-01-01 | Paper |
| Brève communication. Transformation du problème de partitionnement en un problème d'ensemble stable de poids maximal | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4140759 | 1977-01-01 | Paper |
