| Publication | Date of Publication | Type |
|---|
An algorithm for clustering with confidence-based must-link and cannot-link constraints
INFORMS Journal on Computing | 2025-11-19 | Paper |
Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques
Networks | 2025-01-08 | Paper |
Algorithms and Complexities of Matching Variants in Covariate Balancing
Operations Research | 2024-03-12 | Paper |
Applications and efficient algorithms for integer programming problems on monotone constraints
Networks | 2023-12-11 | Paper |
Obituary for Professor Emeritus Jakob Kraurp
European Journal of Operational Research | 2023-07-11 | Paper |
Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem
Journal of Combinatorial Optimization | 2022-10-04 | Paper |
HNCcorr: combinatorial optimization for neuron identification
Annals of Operations Research | 2022-07-26 | Paper |
A unified approach for a 1D generalized total variation problem
Mathematical Programming. Series A. Series B | 2022-06-29 | Paper |
Network flow methods for the minimum covariate imbalance problem
European Journal of Operational Research | 2022-03-18 | Paper |
Complexity, algorithms and applications of the integer network flow with fractional supplies problem
Operations Research Letters | 2021-12-13 | Paper |
A fully polynomial time approximation scheme for the replenishment storage problem
Operations Research Letters | 2021-04-07 | Paper |
Adjacency-clustering and its application for yield prediction in integrated circuit manufacturing
Operations Research | 2020-11-08 | Paper |
The replenishment schedule to minimize peak storage problem: the gap between the continuous and discrete versions of the problem
Operations Research | 2020-10-26 | Paper |
An optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals
Theory of Computing Systems | 2020-06-02 | Paper |
Approximation algorithms for connected maximum coverage problem for the discovery of mutated driver pathways in cancer
Information Processing Letters | 2020-04-03 | Paper |
Erratum to: ``A faster algorithm solving a generalization of isotonic median regression and a class of fused Lasso problems
SIAM Journal on Optimization | 2020-04-01 | Paper |
| Isolation branching: a branch and bound algorithm for the k-terminal cut problem | 2019-10-11 | Paper |
Algorithms and complexity of range clustering
Networks | 2019-03-19 | Paper |
DISPATCH: an optimally-competitive algorithm for maximum online perfect bipartite matching with i.i.d. arrivals
(available as arXiv preprint) | 2019-01-15 | Paper |
Complexity and approximations for submodular minimization problems on two variables per inequality constraints
Discrete Applied Mathematics | 2018-10-26 | Paper |
Weighted matching with pair restrictions
Optimization Letters | 2018-05-28 | Paper |
Security routing games with multivehicle Chinese postman problem
Networks | 2018-05-23 | Paper |
A faster algorithm solving a generalization of isotonic median regression and a class of fused Lasso problems
SIAM Journal on Optimization | 2018-01-10 | Paper |
Range contracts: risk sharing and beyond
European Journal of Operational Research | 2016-10-06 | Paper |
An \(O(\log k)\) approximation algorithm for the \(k\) minimum spanning tree problem in the plane
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Approximation algorithms for a minimization variant of the order-preserving submatrices and for biclustering problems
ACM Transactions on Algorithms | 2014-12-05 | Paper |
Evaluating performance of image segmentation criteria and techniques
EURO Journal on Computational Optimization | 2014-09-30 | Paper |
Experimental analysis of the MRF algorithm for segmentation of noisy medical images
Algorithmic Operations Research | 2013-12-11 | Paper |
Multi-label Markov random fields as an efficient and effective tool for image segmentation, total variations and regularization
Numerical Mathematics: Theory, Methods and Applications | 2013-11-19 | Paper |
Simplifications and speedups of the pseudoflow algorithm
Networks | 2013-08-06 | Paper |
A polynomial time algorithm for Rayleigh ratio on discrete variables: replacing spectral techniques for expander ratio, normalized cut, and Cheeger constant
Operations Research | 2013-07-02 | Paper |
The bounded cycle-cover problem
INFORMS Journal on Computing | 2012-05-30 | Paper |
Rating customers according to their promptness to adopt new products
Operations Research | 2012-03-26 | Paper |
Solving the convex cost integer dual network flow problem
Management Science | 2012-02-19 | Paper |
Capacity acquisition, subcontracting, and lot sizing
Management Science | 2012-02-19 | Paper |
Nuclear threat detection with mobile distributed sensor networks
Annals of Operations Research | 2011-11-17 | Paper |
Complexity of some inverse shortest path lengths problems
Networks | 2010-11-24 | Paper |
How to allocate review tasks for robust ranking
Acta Informatica | 2010-10-08 | Paper |
A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem
Operations Research | 2010-03-06 | Paper |
Covering the edges of bipartite graphs using \(K_{2,2}\) graphs
Theoretical Computer Science | 2009-12-01 | Paper |
The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
Operations Research | 2009-08-13 | Paper |
TECHNICAL NOTE—Solving Linear Cost Dynamic Lot-Sizing Problems in O(n log n) Time
Operations Research | 2009-08-13 | Paper |
The multi‐integer set cover and the facility terminal cover problem
Networks | 2009-07-28 | Paper |
Efficient Algorithms for the Inverse Spanning-Tree Problem
Operations Research | 2009-07-09 | Paper |
Country credit-risk rating aggregation via the separation-deviation model†
Optimization Methods & Software | 2009-02-23 | Paper |
Dynamic evolution of economically preferred facilities
European Journal of Operational Research | 2008-11-18 | Paper |
The inequality-satisfiability problem
Operations Research Letters | 2008-08-06 | Paper |
Complexity and algorithms for nonlinear optimization problems
Annals of Operations Research | 2008-03-31 | Paper |
The k-Allocation Problem and Its Variants
Approximation and Online Algorithms | 2008-02-21 | Paper |
Covering the Edges of Bipartite Graphs Using K 2,2 Graphs
Approximation and Online Algorithms | 2008-02-20 | Paper |
An efficient algorithm for image segmentation, Markov random fields and related problems
Journal of the ACM | 2008-02-11 | Paper |
Optimizing over Consecutive 1's and Circular 1's Constraints
SIAM Journal on Optimization | 2007-05-22 | Paper |
Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms
Discrete Optimization | 2007-02-20 | Paper |
Complexity and algorithms for convex network optimization and other nonlinear problems
4OR | 2006-03-09 | Paper |
A cut-based algorithm for the nonlinear dual of the minimum cost network flow problem
Algorithmica | 2004-12-13 | Paper |
Monotonizing linear programs with up to two nonzeroes per column
Operations Research Letters | 2004-07-01 | Paper |
Minimizing a Convex Cost Closure Set
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
The SONET edge‐partition problem
Networks | 2003-03-10 | Paper |
Minimax problems with bitonic matrices
Networks | 2002-12-17 | Paper |
A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
Networks | 2002-07-30 | Paper |
Solving integer programs over monotone inequalities in three variables: A framework for half integrality and good approximations
European Journal of Operational Research | 2002-05-28 | Paper |
| scientific article; zbMATH DE number 1670524 (Why is no real title available?) | 2002-01-14 | Paper |
| scientific article; zbMATH DE number 1670664 (Why is no real title available?) | 2001-12-18 | Paper |
Approximating a generalization of MAX 2SAT and MIN 2SAT
Discrete Applied Mathematics | 2001-10-30 | Paper |
A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine
Operations Research Letters | 2001-04-19 | Paper |
| scientific article; zbMATH DE number 1323125 (Why is no real title available?) | 2000-06-27 | Paper |
A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs
Operations Research Letters | 1999-09-23 | Paper |
| scientific article; zbMATH DE number 1342118 (Why is no real title available?) | 1999-09-22 | Paper |
Generalized \(p\)-center problems: Complexity results and approximation algorithms
European Journal of Operational Research | 1999-08-24 | Paper |
A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources
Operations Research Letters | 1999-01-01 | Paper |
Approximating Clique and Biclique Problems
Journal of Algorithms | 1998-11-11 | Paper |
Scheduling Semiconductor Burn-In Operations to Minimize Total Flowtime
Operations Research | 1998-09-20 | Paper |
| scientific article; zbMATH DE number 1187162 (Why is no real title available?) | 1998-08-10 | Paper |
| scientific article; zbMATH DE number 1182766 (Why is no real title available?) | 1998-08-02 | Paper |
| scientific article; zbMATH DE number 1182765 (Why is no real title available?) | 1998-08-02 | Paper |
\(k\)-edge subgraph problems
Discrete Applied Mathematics | 1997-09-07 | Paper |
| scientific article; zbMATH DE number 1034105 (Why is no real title available?) | 1997-07-15 | Paper |
An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane
Algorithmica | 1997-05-29 | Paper |
Scheduling with batching: Two job types
Discrete Applied Mathematics | 1997-04-21 | Paper |
Approximation Algorithms for the k-Clique Covering Problem
SIAM Journal on Discrete Mathematics | 1997-02-26 | Paper |
On the Complexity of the Production-Transportation Problem
SIAM Journal on Optimization | 1996-05-13 | Paper |
About strongly polynomial time algorithms for quadratic optimization over submodular constraints
Mathematical Programming. Series A. Series B | 1996-04-10 | Paper |
A nonlinear knapsack problem
Operations Research Letters | 1996-01-16 | Paper |
Approximation Algorithms for Network Design Problems on Bounded Subsets
Journal of Algorithms | 1996-01-01 | Paper |
Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
Mathematics of Operations Research | 1995-09-14 | Paper |
Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
SIAM Journal on Computing | 1995-04-06 | Paper |
Scheduling with batching: Minimizing the weighted number of tardy jobs
Operations Research Letters | 1995-01-11 | Paper |
Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
Mathematics of Operations Research | 1994-12-12 | Paper |
A modified greedy heuristic for the set covering problem with improved worst case bound
Information Processing Letters | 1994-09-25 | Paper |
A Polynomial Algorithm for the k-cut Problem for Fixed k
Mathematics of Operations Research | 1994-05-18 | Paper |
The empirical performance of a polynomial algorithm for constrained nonlinear optimization
Annals of Operations Research | 1994-01-06 | Paper |
Why should biconnected components be identified first
Discrete Applied Mathematics | 1993-06-29 | Paper |
The multicovering problem
European Journal of Operational Research | 1993-04-01 | Paper |
A polynomial algorithm for an integer quadratic non-separable transportation problem
Mathematical Programming. Series A. Series B | 1993-01-16 | Paper |
An Exact Sublinear Algorithm for the Max-Flow, Vertex Disjoint Paths and Communication Problems on Random Graphs
Operations Research | 1993-01-05 | Paper |
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
Mathematical Programming. Series A. Series B | 1993-01-01 | Paper |
Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
Operations Research | 1992-06-26 | Paper |
Asymptotically Optimal Linear Algorithm for the Minimum k-Cut in a Random Graph
SIAM Journal on Discrete Mathematics | 1992-06-25 | Paper |
A Fast Perfect-Matching Algorithm in Random Graphs
SIAM Journal on Discrete Mathematics | 1990-01-01 | Paper |
Minimizing the number of tardy job units under release time constraints
Discrete Applied Mathematics | 1990-01-01 | Paper |
Convex separable optimization is not much harder than linear optimization
Journal of the ACM | 1990-01-01 | Paper |
Analysis of a flow problem with fixed charges
Networks | 1989-01-01 | Paper |
An \(O(n \log^ 2\,n)\) algorithm for the maximum weighted tardiness problem
Information Processing Letters | 1989-01-01 | Paper |
An algorithm for the detection and construction of Monge sequences
Linear Algebra and its Applications | 1989-01-01 | Paper |
A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
SIAM Journal on Computing | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4087453 (Why is no real title available?) | 1988-01-01 | Paper |
Fast approximation algorithms for a nonconvex covering problem
Journal of Algorithms | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4011924 (Why is no real title available?) | 1986-01-01 | Paper |
OR Practice—Lagrangian Relaxation for Testing Infeasibility in VLSI Routing
Operations Research | 1986-01-01 | Paper |
A Packing Problem You Can Almost Solve by Sitting on Your Suitcase
SIAM Journal on Algebraic Discrete Methods | 1986-01-01 | Paper |
A fast approximation algorithm for the multicovering problem
Discrete Applied Mathematics | 1986-01-01 | Paper |
A better than “best possible” algorithm to edge color multigraphs
Journal of Algorithms | 1986-01-01 | Paper |
Best possible heuristics for the bottleneck wandering salesperson and bottleneck vehicle routing problem
European Journal of Operational Research | 1986-01-01 | Paper |
The linzertorte problem, or a unified approach to painting, baking and weaving
Discrete Applied Mathematics | 1986-01-01 | Paper |
A Best Possible Heuristic for the k-Center Problem
Mathematics of Operations Research | 1985-01-01 | Paper |
Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM | 1985-01-01 | Paper |
An $O ( | V |^2 )$ Algorithm for the Planar 3-Cut Problem
SIAM Journal on Algebraic Discrete Methods | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3896296 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 4099005 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3888915 (Why is no real title available?) | 1984-01-01 | Paper |
Efficient bounds for the stable set, vertex cover and set packing problems
Discrete Applied Mathematics | 1983-01-01 | Paper |
On the Fractional Solution to the Set Covering Problem
SIAM Journal on Algebraic Discrete Methods | 1983-01-01 | Paper |
Approximation Algorithms for the Set Covering and Vertex Cover Problems
SIAM Journal on Computing | 1982-01-01 | Paper |
Heuristics for the fixed cost median problem
Mathematical Programming | 1982-01-01 | Paper |
Steinhaus's geometric location problem for random samples in the plane
Advances in Applied Probability | 1982-01-01 | Paper |
Database Location in Computer Networks
Journal of the ACM | 1980-01-01 | Paper |
Probabilistic Analysis of the Planar k-Median Problem
Mathematics of Operations Research | 1980-01-01 | Paper |
