Results 1  10
of
359
Shape matching and object recognition using low distortion correspondence
 In CVPR
, 2005
"... We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up correspondence as an integer quadratic programming problem, where the cost function has terms based on similarity of correspond ..."
Abstract

Cited by 419 (15 self)
 Add to MetaCart
We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up correspondence as an integer quadratic programming problem, where the cost function has terms based on similarity
Robust discrete optimization and network flows
 Mathematical Programming Series B
, 2003
"... We propose an approach to address data uncertainty for discrete optimization and network flow problems that allows controlling the degree of conservatism of the solution, and is computationally tractable both practically and theoretically. In particular, when both the cost coefficients and the data ..."
Abstract

Cited by 194 (27 self)
 Add to MetaCart
in the constraints of an integer programming problem are subject to uncertainty, we propose a robust integer programming problem of moderately larger size that allows controlling the degree of conservatism of the solution in terms of probabilistic bounds on constraint violation. When only the cost coefficients
An Integer Programming Approach for Linear Programs with Probabilistic Constraints
, 2008
"... Linear programs with joint probabilistic constraints (PCLP) are difficult to solve because the feasible region is not convex. We consider a special case of PCLP in which only the righthand side is random and this random vector has a finite distribution. We give a mixedinteger programming formulati ..."
Abstract

Cited by 43 (8 self)
 Add to MetaCart
Linear programs with joint probabilistic constraints (PCLP) are difficult to solve because the feasible region is not convex. We consider a special case of PCLP in which only the righthand side is random and this random vector has a finite distribution. We give a mixedinteger programming
An Integer Programming Approach to Temporal Pattern Matching Queries
"... Abstract—Around the globe, an increasing number of our actions and activities are being recorded and stored as categorized, timestamped events. This type of data, which comprises electronic health records, shipment tracking data, and process logs, is wellsuited to the tabular structure of standard d ..."
Abstract
 Add to MetaCart
given query, but how best to match the events in the record to the events in the query when multiple options are present. In this paper, we demonstrate that temporal pattern matching queries can be formulated and solved as integer programs. This novel approach has distinct advantages over standard query
A linear programming approach for the weighted graph matching problem
 IEEE Trans. Pattern Anal. Mach. Intell
, 1993
"... Abstract A linear programming (LP) approach is proposed for the weighted graph matching problem. A linear program is obtained by formulating the graph matching problem in L1 norm and then transforming the resulting quadratic optimization problem to a linear one. The linear program is solved using a ..."
Abstract

Cited by 76 (0 self)
 Add to MetaCart
Abstract A linear programming (LP) approach is proposed for the weighted graph matching problem. A linear program is obtained by formulating the graph matching problem in L1 norm and then transforming the resulting quadratic optimization problem to a linear one. The linear program is solved using
Digital Object Identifier Twostage integer programs with stochastic righthand sides: a superadditive dual approach
, 2006
"... Abstract. We consider twostage pure integer programs with discretely distributed stochastic righthand sides. We present an equivalent superadditive dual formulation that uses the value functions in both stages. We give two algorithms for finding the value functions. To solve the reformulation aft ..."
Abstract
 Add to MetaCart
Abstract. We consider twostage pure integer programs with discretely distributed stochastic righthand sides. We present an equivalent superadditive dual formulation that uses the value functions in both stages. We give two algorithms for finding the value functions. To solve the reformulation
An Integer Programming Approach to the Hospital/Residents Problem with Ties
 CoRR
, 2013
"... The classical Hospitals/Residents problem (HR) models the assignment of junior doctors to hospitals based on their preferences over one another. In an instance of this problem, a stable matching M is sought which ensures that no blocking pair can exist in which a resident r and hospital h can improv ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
matching, is NPhard. In this paper we describe an Integer Programming (IP) model for MAX HRT. We also provide some details on the implementation of the model. Finally we present results obtained from an empirical evaluation of the IP model based on realworld and randomly generated problem instances. 1
Integer Programming Formulations for the Minimum Weighted Maximal Matching Problem
 OPTIMIZATION LETTERS
"... Given an undirected graph, the problem of finding a maximal matching that has minimum total weight is NPhard. This problem has been studied extensively from a graph theoretical point of view. Most of the existing literature considers the problem in some restricted classes of graphs and give polyn ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
polynomial time exact or approximation algorithms. On the contrary, we consider the problem on general graphs and approach it from an optimization point of view. In this paper, we develop integer programming formulations for the minimum weighted maximal matching problem and analyze their efficacy on randomly
Young Students Approach Integer Triangles
, 2002
"... How many different triangles of perimeter n can be made with a supply of n toothpicks? Let us assume all triangles created have an integral number of toothpicks per side and have positive area. We wish to count the number of incongruent triangles that can be so constructed. This is the problem stude ..."
Abstract
 Add to MetaCart
offers. We hold classes at Harvard University and Northeastern University, and at community education centers. The school was founded by Robert Kaplan, Ellen Kaplan and Tomás Guillermo in 1994, and I have been fortunate to be involved with this program for the past two years. We typically begin a
Matching Observed Behavior and Modeled Behavior: An Approach Based on Petri nets and Integer Programming
"... Inspired by the way SAP R/3 and other transactionalinfsa mation systems log events we f cus on the problem to decide whether a process model and af requency profile "fit" together. The problem isf," ulated in termsof Petri nets and an approach based on integer programming is proposed ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Inspired by the way SAP R/3 and other transactionalinfsa mation systems log events we f cus on the problem to decide whether a process model and af requency profile "fit" together. The problem isf," ulated in termsof Petri nets and an approach based on integer programming is proposed
Results 1  10
of
359