1

May 2016
Computers and Industrial Engineering: Volume 95 Issue C, May 2016

**Publisher:** Pergamon Press, Inc.

We address the time cost tradeoff problem.We investigate new properties of the repeated cuts algorithm of Phillips and Dessouky.We devise a new scaling repeated cuts algorithm that runs in polynomial time.The new algorithm is easy to implement as it is using a min-cut routine only.The new algorithm improves on the ...

**Keywords**:
Project management, Minimum cut, Time-cost tradeoff

2

March 2016
Journal of Real-Time Image Processing: Volume 11 Issue 3, March 2016

**Publisher:** Springer-Verlag New York, Inc.

Rapid advances in image acquisition and storage technology underline the need for real-time algorithms that are capable of solving large-scale image processing and computer-vision problems. The minimums---tcut problem, which is a classical combinatorial optimization problem, is a prominent building block in many vision and imaging algorithms such as video segmentation, ...

**Keywords**:
Maximum-flow, Surface fitting, Multi-view reconstruction, Stereo vision, Minimum-cut, Network flow algorithms, Segmentation

3

February 2016
ICPRAM 2016: Proceedings of the 5th International Conference on Pattern Recognition Applications and Methods

**Publisher:** SCITEPRESS - Science and Technology Publications, Lda

Machine learning techniques that rely on pairwise similarities have proven to be leading algorithms for classification. Despite their good and robust performance, similarity-based techniques are rarely chosen for largescale data mining because the time required to compute all pairwise similarities grows quadratically with the size of the data set. To ...

**Keywords**:
Classification, Data Reduction, Large-Scale Data Mining, Supervised Normalized Cut.

4

October 2014
Networks: Volume 64 Issue 3, October 2014

**Publisher:** Wiley-Interscience

Key in the efforts to deter and prevent nuclear terrorism is the ability to detect the presence of possible nuclear threats in a given area. Resources capable of detecting such threats are limited, expensive, and only capable of scanning a certain total area in a given amount of time. This ...

**Keywords**:
Chinese postman, security games, vehicle routing, approximation algorithm, adversarial games

5

March 2013
ACM Transactions on Algorithms (TALG): Volume 9 Issue 2, March 2013

**Publisher:** ACM

**Bibliometrics**:

Citation Count: 1

Downloads (6 Weeks): 3, Downloads (12 Months): 13, Downloads (Overall): 235

Full text available:

PDF
Finding a largest Order-Preserving SubMatrix, OPSM, is an important problem arising in the discovery of patterns in gene expression. Ben-Dor et al. formulated the problem in Ben-Dor et al. [2003]. They further showed that the problem is NP-complete and provided a greedy heuristic for the problem. The complement of the ...

**Keywords**:
Gene expression, approximation algorithm, biclustering, order preserving

6

January 2013
Networks: Volume 61 Issue 1, January 2013

**Publisher:** Wiley-Interscience

The pseudoflow algorithm for solving the maximum flow and minimum cut problems was devised in Hochbaum (2008). The complexity of the algorithm was shown in (2008) to be O ( nm log n ). Chandran and Hochbaum, (2009) demonstrated that the pseudoflow algorithm is very efficient in practice, and that ...

**Keywords**:
data structure, maximum flow, pseudoflow algorithm, minimum cut, dynamic trees

7

September 2011
Operations Research: Volume 59 Issue 5, 09-10 2011

**Publisher:** INFORMS

Databases are a significant source of information in organizations and play a major role in managerial decision-making. This study considers how to process commercial data on customer purchasing timing to provide insights on the rate of new product adoption by the company's consumers. Specifically, we show how to use the ...

**Keywords**:
networks/graphs, new products, applications, marketing, unidimensional scaling methodology, buyer behavior, decision analysis, theory

8

May 2011
SSVM'11: Proceedings of the Third international conference on Scale Space and Variational Methods in Computer Vision

**Publisher:** Springer-Verlag

One of the classical optimization models for image segmentation is the well known Markov Random Fields (MRF) model. MRF formulates many total variation and other optimization criteria used in image segmentation. In spite of the presence of MRF in the literature, the dominant perception has been that the model is ...

9

September 2010
Acta Informatica: Volume 47 Issue 5-6, September 2010

**Publisher:** Springer-Verlag New York, Inc.

In the process of reviewing and ranking projects by a group of reviewers, the allocation of the subset of projects to each reviewer has major impact on the robustness of the outcome ranking. We address here this problem where each reviewer is assigned, out of the list of all projects, ...

10

August 2010
Networks: Volume 56 Issue 1, August 2010

**Publisher:** Wiley-Interscience

The input to an inverse shortest path lengths problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not necessarily conform to the shortest path lengths in G . The goal is to modify the arc weights, subject to ...

**Keywords**:
inverse optimization, complexity, shortest path, polynomial algorithm

11

May 2010
IEEE Transactions on Pattern Analysis and Machine Intelligence: Volume 32 Issue 5, May 2010

**Publisher:** IEEE Computer Society

In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goal is to have each group distinctly dissimilar from the rest and possibly to have the group size fairly large. These goals ...

**Keywords**:
graph theoretic methods, Grouping, image segmentation, graph theoretic methods, partitioning., Grouping, image segmentation, partitioning.

12

January 2010
Theoretical Computer Science: Volume 411 Issue 1, January, 2010

**Publisher:** Elsevier Science Publishers Ltd.

An optimization problem arising in the design of optical networks is shown here to be abstracted by the following model of covering the edges of a bipartite graph with a minimum number of 4-cycles, or K"2","2: Given a bipartite graph G=(L,R,E) over the node set

[email protected]?R with

[email protected]?{[u,v]:

[email protected]?L,

[email protected]?R}, and the ...

**Keywords**:
Approximation algorithms, Set cover, Network design

13

March 2009
Operations Research: Volume 57 Issue 2, March 2009

**Publisher:** INFORMS

We present the results of a computational investigation of the pseudoflow and push-relabel algorithms for the maximum flow and minimum s - t cut problems. The two algorithms were tested on several problem instances from the literature. Our results show that our implementation of the pseudoflow algorithm is faster than ...

**Keywords**:
normalized tree, lowest label, maximum flow, parametric flow, pseudoflow algorithm, flow algorithms

14

January 2009
Networks: Volume 53 Issue 1, January 2009

**Publisher:** Wiley-Interscience

The facility terminal cover problem is a generalization of the vertex cover problem. The problem is to “cover” the edges of an undirected graph G = ( V , E ) where each edge e is associated with a non-negative demand d e . An edge e = u , ...

**Keywords**:
algorithms, approximation algorithms, set cover, vertex cover, network design

15

October 2008
Optimization Methods & Software - THE JOINT EUROPT-OMS CONFERENCE ON OPTIMIZATION, 4-7 JULY, 2007, PRAGUE, CZECH REPUBLIC, PART I: Volume 23 Issue 5, October 2008

**Publisher:** Taylor & Francis, Inc.

Country credit-risk ratings are evaluated independently by several agencies. A common method of aggregating the ratings into a single rating is by taking their averages (the averaging method). We show here that an approach that captures the relative ranking of the countries given by each agency leads to an improved ...

**Keywords**:
group rating, group decision-making, aggregate ranking, country credit-risk ratings, network flow

16

July 2008
Operations Research: Volume 56 Issue 4, July 2008

**Publisher:** INFORMS

We introduce the pseudoflow algorithm for the maximum-flow problem that employs only pseudoflows and does not generate flows explicitly. The algorithm solves directly a problem equivalent to the minimum-cut problem---the maximum blocking-cut problem. Once the maximum blocking-cut solution is available, the additional complexity required to find the respective maximum-flow is ...

**Keywords**:
normalized tree, lowest label, maximum flow, parametric flow, pseudoflow algorithm, flow algorithms

17

March 2008
Operations Research Letters: Volume 36 Issue 2, March, 2008

**Publisher:** Elsevier Science Publishers B. V.

We define a generalization of the satisfiability problem (SAT) where each ''clause'' is an or-list of inequalities in n variables. This problem is NP-complete even when containing only two inequalities per ''clause'', but solvable in polynomial time when either the number of variables or the number of ''clauses'' is fixed.

**Keywords**:
Inequality-satisfiability, Satisfiability (SAT), Or-inequalities, Parting directions

18

January 2008
Operations Research: Volume 56 Issue 1, January 2008

**Publisher:** INFORMS

In this paper, we study capacitated dynamic lot-sizing problems with or without backorders, under the assumption that production costs are linear, that is, there are no setup costs. These two dynamic lot-sizing problems (with or without backorders) are minimum-cost flow problems on an underlying network that possess a special structure. ...

**Keywords**:
inventory/production, flow algorithms, production/scheduling, lot sizing, networks/graphs

19

October 2007
WAOA'07: Proceedings of the 5th international conference on Approximation and online algorithms

**Publisher:** Springer-Verlag

We consider an optimization problem arising in the design of optical networks. We are given a bipartite graph G = ( L,R,E ) over the node set L ∪ R where the edge set is E ⊆ {[ u, v ] : u ∈ L, v ∈ R }, and ...

**Keywords**:
network design, approximation algorithms, set cover

20

December 2006
WINE'06: Proceedings of the Second international conference on Internet and Network Economics

**Publisher:** Springer-Verlag

The problem of rank aggregation has been studied in contexts varying from sports, to multi-criteria decision making, to machine learning, to academic citations, to ranking web pages, and to descriptive decision theory. Rank aggregation is the mapping of inputs that rank subsets of a set of objects into a consistent ...

**Keywords**:
inverse problems, aggregate ranking, network flow