Vertex adjacencies in the set covering polyhedron-Reference-Cited by-同舟云学术

Vertex adjacencies in the set covering polyhedron

Published:2017-02 Issue: Volume:218 Page:40-56
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Aguilera Néstor E.,Katz Ricardo D.,Tolomei Paola B.

Funder

Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Argentina

Universidad Nacional de Rosario (UNR), Argentina

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference22 articles.

1. Adjacency on the constrained assignment problem;Alfakih;Discrete Appl. Math.,1998

2. Cyclic scheduling via integer programs with circular ones;Bartholdi;Oper. Res.,1980

3. T. Christof, A. Löbel, PORTA: Polyhedron representation transformation algorithm, 1997. URL http://www2.iwr.uni-heidelberg.de/groups/comopt/software/PORTA/.

4. Structural Complexity of Adjacency on 0-1 Polytopes;Chung,1980

5. On certain polytopes associated with graphs;Chvátal;J. Combin. Theory Ser. B,1975

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming;Journal of Combinatorial Optimization;2024-07

2. Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-Regular Multigraph;Automatic Control and Computer Sciences;2022-12

3. An Iterative ILP Approach for Constructing a Hamiltonian Decomposition of a Regular Multigraph;Communications in Computer and Information Science;2021

4. Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search;Journal of Combinatorial Optimization;2020-09-30

5. Simulated Annealing Approach to Verify Vertex Adjacencies in the Traveling Salesperson Polytope;Mathematical Optimization Theory and Operations Research;2019