Results 1 to 10 of about 75 (75)

Routing problems with loading constraints [PDF]

open access: yes, 2010
Vehicle routing, Loading, Two-dimensional packing, Three-dimensional packing, Traveling salesman, Pickup and delivery, 90C27, 90C35,
S. Martello   +5 more
core   +1 more source

Stop location design in public transportation networks: covering and accessibility objectives [PDF]

open access: yes, 2006
Location, Public transportation, Covering, Accessibility, 90B80, 90C10, 90C35, 90B20,
Poetranto, Dwi Retnani   +12 more
core   +1 more source

Computational experiments with a lazy version of a K quickest simple path ranking algorithm [PDF]

open access: yes, 2007
Graph algorithms, Networks, Quickest path, Ranking, 90C27, 90C35,
Pascoal, M.   +7 more
core   +1 more source

Efficient solution methods for covering tree problems

open access: yes, 1998
location, covering, tree covering, 90B80, 90C27, 90C35,
T. Boffey, T. B. Boffey
core   +1 more source

Uniqueness of market equilibria on networks with transport costs [PDF]

open access: yes, 2018
We study the existence and uniqueness of equilibria for perfectly competitive markets in capacitated transport networks. The model under consideration is rather general so that it captures basic aspects of related models in, e.g., gas or electricity ...
Krebs, Vanessa   +3 more
core   +1 more source

Variantes del problema del cartero mixto que se pueden resolver usando programación lineal [PDF]

open access: yes, 2012
Dada una gráfica mixta y conexa con costos en sus aristas y arcos, el problema del cartero mixto consiste en encontrar un circuito cerrado de la gráfica mixta que recorra sus aristas y arcos a costo mínimo. Se sabe que este problema es NP-duro.
Francisco Javier Zaragoza Martínez   +3 more
core   +1 more source

Mathematics Subject Classification interrater agreement dataset

open access: yes, 2022
The Mathematics Subject Classification organizes Publications, Software, and Research Data into a hierarchical classification scheme maintained by MathSciNet (mr) and zbMATH Open (zbmath). According to the classification scheme, both organizations mr and
Olaf Teschke   +2 more
core   +1 more source

Detecting embedded pure network structures in LP problems

open access: yes, 1998
Linear Programming, Embedded Networks, Network Optimization, AMS subject classification, 90C05, 90C35, 90C08,
Nalân Gülpinar   +2 more
core   +1 more source

HexCycleSpanner to tighten Directed Hamiltonian Circuit CycleExpander to construct Directed Hamiltonian Circuit

open access: yes, 2022
HexCycleSpanner to tighten Directed Hamiltonian Circuit CycleExpander to construct Directed Hamiltonian Circuit Dr.(Prof.) Keshava Prasad Halemane, Professor - retired from Department of Mathematical And Computational Sciences ...
HALEMANE, KESHAVA PRASAD
core   +1 more source

The generalizedp-Centdian on network

open access: yes, 2000
Location, Centdian, Networks, 68Q20, 68R99, 05C85, 90C35,
Dionisio Brito   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy