An Evolutionary Algorithm for the Sequence Coordination in Furniture Production
SAGA '01 Proceedings of the International Symposium on Stochastic Algorithms: Foundations and Applications
Minimal Sample Databases for Global Cardinality Constraints
FoIKS '02 Proceedings of the Second International Symposium on Foundations of Information and Knowledge Systems
Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
The Complexity of Maximum Matroid-Greedoid Intersection
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Canonical modules of certain edge subrings
European Journal of Combinatorics
A Set Theoretic Approach to Dynamic Robot Localization and Mapping
Autonomous Robots
Faster and better global placement by a new transportation algorithm
Proceedings of the 42nd annual Design Automation Conference
Online resource management in a multiprocessor with a network-on-chip
Proceedings of the 2007 ACM symposium on Applied computing
Evolutionary algorithms and matroid optimization problems
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Approximation algorithms for a facility location problem with service capacities
ACM Transactions on Algorithms (TALG)
The Cost of Learning Directed Cuts
ECML '07 Proceedings of the 18th European conference on Machine Learning
Sorting Cancer Karyotypes by Elementary Operations
RECOMB-CG '08 Proceedings of the international workshop on Comparative Genomics
The labeled maximum matching problem
Computers and Operations Research
Multi-dimensional online tracking
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximation algorithms for orthogonal packing problems for hypercubes
Theoretical Computer Science
Asymmetric information distances for automated taxonomy construction
Knowledge and Information Systems
Resource allocation optimization for OFDM-based amplify-and-forward multi-relay system
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Dynamic vehicle routing with moving demands: part i: low speed demands and high arrival rates
ACC'09 Proceedings of the 2009 conference on American Control Conference
H2analysis and synthesis of networked dynamic systems
ACC'09 Proceedings of the 2009 conference on American Control Conference
The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization
Discrete Applied Mathematics - Special issue: Efficient algorithms
Heuristic initialization for bipartite matching problems
Journal of Experimental Algorithmics (JEA)
The Floyd--Warshall algorithm on graphs with negative cycles
Information Processing Letters
Spectral-Driven Isometry-Invariant Matching of 3D Shapes
International Journal of Computer Vision
Algorithm for two disjoint long paths in 2-connected graphs
Theoretical Computer Science
The community-search problem and how to plan a successful cocktail party
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Solving bus terminal location problems using evolutionary algorithms
Applied Soft Computing
Test Case Generation for Adequacy of Floating-point to Fixed-point Conversion
Electronic Notes in Theoretical Computer Science (ENTCS)
On dual decomposition and linear programming relaxations for natural language processing
EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
Dual decomposition for parsing with non-projective head automata
EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
A foresighted strategy for greed-based multicasting algorithms in all-optical mesh networks
Photonic Network Communications
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Computing pure Nash and strong equilibria in bottleneck congestion games
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Approximation schemes for multi-budgeted independence systems
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Resource allocation strategies for a multi sensor surveillance
CTS'05 Proceedings of the 2005 international conference on Collaborative technologies and systems
Efficient skyline evaluation over partially ordered domains
Proceedings of the VLDB Endowment
Modeling Network Transition Constraints with Hypergraphs
Transportation Science
Track routing optimizing timing and yield
Proceedings of the 16th Asia and South Pacific Design Automation Conference
Fault diameters of graph products and bundles
ICCOMP'10 Proceedings of the 14th WSEAS international conference on Computers: part of the 14th WSEAS CSCC multiconference - Volume II
Data generation using declarative constraints
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Dual decomposition for natural language processing
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Tutorial Abstracts of ACL 2011
Exact decoding of syntactic translation models through Lagrangian relaxation
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
An LP-based heuristic algorithm for the node capacitated in-tree packing problem
Computers and Operations Research
Unsupervised clustering of multidimensional distributions using earth mover distance
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Evaluation of a first-order primal-dual algorithm for MRF energy minimization
EMMCVPR'11 Proceedings of the 8th international conference on Energy minimization methods in computer vision and pattern recognition
On totally unimodularity of edge-edge adjacency matrices
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Task ordering and memory management problem for degree of parallelism estimation
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Seeking global edges for traveling salesman problem in multi-start search
Journal of Global Optimization
Approximation results for a min-max location-routing problem
Discrete Applied Mathematics
Editing graphs to satisfy degree constraints: A parameterized approach
Journal of Computer and System Sciences
Addressing new challenges by building security protocols around graphs
Proceedings of the 11th international conference on Security Protocols
Optimal path planning for surveillance with temporal-logic constraints*
International Journal of Robotics Research
Statistical priors for efficient combinatorial optimization via graph cuts
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part III
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Approximation algorithms for network design and facility location with service capacities
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Multidimensional online tracking
ACM Transactions on Algorithms (TALG)
Probabilistic subgraph matching based on convex relaxation
EMMCVPR'05 Proceedings of the 5th international conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
Packing cycles exactly in polynomial time
Journal of Combinatorial Optimization
Prize-Collecting steiner network problems
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
On generalizations of network design problems with degree bounds
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Structured Learning and Prediction in Computer Vision
Foundations and Trends® in Computer Graphics and Vision
Robotic load balancing for mobility-on-demand systems
International Journal of Robotics Research
A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
Operations Research Letters
An analysis of the extended Christofides heuristic for the k-depot TSP
Operations Research Letters
Greedy-type resistance of combinatorial problems
Discrete Optimization
Geometric quadrisection in linear time, with application to VLSI placement
Discrete Optimization
Selective graph coloring in some special classes of graphs
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
An improved approximation algorithm for the clustered traveling salesman problem
Information Processing Letters
Isometry-invariant matching of point set surfaces
EG 3DOR'08 Proceedings of the 1st Eurographics conference on 3D Object Retrieval
Prize-collecting steiner network problems
ACM Transactions on Algorithms (TALG)
IEEE/ACM Transactions on Networking (TON)
ACM Computing Surveys (CSUR)
A co-dependent value-based mechanism for the internet advertisement auction
PRIMA'11 Proceedings of the 14th international conference on Agent Based Simulation for a Sustainable Society and Multi-agent Smart Computing
Journal of Artificial Intelligence Research
Modelling Convex Shape Priors and Matching Based on the Gromov-Wasserstein Distance
Journal of Mathematical Imaging and Vision
Matching problems with delta-matroid constraints
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
A matroid approach to the worst case allocation of indivisible goods
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Scheduling highly available applications on cloud environments
Future Generation Computer Systems
A note on anti-coordination and social interactions
Journal of Combinatorial Optimization
Hi-index | 0.00 |
This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimization and more special topics at graduate level. It contains complete but concise proofs, also for many deep results, some of which did not appear in a textbook before. Many very recent topics are covered as well, and many references are provided. Thus this book represents the state of the art of combinatorial optimization. This fourth edition is again significantly extended, most notably with new material on linear programming, the network simplex algorithm, and the max-cut problem. Many further additions and updates are included as well. From the reviews of the previous editions: "This book on combinatorial optimization is a beautiful example of the ideal textbook." Operations Research Letters 33 (2005), p.216-217 "The second edition (with corrections and many updates) of this very recommendable book documents the relevant knowledge on combinatorial optimization and records those problems and algorithms that define this discipline today. To read this is very stimulating for all the researchers, practitioners, and students interested in combinatorial optimization." OR News 19 (2003), p.42 "... has become a standard textbook in the field." Zentralblatt MATH 1099.90054