Search Results for author:
Found 18 papers, 2 papers with code
Local Area Routes for Vehicle Routing Problems
Ng-routes are routes which are permitted to have non-localized cycles in space; this means that at least one intermediate customer (called a breaker) in the cycle must consider the starting customer in the cycle to be spatially far away.
Multi-Robot Routing with Time Windows: A Column Generation Approach
We formulate the problem as a weighted set packing problem where the elements in consideration are items on the warehouse floor that can be picked up and delivered within specified time windows.
Integer Programming for Multi-Robot Planning: A Column Generation Approach
We consider the problem of coordinating a fleet of robots in a warehouse so as to maximize the reward achieved within a time limit while respecting problem and robot specific constraints.
Relaxed Dual Optimal Inequalities for Relaxed Columns: with Application to Vehicle Routing
Smooth DOI exploit the observation that similar items are nearly fungible, and hence should be associated with similarly valued dual variables.
End-to-end Training of CNN-CRF via Differentiable Dual-Decomposition
These algorithms can efficiently and exactly solve sub-problems and directly optimize a convex upper bound of the real problem, providing optimality certificates on the way.
Accelerating Column Generation via Flexible Dual Optimal Inequalities with Application to Entity Resolution
We tackle optimization of weighted set packing by relaxing integrality in our ILP formulation.
Massively Parallel Benders Decomposition for Correlation Clustering
We tackle the problem of graph partitioning for image segmentation using correlation clustering (CC), which we treat as an integer linear program (ILP).
Accelerating Dynamic Programs via Nested Benders Decomposition with Application to Multi-Person Pose Estimation
We present a novel approach to solve dynamic programs (DP), which are frequent in computer vision, on tree-structured graphs with exponential node state space.
Accelerating Message Passing for MAP with Benders Decomposition
To circumvent the difficulty of enumerating the vector product of state spaces of hyper-variables we introduce a novel Benders decomposition approach.
Efficient Multi-Person Pose Estimation with Provable Guarantees
We test our approach on the MPII-Multiperson dataset, showing that our approach obtains comparable results with the state-of-the-art algorithm for joint node labeling and grouping problems, and that NBD achieves considerable speed-ups relative to a naive dynamic programming approach.
Efficient Column Generation for Cell Detection and Segmentation
To solve this integer program, we propose a column generation formulation where the pricing program is solved via exact optimization of very small scale integer programs.
Multi-Person Pose Estimation via Column Generation
We give a novel integer program formulation of the multi-person pose estimation problem, in which variables correspond to assignments of parts in the image to poses in a two-tier, hierarchical way.
Exploiting skeletal structure in computer vision annotation with Benders decomposition
Many annotation problems in computer vision can be phrased as integer linear programs (ILPs).
Efficient Pose and Cell Segmentation using Column Generation
We study the problems of multi-person pose segmentation in natural images and instance segmentation in biological images with crowded cells.
Convex Optimization For Non-Convex Problems via Column Generation
We apply column generation to approximating complex structured objects via a set of primitive structured objects under either the cross entropy or L2 loss.
Tracking Objects with Higher Order Interactions using Delayed Column Generation
We study the problem of multi-target tracking and data association in video.
Planar Ultrametric Rounding for Image Segmentation
We study the problem of hierarchical clustering on planar graphs.
