Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
4,980
Sufficiency of Cut-Generating Functions
, 2013
"... This note settles an open problem about cut-generating functions, a concept that has its origin in the work of Gomory and Johnson from the 1970’s and has received renewed attention in recent years. ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
This note settles an open problem about cut-generating functions, a concept that has its origin in the work of Gomory and Johnson from the 1970’s and has received renewed attention in recent years.
On the safety of Gomory cut generators
, 2012
"... Gomory mixed-integer cuts are one of the key components in Branch-and-Cut solvers for mixed-integer linear programs. The textbook formula for generating these cuts is not used directly in open-source and commercial software due to the limited numerical precision of the computations: Additional steps ..."
Abstract
- Add to MetaCart
Gomory mixed-integer cuts are one of the key components in Branch-and-Cut solvers for mixed-integer linear programs. The textbook formula for generating these cuts is not used directly in open-source and commercial software due to the limited numerical precision of the computations: Additional
Fast approximate energy minimization via graph cuts
- IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2001
"... In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function’s smoothness term must only involve pairs of pixels. We propose two algorithms that use graph cuts to compute a local minimum even when v ..."
Abstract
-
Cited by 2120 (61 self)
- Add to MetaCart
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function’s smoothness term must only involve pairs of pixels. We propose two algorithms that use graph cuts to compute a local minimum even when
Cut Generation for an Employee Timetabling Problem
"... Motivated by an industrial application, we study a specific employee timetabling problem. Several investigations are being conducted: a lower bound by Lagrangian relaxation, a heuristic based on a cut generation process and an exact method by Benders decomposition. Experimental results on real and g ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
Motivated by an industrial application, we study a specific employee timetabling problem. Several investigations are being conducted: a lower bound by Lagrangian relaxation, a heuristic based on a cut generation process and an exact method by Benders decomposition. Experimental results on real
Graphcut textures: Image and video synthesis using graph cuts
- ACM Transactions on Graphics, SIGGRAPH 2003
, 2003
"... This banner was generated by merging the source images in Figure 6 using our interactive texture merging technique. In this paper we introduce a new algorithm for image and video texture synthesis. In our approach, patch regions from a sample image or video are transformed and copied to the output a ..."
Abstract
-
Cited by 490 (9 self)
- Add to MetaCart
and then stitched together along optimal seams to generate a new (and typically larger) output. In contrast to other techniques, the size of the patch is not chosen a-priori, but instead a graph cut technique is used to determine the optimal patch region for any given offset between the input and output texture
Testing Cut Generators for Mixed-Integer Linear Programming
- PUBLISHED IN MATHEMATICAL PROGRAMMING COMPUTATION, 1, 69-95.
, 2009
"... In this paper, a methodology for testing the accuracy and strength of cut generators for mixed-integer linear programming is presented. The procedure amounts to random diving towards a feasible solution, recording several kinds of failures. This allows for a ranking of the accuracy of the generators ..."
Abstract
-
Cited by 10 (1 self)
- Add to MetaCart
In this paper, a methodology for testing the accuracy and strength of cut generators for mixed-integer linear programming is presented. The procedure amounts to random diving towards a feasible solution, recording several kinds of failures. This allows for a ranking of the accuracy
Cut-generating functions and S-free sets
"... We consider the separation problem for sets X that are inverse images of a given set S by a linear mapping. Classical examples occur in integer programming, complementarity problems and other optimization problems. One would like to generate valid inequalities that cut off some point not lying in X, ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
We consider the separation problem for sets X that are inverse images of a given set S by a linear mapping. Classical examples occur in integer programming, complementarity problems and other optimization problems. One would like to generate valid inequalities that cut off some point not lying in X
Decomposition and Dynamic Cut Generation in Integer Programming
, 2003
"... Decomposition algorithms such as Lagrangian relaxation and Dantzig-Wolfe decomposition are well-known methods that can be used to develop bounds for integer programming problems. We draw connections between these classical approaches and techniques based on generating strong valid inequalities. We a ..."
Abstract
- Add to MetaCart
also discuss several methods for incorporating dynamic cut generation into traditional decomposition methods and present a new paradigm for separation called decompose and cut. The methods we discuss take advantage of the fact that separation of a solution to a combinatorial relaxation is often much
Paradox lost? Firm-level evidence on the returns to information systems.
- Manage Sci
, 1996
"... T he "productivity paradox" of information systems (IS) is that, despite enormous improvements in the underlying technology, the benefits of IS spending have not been found in aggregate output statistics.One explanation is that IS spending may lead to increases in product quality or varie ..."
Abstract
-
Cited by 465 (23 self)
- Add to MetaCart
or variety which tend to be overlooked in the aggregate statistics, even if they increase output at the firm-level. Furthermore, the restructuring and cost-cutting that are often necessary to realize the potential benefits of IS have only recently been undertaken in many firms. Our study uses new firm
Results 1 - 10
of
4,980
