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:"Connected partition"
Narrow search

Narrow search

Year of publication
Subject
All
Balanced connected partition 2 Graph theory 2 Graphentheorie 2 Algorithm 1 Algorithmus 1 Approximation algorithm 1 Balanced partition 1 Branch-and-cut 1 Computer network 1 Computernetz 1 Connected partition 1 FPTAS 1 Ganzzahlige Optimierung 1 Grid graphs 1 Integer programming 1 Mathematical programming 1 Mathematische Optimierung 1 Non-separating path 1 Pseudo-polynomial time algorithm 1 Separation algorithm 1
more ... less ...
Online availability
All
Undetermined 2
Type of publication
All
Article 3
Type of publication (narrower categories)
All
Article in journal 2 Aufsatz in Zeitschrift 2
Language
All
English 2 Undetermined 1
Author
All
Fan, Lidan 1 Miyazawa, Flávio Keidi 1 Moura, Phablo F. S. 1 Ota, Matheus J. 1 Wakabayashi, Yoshiko 1 Wang, Lele 1 Wu, Bang Ye 1 Wu, Di 1 Wu, Weili 1 Zhang, Zhao 1
more ... less ...
Published in...
All
European journal of operational research : EJOR 1 Journal of Global Optimization 1 Journal of combinatorial optimization 1
Source
All
ECONIS (ZBW) 2 RePEc 1
Showing 1 - 3 of 3
Cover Image
Partitioning a graph into balanced connected classes : formulations, separation and experiments
Miyazawa, Flávio Keidi; Moura, Phablo F. S.; Ota, … - In: European journal of operational research : EJOR 293 (2021) 3, pp. 826-836
Persistent link: https://www.econbiz.de/10012533763
Saved in:
Cover Image
Max-min weight balanced connected partition
Wang, Lele; Zhang, Zhao; Wu, Di; Wu, Weili; Fan, Lidan - In: Journal of Global Optimization 57 (2013) 4, pp. 1263-1275
For a connected graph <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$G=(V,E)$$</EquationSource> </InlineEquation> and a positive integral vertex weight function <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$$w$$</EquationSource> </InlineEquation>, a max-min weight balanced connected <InlineEquation ID="IEq3"> <EquationSource Format="TEX">$$k$$</EquationSource> </InlineEquation>-partition of <InlineEquation ID="IEq4"> <EquationSource Format="TEX">$$G$$</EquationSource> </InlineEquation>, denoted as <InlineEquation ID="IEq5"> <EquationSource Format="TEX">$$BCP_k$$</EquationSource> </InlineEquation>, is a partition of <InlineEquation ID="IEq6"> <EquationSource Format="TEX">$$V$$</EquationSource> </InlineEquation> into <InlineEquation ID="IEq7"> <EquationSource Format="TEX">$$k$$</EquationSource> </InlineEquation> disjoint vertex subsets <InlineEquation ID="IEq8"> <EquationSource Format="TEX">$$(V_1,V_2,\ldots ,V_k)$$</EquationSource> </InlineEquation> such that each <InlineEquation ID="IEq9"> <EquationSource...</equationsource></inlineequation></equationsource></inlineequation></equationsource></inlineequation></equationsource></inlineequation></equationsource></inlineequation></equationsource></inlineequation></equationsource></inlineequation></equationsource></inlineequation></equationsource></inlineequation>
Persistent link: https://www.econbiz.de/10010994149
Saved in:
Cover Image
Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs
Wu, Bang Ye - In: Journal of combinatorial optimization 26 (2013) 3, pp. 592-607
Persistent link: https://www.econbiz.de/10010204541
Saved in:
A service of the
zbw
  • Sitemap
  • Plain language
  • Accessibility
  • Contact us
  • Imprint
  • Privacy

Loading...