# Applying Predicate Detection to the Constrained Optimization Problems

We present a method to design parallel algorithms for constrained combinatorial optimization problems. Our method solves and generalizes many classical combinatorial optimization problems including the stable marriage problem, the shortest path problem and the market clearing price problem. These three problems are solved in the literature using Gale-Shapley algorithm, Dijkstra's algorithm, and Demange, Gale, Sotomayor algorithm. Our method solves all these problems by casting them as searching for an element that satisfies an appropriate predicate in a distributive lattice. Moreover, it solves generalizations of all these problems - namely finding the optimal solution satisfying additional constraints called lattice-linear predicates. For stable marriage problems, an example of such a constraint is that Peter's regret is less than that of Paul. For shortest path problems, an example of such a constraint is that cost of reaching vertex v_1 is at least the cost of reaching vertex v_2. For the market clearing price problem, an example of such a constraint is that item_1 is priced at least as much as item_2. In addition to finding the optimal solution, our method is useful in enumerating all constrained stable matchings, and all constrained market clearing price vectors.

research
03/10/2021

### A Lattice Linear Predicate Parallel Algorithm for the Dynamic Programming Problems

It has been shown that the parallel Lattice Linear Predicate (LLP) algor...
research
08/02/2022

### Lattice Linear Predicate Algorithms for the Constrained Stable Marriage Problem with Ties

We apply Lattice-Linear Predicate Detection Technique to derive parallel...
research
11/26/2021

### An Exact Method for Fortification Games

A fortification game (FG) is a three-level, two-player Stackelberg game,...
research
05/19/2022

### Optimal routing algorithm for trips involving thousands of ev-charging stations using Kinetica-Graph

This paper discusses a graph based route solving algorithm to find the o...
research
11/13/2020

### Affinely representable lattices, stable matchings, and choice functions

Birkhoff's representation theorem (Birkhoff, 1937) defines a bijection b...
research
06/26/2022

### Constrained Shortest-Path Reformulations for Discrete Bilevel and Robust Optimization

Many discrete optimization problems are amenable to constrained shortest...
research
02/21/2019

### The Markovian Price of Information

Suppose there are n Markov chains and we need to pay a per-step price to...