EconBiz - Find Economic Literature
    • Logout
    • Change account settings
  • A-Z
  • Beta
  • About EconBiz
  • News
  • Thesaurus (STW)
  • Academic Skills
  • Help
  •  My account 
    • Logout
    • Change account settings
  • Login
EconBiz - Find Economic Literature
Publications Events
Search options
Advanced Search history
My EconBiz
Favorites Loans Reservations Fines
    You are here:
  • Home
  • Search: subject:"Digraphs"
Narrow search

Narrow search

Year of publication
Subject
All
Directed co-graphs 4 Series-parallel digraphs 3 Digraph constraint 2 Directed trees 2 Knapsack problem 2 Mathematical programming 2 Mathematische Optimierung 2 Minimal series-parallel digraphs 2 Neighbor constraints 2 Subset sum problem 2 Theorie 2 Theory 2 Dynamic programming 1 Equal flow problem 1 Ganzzahlige Optimierung 1 Integer programming 1 Minimum cost flow problem 1 Robust flows 1
more ... less ...
Online availability
All
Free 5
Type of publication
All
Article 5
Type of publication (narrower categories)
All
Article 3 Article in journal 2 Aufsatz in Zeitschrift 2
Language
All
English 5
Author
All
Gurski, Frank 4 Komander, Dominique 4 Goebbels, Steffen 2 Rehs, Carolin 2 Büsing, Christina 1 Koster, Arie M. C. A. 1 Schmitz, Sabrina 1
more ... less ...
Published in...
All
Mathematical Methods of Operations Research 2 Mathematical methods of operations research : ZOR 2 Annals of Operations Research 1
Source
All
EconStor 3 ECONIS (ZBW) 2
Showing 1 - 5 of 5
Did you mean: subject:"digraph" (38 results)
Cover Image
The knapsack problem with special neighbor constraints
Goebbels, Steffen; Gurski, Frank; Komander, Dominique - In: Mathematical methods of operations research : ZOR 95 (2022) 1, pp. 1-34
Persistent link: https://www.econbiz.de/10013184218
Saved in:
Cover Image
The knapsack problem with special neighbor constraints
Goebbels, Steffen; Gurski, Frank; Komander, Dominique - In: Mathematical Methods of Operations Research 95 (2021) 1, pp. 1-34
restricting the graph constraints to special sets of digraphs. We discuss directed co-graphs, minimal series-parallel digraphs …
Persistent link: https://www.econbiz.de/10014497553
Saved in:
Cover Image
Robust minimum cost flow problem under consistent flow constraints
Büsing, Christina; Koster, Arie M. C. A.; Schmitz, Sabrina - In: Annals of Operations Research 312 (2021) 2, pp. 691-722
{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {NP}$$\end{document}-hard on acyclic digraphs by …}$$\end{document}-hard on series-parallel digraphs by providing a reduction from Partition. If in addition the number of scenarios is constant …-parallel digraphs for which we can solve the RobMCF≡\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage …
Persistent link: https://www.econbiz.de/10014501336
Saved in:
Cover Image
Solutions for subset sum problems with special digraph constraints
Gurski, Frank; Komander, Dominique; Rehs, Carolin - In: Mathematical Methods of Operations Research 92 (2020) 2, pp. 401-433
. We show that both problems are NP-hard even on oriented co-graphs and minimal series-parallel digraphs. Further, we …-parallel digraphs. …
Persistent link: https://www.econbiz.de/10014504204
Saved in:
Cover Image
Solutions for subset sum problems with special digraph constraints
Gurski, Frank; Komander, Dominique; Rehs, Carolin - In: Mathematical methods of operations research : ZOR 92 (2020) 2, pp. 401-433
Persistent link: https://www.econbiz.de/10012395583
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...