Network analysis of particles and grains

L Papadopoulos, MA Porter, KE Daniels… - Journal of Complex …, 2018 - academic.oup.com
The arrangements of particles and forces in granular materials have a complex organization
on multiple spatial scales that range from local structures to mesoscale and system-wide …

Certifying algorithms

RM McConnell, K Mehlhorn, S Näher… - Computer Science …, 2011 - Elsevier
A certifying algorithm is an algorithm that produces, with each output, a certificate or witness
(easy-to-verify proof) that the particular output has not been compromised by a bug. A user …

A survey of relaxations and approximations of the power flow equations

DK Molzahn, IA Hiskens - Foundations and Trends® in …, 2019 - nowpublishers.com
The power flow equations relate the power injections and voltages in an electric power
system and are therefore key to many power system optimization and control problems …

Strong SOCP relaxations for the optimal power flow problem

B Kocuk, SS Dey, XA Sun - Operations Research, 2016 - pubsonline.informs.org
This paper proposes three strong second order cone programming (SOCP) relaxations for
the AC optimal power flow (OPF) problem. These three relaxations are incomparable to …

Disambiguating visual relations using loop constraints

C Zach, M Klopschitz… - 2010 IEEE Computer …, 2010 - ieeexplore.ieee.org
Repetitive and ambiguous visual structures in general pose a severe problem in many
computer vision applications. Identification of incorrect geometric relations between images …

Models for railway timetable optimization: Applicability and applications in practice

G Caimi, L Kroon, C Liebchen - Journal of Rail Transport Planning & …, 2017 - Elsevier
This paper provides an overview of railway timetable design in practice and the
combinatorial optimization models that have been proposed for this application, putting …

Automated separation of binary overlapping trees in low-contrast color retinal images

Q Hu, MD Abràmoff, MK Garvin - … , Nagoya, Japan, September 22-26, 2013 …, 2013 - Springer
While many approaches exist for the automated segmentation of retinal vessels in fundus
photographs, limited work has focused on the problem of separating the arterial from the …

A fast and accurate approximation for planar pose graph optimization

L Carlone, R Aragues… - … Journal of Robotics …, 2014 - journals.sagepub.com
This work investigates the pose graph optimization problem, which arises in maximum
likelihood approaches to simultaneous localization and mapping (SLAM). State-of-the-art …

A linear approximation for graph-based simultaneous localization and mapping

L Carlone, R Aragues, JA Castellanos, B Bona - 2012 - direct.mit.edu
Localization and Mapping (SLAM) from the perspective of linear estimation theory. The
problem is first formulated in terms of graph embedding: a graph describing robot poses at …

Periodic timetabling with integrated routing: Toward applicable approaches

P Schiewe, A Schöbel - Transportation Science, 2020 - pubsonline.informs.org
Periodic timetabling is an important, yet computationally challenging, problem in public
transportation planning. The usual objective when designing a timetable is to minimize …