| Publication | Date of Publication | Type |
|---|
Different Formulations for Solving the HeaviestK-Subgraph Problem
INFOR: Information Systems and Operational Research | 2023-05-05 | Paper |
Approximate And Exact Solution Methods For The Hyperbolic 0-1 Knapsack Problem
INFOR: Information Systems and Operational Research | 2023-04-24 | Paper |
Quantifying extinction probabilities of endangered species for phylogenetic conservation prioritization may not be as sensitive as might be feared
| 2022-03-23 | Paper |
Using a conic bundle method to accelerate both phases of a quadratic convex reformulation
INFORMS Journal on Computing | 2017-10-04 | Paper |
Optimal migration planning of telecommunication equipment
Advances in Intelligent Systems and Computing | 2017-09-12 | Paper |
A tabu search approach for the reconstruction of binary images without empty interior region
Mathematics for Application | 2017-07-05 | Paper |
Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
Mathematical Programming. Series A. Series B | 2016-08-25 | Paper |
Reconstruction of Bicolored Images
Lecture Notes in Computer Science | 2016-03-10 | Paper |
Mathematical optimization ideas for biodiversity conservation
European Journal of Operational Research | 2015-07-29 | Paper |
A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation
Journal of Combinatorial Optimization | 2014-07-11 | Paper |
2-stage robust MILP with continuous recourse variables
Discrete Applied Mathematics | 2014-05-06 | Paper |
Reconstructing convex matrices by integer programming approaches
Journal of Mathematical Modelling and Algorithms in Operations Research | 2013-12-20 | Paper |
An efficient compact quadratic convex reformulation for general integer quadratic programs
Computational Optimization and Applications | 2013-02-25 | Paper |
Using a mixed integer programming tool for solving the 0-1 quadratic knapsack problem
INFORMS Journal on Computing | 2012-06-08 | Paper |
Extending the QCR method to general mixed-integer programs
Mathematical Programming. Series A. Series B | 2012-02-22 | Paper |
Quadratic optimization in 0-1 variables
| 2011-03-09 | Paper |
Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem
Applied Mathematical Modelling | 2010-05-06 | Paper |
Optimal selection of forest patches using integer and fractional programming
Operational Research. An International Journal | 2010-05-03 | Paper |
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
Discrete Applied Mathematics | 2009-06-23 | Paper |
Linear Reformulations of Integer Quadratic Programs
Communications in Computer and Information Science | 2009-05-13 | Paper |
Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
RAIRO - Operations Research | 2008-11-19 | Paper |
A deterministic approximation algorithm for the densest \(k\)-subgraph problem
International Journal of Operational Research | 2008-05-27 | Paper |
Multiway cut and integer flow problems in trees
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
Mathematical Programming. Series A. Series B | 2007-03-05 | Paper |
Solution of a fractional combinatorial optimization problem by mixed integer programming
RAIRO - Operations Research | 2006-12-11 | Paper |
Minimising total average cycle stock subject to practical constraints
The Journal of the Operational Research Society | 2005-05-23 | Paper |
An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
European Journal of Operational Research | 2005-01-12 | Paper |
Designing radio-mobile access networks based on synchronous digital hierarchy rings
Computers \& Operations Research | 2004-11-12 | Paper |
Mixed integer programming for the 0--1 maximum probability model.
European Journal of Operational Research | 2004-03-15 | Paper |
Approximation algorithms for fractional knapsack problems
Operations Research Letters | 2003-04-02 | Paper |
Method for the analysis and design of class characteristic migrations during object system evolution
Information Systems | 2002-08-14 | Paper |
Best reduction of the quadratic semi-assignment problem
Discrete Applied Mathematics | 2002-06-17 | Paper |
Integer programming to schedule a hierarchical workforce with variable demands
European Journal of Operational Research | 2000-10-11 | Paper |
A new upper bound for the 0-1 quadratic knapsack problem
European Journal of Operational Research | 1999-11-08 | Paper |
A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem
Discrete Applied Mathematics | 1997-07-08 | Paper |
Linear programming for the \(0-1\) quadratic knapsack problem
European Journal of Operational Research | 1996-01-01 | Paper |
An algorithm for finding the \(K\)-best allocations of a tree structured program
Journal of Parallel and Distributed Computing | 1995-07-20 | Paper |
Minimization of a quadratic pseudo-Boolean function
European Journal of Operational Research | 1995-05-15 | Paper |
Solving the uncapacited plant location problem on trees
Discrete Applied Mathematics | 1995-03-01 | Paper |
An efficient algorithm for a task allocation problem
Journal of the ACM | 1994-08-21 | Paper |
Partitioning multiple-chain-like task across a host-satellite system
Information Processing Letters | 1994-02-24 | Paper |
Placement Des Taches D’Un Programme A Structure Arborescente Sur Un Reseau De Processeurs: Synthese De Resultats Recents
INFOR: Information Systems and Operational Research | 1994-01-01 | Paper |
An efficient algorithm for the 3-satisfiability problem
Operations Research Letters | 1993-01-16 | Paper |
Placement de tâches dans un système distribué et dualité lagrangienne
RAIRO - Operations Research | 1992-12-14 | Paper |
Persistency in quadratic 0-1 optimization
Mathematical Programming. Series A. Series B | 1992-09-26 | Paper |
Unconstrained 0-1 optimization and Lagrangean relaxation
Discrete Applied Mathematics | 1990-01-01 | Paper |
A decomposition method for minimizing quadratic pseudo-Boolean functions
Operations Research Letters | 1989-01-01 | Paper |
A comparison of three algorithms for reducing the profile of a sparse matrix
RAIRO - Operations Research | 1989-01-01 | Paper |
On interval graphs and matrice profiles
RAIRO - Operations Research | 1986-01-01 | Paper |
Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
Discrete Applied Mathematics | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3882469 (Why is no real title available?)
| 1984-01-01 | Paper |
Comparaison expérimentale d'algorithmes pour les problèmes de recouvrement et de maximisation d'une fonction pseudo-booléenne
RAIRO - Operations Research | 1983-01-01 | Paper |
Optimal implementation of selectors in a data-base
European Journal of Operational Research | 1982-01-01 | Paper |
Implémentation optimale d'une relation dans une base de données relationnelle par un système de projecteurs
RAIRO - Operations Research | 1982-01-01 | Paper |
Réductions et conditions d'optimalité dans le problème de l'ensemble stable de poids maximal
RAIRO - Operations Research | 1981-01-01 | Paper |
An upper bound on the size of the largest cliques in a graph
Journal of Graph Theory | 1981-01-01 | Paper |
Une nouvelle méthode pour le problème de partitionnement fondée sur une évaluation par excès de la solution
RAIRO - Operations Research | 1981-01-01 | Paper |
Modèle adaptant les politiques de personnel aux besoins prévisionnels
RAIRO - Operations Research | 1978-01-01 | Paper |
Brève communication. Transformation du problème de partitionnement en un problème d'ensemble stable de poids maximal
RAIRO - Operations Research | 1978-01-01 | Paper |
scientific article; zbMATH DE number 3570213 (Why is no real title available?)
| 1977-01-01 | Paper |
