12 papers · ranked by Valyu relevance
Demétrios Araújo Magalhães Coutinho, Samuel Xavier‐de‐Souza, Daniel Aloise
'Daniel Aloise'] The Simplex tableau has been broadly used and investigated in the industry and academia. With the advent of the big data era, ever larger problems are posed to be solved in ever larger machines whose architecture type did not exist in the conception of this algorithm. In this paper, we present a…
Henry W. Robbins, Samuel C Gutekunst, Frans Schalekamp, David B. Shmoys + 1 more
'David B. Shmoys' 'David P. Williamson'] The Simplex algorithm for solving linear programs—one of Computing in Science & Engineering's top 10 most influential algorithms of the 20th century—is an important topic in many algorithms courses. While the algorithm relies on intuitive geometric ideas, the…
Daniel Gibor
In this paper, we present a randomized polynomial-time simplex algorithm with higher probability and tighter bounds for linear programming by applying improved quasi-convex properties, a logarithmic rounding on a given polytope and its logarithmic perturbation. We base our work on the first randomized polynomial-time…
Alexander Black, Jesús A. De Loera, Sean Kafer, Laura Sanità
We present new pivot rules for the Simplex method for LPs over 0/1 polytopes. We show that the number of non-degenerate steps taken using these rules is strongly polynomial and even linear in the dimension or in the number of variables. Our bounds on the number of steps are asymptotically optimal on several well-known…
Kirill Kukharenko, Laura Sanità
The simplex algorithm is one of the most popular algorithms to solve linear programs (LPs). Starting at an extreme point solution of an LP, it performs a sequence of basis exchanges (called pivots) that allows one to move to a better extreme point along an improving edgedirection of the underlying polyhedron.
Seid Miad Zandavi, Yuk Ying Chung, Ali Anaissi
The scheduling of multi-user remote laboratories is modeled as a multimodal function for the proposed optimization algorithm. The hybrid optimization algorithm, hybridization of the Nelder-Mead Simplex algorithm and Non-dominated Sorting Genetic Algorithm (NSGA), is proposed to optimize the timetable problem for the…
Alberto Del Pia, Carla Michini
The goal of this paper is to design a simplex algorithm for linear programs on lattice polytopes that traces 'short' simplex paths from any given vertex to an optimal one. We consider a lattice polytope P contained in [0, k] n and defined via m linear inequalities. Our first contribution is a simplex algorithm that…
Birgit Rudloff, Fırdevs Ulus, Robert J. Vanderbei
In this paper, a parametric simplex algorithm for solving linear vector optimization problems (LVOPs) is presented. This algorithm can be seen as a variant of the multi-objective simplex (the Evans-Steuer) algorithm [15]. Different from it, the proposed algorithm works in the parameter space and does not aim to find…
Michael Hutcheon, Andrew Teale
Algorithms are presented for performing a topological analysis of an arbitrary function, evaluated on an arbitrary grid of points. These algorithms work strictly by post-processing the data and require no additional function evaluations. This is achieved by connecting the grid points with a neighbourhood graph…
Qianxiang Ai, Joshua Schrier
In a recent paper in this journal (Chem. Mater. 2022, 34, 2545-2552), Twyman et al. studied the environmental stability of crystals by introducing a greedy heuristic algorithm for determining possible oxidation reactions. We show how the problem can be solved exactly, with less code and comparable computational time by…
Eric Hermes, Khachik Sargsyan, Habib Najm, Judit Zádor
We present a new algorithm for the optimization of molecular structures to saddle points on the potential energy surface using a redundant internal coordinate system. This algorithm automates the procedure of defining the internal coordinate system, including the handling of linear bending angles, e.g. through the…
Authors not listed
Identifying synthesis routes from knowledge graphs poses challenges beyond retrosynthesis, including path–finding artifacts and data issues. We introduce “SynGPS”, a novel algorithm that overcomes these limitations by identifying viable routes even with common artifacts. SynGPS can resolve nonsensical cycles…