Embedding signed graphs in the line
From MaRDI portal
Publication:2253962
DOI10.1007/s10878-013-9604-1zbMath1316.90058OpenAlexW1649401869MaRDI QIDQ2253962
Eduardo G. Pardo, Christopher Thraves, Mauricio Soto
Publication date: 16 February 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-013-9604-1
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (4)
Node set optimization problem for complete Josephus cubes ⋮ The dimension of valid distance drawings of signed graphs ⋮ The weighted sitting closer to friends than enemies problem in the line ⋮ A general variable neighborhood search for the cyclic antibandwidth problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Correlation clustering
- An improved annealing scheme for the QAP
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- QAPLIB-A quadratic assignment problem library
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- A survey for the quadratic assignment problem
- A probabilistic heuristic for a computationally difficult set covering problem
- A simple algorithm to detect balance in signed graphs
- The quadratic assignment problem. Theory and algorithms
- Greedy randomized adaptive search procedures
- On the notion of balance of a signed graph
- Sitting Closer to Friends Than Enemies, Revisited
- Can Everybody Sit Closer to Their Friends Than Their Enemies?
- Assignment Problems and the Location of Economic Activities
- Tabu Search Applied to the Quadratic Assignment Problem
- P-Complete Approximation Problems
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
This page was built for publication: Embedding signed graphs in the line
