scientific article; zbMATH DE number 2243360
From MaRDI portal
Publication:5715669
zbMath1081.90055arXiv1107.0055MaRDI QIDQ5715669
Publication date: 4 January 2006
Full work available at URL: https://arxiv.org/abs/1107.0055
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Combinatorial probability (60C05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Dynamic and nonequilibrium phase transitions (general) in statistical mechanics (82C26)
Related Items (10)
The complete parsimony haplotype inference problem and algorithms based on integer programming, branch-and-bound and Boolean satisfiability ⋮ Discovering the suitability of optimisation algorithms by learning from evolved instances ⋮ Leveraging cluster backbones for improving MAP inference in statistical relational models ⋮ Instance-specific multi-objective parameter tuning based on fuzzy logic ⋮ Empirical Study of Phase Transition of Hamiltonian Cycle Problem in Random Graphs with Degrees Greater Than One ⋮ Cut-and-solve: An iterative search strategy for combinatorial optimization problems ⋮ Backbone analysis and algorithm design for the quadratic assignment problem ⋮ Unique optimal solution instance and computational complexity of backbone in the graph bi-partitioning problem ⋮ Measuring instance difficulty for combinatorial optimization problems ⋮ Iterative patching and the asymmetric traveling salesman problem
This page was built for publication:
