Results 51 to 60 of about 146 (126)
Efficient solution methods for covering tree problems
location, covering, tree covering, 90B80, 90C27, 90C35,
T. Boffey
core +1 more source
An algorithmic study of the Maximum Flow problem: A comparative statistical analysis
Network programming, Maximum Flow Algorithm, Experimental Design, Statistical Analysis, 90C27,
M. González-Sierra +2 more
core +1 more source
An exact procedure and LP formulations for the leader—follower location problem
Competitive location, Exact procedure, Leader–Follower problem, 90B80, 90C05, 90C27,
Clara Campos Rodríguez +2 more
core +1 more source
Optimization, Genetic algorithms, Uniform crossover, Two-point crossover, Binary coding, Gray coding, 90B90, 90C27,
Ayşegül Aksoy +3 more
core +1 more source
A survey of some mathematical programming models in transportation
Nonlinear Network Flows, Traffic Assignment, Bilevel Optimization, 90C27,
Jaume Barceló
core +1 more source
Optimization applications of Goldbach's conjecture. [PDF]
Lin BMT, Lin SM, Shyu SJ.
europepmc +1 more source
Central hubs prediction for bio networks by directed hypergraph - GA with validation to COVID-19 PPI. [PDF]
Gopalakrishnan S +4 more
europepmc +1 more source
Two level hierarchical time minimizing transportation problem
Global optimization, concave minimization problem, time minimizing transportation problem, hierarchical optimization, 90C27, 90C26, 90C08, 90C90,
Sonia, Munish Puri
core +1 more source
Extreme points of discrete location polyhedra
Extreme point, polyhedron, discrete location, 90C27, 90C10,
Alfredo Marín +2 more
core +1 more source
Lower and upper bounds for the linear arrangement problem on interval graphs [PDF]
International audienceWe deal here with the Linear Arrangement Problem (LAP) on interval graphs, any interval graph being given here together with its representation as the intersection graph of some collection of intervals, and so with related ...
Quilliot, Alain +5 more
core +1 more source

