about
Euclidean shortest paths in the presence of rectilinear barriersThe school bus routing and scheduling problem with transfers.Complexity of vehicle routing and scheduling problemsCovering and packing in graphs IV: Linear arboricitySimple heuristics for unit disk graphsAlgorithms for a maximum clique and a maximum independent set of a circle graphPartial orders of dimension 2Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometryNode fault tolerance in graphsDisjoint paths in a networkOn the Computational Complexity of Combinatorial ProblemsMaximum matchings in bipartite graphs via strong spanning treesMatching preclusion for some interconnection networksRobust recoverable perfect matchingsA note on a generalization of eigenvector centrality for bipartite graphs and applicationsMaximum independent set for intervals by divide and conquer with pruningMinimum path bases and relevant pathsHow to find good night train connectionsFaster exact algorithms for steiner trees in planar networksComplexity and approximability of thek-way vertex cutOptimal pricing of capacitated networksIndependence properties of directed markov fieldsSequential updating of conditional probabilities on directed graphical structuresOn the worst-case performance of some algorithms for the asymmetric traveling salesman problemNew results for the degree/diameter problemLazy evaluation in penniless propagation over join treesA branch-and-bound algorithm for representative integer efficient solutions in multiple objective network programming problemsFinding integer efficient solutions for multiple objective network programming problemsAn Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring ProblemGeneralized network design polyhedraStabilizing branch-and-price for constrained tree problemsThe generalized minimum edge-biconnected network problem: Efficient neighborhood structures for variable neighborhood searchAvailability-driven optimal design of shared path protection in WDM networksAn adjustable sample average approximation algorithm for the stochastic production-inventory-routing problemA maritime inventory routing problem: Discrete time formulations and valid inequalitiesThe spectra of wrapped butterfly digraphsDecontamination of hypercubes by mobile agentsComplexity and approximability of the maximum flow problem with minimum quantitiesScheduling unit time arc shutdowns to maximize network flow over time: Complexity resultsA minimum cost flow formulation for approximated MLC segmentation
P1433
Q30047557-CD87AB12-FFFC-4F43-90D0-C2DBF77379C2Q41814872-E5E71975-F5F5-47BA-926B-C7350E8E6EA7Q55968053-D2F10ABD-46C3-469E-8ADA-0B8F28027943Q55969521-95329A35-7DAB-4382-9B92-C0F9A845294AQ56019093-00EE3047-2AAC-4863-BC08-9175702CB0E1Q56210413-00E6460E-72EB-4135-A7DC-2DFBC2D8060AQ56227815-74714CDA-4AA1-4CC6-A131-0376E73C52FFQ56287384-9AA3E11A-ACA7-4707-8F87-286282705E68Q56462701-838151BA-14C5-4276-BEA4-538C86989163Q56484790-3ADE00BA-F735-4C9C-982B-7030F5E74436Q56503916-ACD02DFE-F2FC-47B4-A090-49F4E7EADADCQ56626052-86A5B600-7E6F-487B-8649-9DEF6D40F1E3Q56638364-768C71B0-C1FC-4055-96AC-80E79AE22E6AQ56638367-87D9ED5A-6149-4812-A744-760AC3993685Q56815221-2ED7FFC0-6026-4B8D-8032-EE1D3B8512F8Q56970417-FBF4CD61-14B8-4B93-B36B-0C83257BADA6Q56991397-387C03E2-857F-4374-90FD-C42BE913B10DQ57013180-243BD58C-0403-4E00-B3AB-7920132B6C50Q57311715-10DC4843-A649-4126-B6A0-A386BD963B2DQ57338948-B021BA7E-F267-44EC-A4DA-3F12F7001830Q57338957-BD6256C2-F9F7-49EC-958A-2F2DB2AC4C40Q57394059-F72074FF-0BBC-4D0E-AAFD-4AA22D51DB56Q57394061-F14D516A-4E14-4233-A8A3-F13F70099571Q57401646-64ACBB81-5779-4251-923C-94C40FBFD59BQ57535790-8B0BD6E1-AA31-4ED8-93D8-E0B3665DA8EEQ57551203-8B02D23B-FDCB-4336-B455-71E31D7A71ACQ57570730-5623B41D-110D-49E3-86E8-A17B3123BC1BQ57570749-E76B8DDC-A121-4BE3-B8B9-9A2EE8F42B05Q57659011-D0AE5F9C-7058-4426-9DC8-0A7DBC6FA79BQ57702171-393A46D2-BE95-484B-A1C6-AFB1784E65C4Q57705367-C1AA3792-7520-4B9A-8812-A5D338A3F9B4Q57705375-88D354D2-C5D5-420A-8B65-4524FDB263DEQ57707453-9E900923-2ED1-447E-93D0-ABAD66E73D02Q57736431-86A84D68-4A82-44DC-A0BD-80AE527E265DQ57736539-228AD173-AFB5-4EB5-B8C2-5DF14701898CQ57772719-CBEEC2D8-41C0-4871-BF06-4AA04F802A09Q57832114-E5E595E9-BC91-4D34-9861-3C5BA9B9F295Q57851375-3C257F94-1CE3-42D1-B839-6161AD4B5DE5Q57955358-B3C33B6F-F420-41DC-8BB6-2B0CF70D93B8Q57955369-68251082-86AA-4C96-BDDF-98DD3FCAC4B7
P1433
description
journal
@en
revista científica
@es
rivista scientifica
@it
wetenschappelijk tijdschrift van Wiley-Blackwell
@nl
wissenschaftliche Fachzeitschrift
@de
مجلة
@ar
name
Networks
@ast
Networks
@da
Networks
@en
Networks
@es
Networks
@fi
Networks
@fr
Networks
@it
Networks
@nb
Networks
@nl
Networks
@nn
type
label
Networks
@ast
Networks
@da
Networks
@en
Networks
@es
Networks
@fi
Networks
@fr
Networks
@it
Networks
@nb
Networks
@nl
Networks
@nn
prefLabel
Networks
@ast
Networks
@da
Networks
@en
Networks
@es
Networks
@fi
Networks
@fr
Networks
@it
Networks
@nb
Networks
@nl
Networks
@nn
P214
P3181
P356
P1055
P1058
P1156
P123
P1250
P1277
P1476
Networks
@und
P214
P236
P3181
P356
10.1002/(ISSN)1097-0037