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:"Compact 0–1 formulations"
Narrow search

Narrow search

Year of publication
Subject
All
Combinatorial optimization 1 Compact 0–1 formulations 1 Graph theory 1 R-robust k-clubs 1 Robust network clusters 1 k-clubs 1
Online availability
All
Undetermined 1
Type of publication
All
Article 1
Language
All
Undetermined 1
Author
All
Boginski, Vladimir 1 Veremyev, Alexander 1
Published in...
All
European Journal of Operational Research 1
Source
All
RePEc 1
Showing 1 - 1 of 1
Cover Image
Identifying large robust network clusters via new compact formulations of maximum k-club problems
Veremyev, Alexander; Boginski, Vladimir - In: European Journal of Operational Research 218 (2012) 2, pp. 316-326
Network robustness issues are crucial in a variety of application areas. In many situations, one of the key robustness requirements is the connectivity between each pair of nodes through a path that is short enough, which makes a network cluster more robust with respect to potential network...
Persistent link: https://www.econbiz.de/10010577576
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...