Results 51 to 60 of about 95 (88)
, 1994 . Based on recent convergence results for the affine scaling algorithm for linear programming, we investigate strategies to identify the optimal face of a minimum cost network flow problem.
Mauricio G.C. Resende +3 more
core +1 more source
The generalizedp-Centdian on network
Location, Centdian, Networks, 68Q20, 68R99, 05C85, 90C35,
Dionisio Brito, José Moreno Pérez
core +1 more source
A Greedy Randomized Adaptive Search Procedure For The Quadratic Assignment Problem
, 1994 . A greedy randomized adaptive search procedure (GRASP) is a randomized heuristic that has been shown to quickly produce good quality solutions for a wide variety of combinatorial optimization problems.
Mauricio G.C. Resende +4 more
core +1 more source
An approach for solving a modification of the extended rapid transit network design problem
Station and link location, Circular line, Line designing, Degree of a node, 90B06, 90B80, 90C10, 90C35,
L. Escudero, S. Muñoz
core +1 more source
Shortest paths on polymatroids and hypergraphic polytopes [PDF]
Base polytopes of polymatroids, also known as generalized permutohedra, are polytopes whose edges are parallel to a vector of the form \(\mathbf{e}_i - \mathbf{e}_j\), where the \(\{\mathbf{e}_i\}_{i\in [n]}\) are the canonical basis vectors of \(\mathbb{
Cardinal, Jean, Steiner, Raphael
core +1 more source
Central hubs prediction for bio networks by directed hypergraph - GA with validation to COVID-19 PPI. [PDF]
Pattern Recognit Lett, 2022 Gopalakrishnan S +4 more
europepmc +1 more source
Eliciting vague but proper maximal entropy priors in Bayesian experiments
Bayesian inference, Expert opinion, Kullback–Leibler distance, Shannon’s entropy, Noninformative priors, Channel coding, Sensitivity study, Weibull, 65K05, 90C35,
Nicolas Bousquet
core +1 more source
Fiduciary Responsibility and the Green Energy Act, 2009 (Ontario, Canada). [PDF]
Environ Justice, 2021 Tsuji SRJ.
europepmc +1 more source
Linear programming relaxations of the mixed postman problem”, Morfismos 9
, 2005 The mixed postman problem consists of finding a minimum cost tour of a connected mixed graph traversing all its vertices, edges, and arcs at least once.
Francisco Javier Zaragoza Martínez
core
Interior Point Algorithms For Network Flow Problems
, 1996 . Computational algorithms for the solution of network flow problems are of great practical significance. In the last decade, a new class of computationally efficient algorithms, based on the interior point method, has been proposed and applied to solve ...
Mauricio G.C. Resende, Panos M. Pardalos
core