Exact algorithms for the vertex separator problem in graphs (Q3008917): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Cid Carvalho De Souza / rank
Normal rank
 
Property / author
 
Property / author: Cid Carvalho De Souza / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.20420 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2139900483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A restricted Lagrangean approach to the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separator problem: a polyhedral investigation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing Matrices into Blocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal rectangular partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relax-and-cut algorithm for the set partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower and upper bounds for the degree-constrained minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separator problem: algorithms and computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non delayed relax-and-cut algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stronger \(K\)-tree relaxations for the vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An enhanced TSP-based heuristic for makespan minimization in a flow shop with setup times / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:41, 4 July 2024

scientific article
Language Label Description Also known as
English
Exact algorithms for the vertex separator problem in graphs
scientific article

    Statements

    Exact algorithms for the vertex separator problem in graphs (English)
    0 references
    0 references
    0 references
    22 June 2011
    0 references
    0 references
    Lagrangian relaxation
    0 references
    cutting planes
    0 references
    integer programming
    0 references
    relax-and-cut
    0 references
    vertex separator problem
    0 references
    0 references