Search
Search Constraints
You searched for: Is Part Of Networks. Volume 73:Issue 1(2019)Limit your search
- 658.4032 9
- Network analysis (Planning) -- Periodicals 9
- 2‐connected Steiner networks -- 2‐edge‐connected networks -- computational geometry -- exact algorithm -- GeoSteiner -- Steiner trees 1
- approximation algorithms -- interdiction problems -- length‐bounded cuts -- NP‐hardness -- parameterized complexity -- special graph classes 1
- branch‐and‐cut -- edge‐colored graph -- graph theory -- integer programming -- preprocessing -- rainbow cycle 1
- branch‐price‐and‐cut -- combinatorial optimization -- critical node problem -- graph partitioning -- mixed‐integer programming -- network interdiction 1
- capacitated vehicle routing -- computation‐implementation parallelization -- delivery routing -- time‐sensitive -- vehicle loading -- vehicle loading and routing 1
- cost allocation -- cost‐to‐serve -- economics of the internet -- fairness -- peer‐to‐peer networks -- Steiner tree problem 1
- expected utility -- incomplete preferences -- mixed integer programming -- network interdiction -- robust optimization -- stochastic programming 1
- extended formulation -- extension complexity -- integer programming -- planar dual -- planar graph -- spanning arborescence -- spanning tree 1