A Theory and Algorithms for Combinatorial Reoptimization

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-29344-3_52
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

A Theory and Algorithms for Combinatorial Reoptimization

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2017English

Combinatorial Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Bidding Algorithms for a Distributed Combinatorial Auction

2007English

Matching Theory for Combinatorial Geometries

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1971English

High-Performance Combinatorial Algorithms

2003English

Explicit Combinatorial Structures for Cooperative Distributed Algorithms

English

Exact Combinatorial Algorithms and Experiments for Finding Maximum K-Plexes

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2011English

Approximation Algorithms for Combinatorial Auctions With Complement-Free Bidders

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
2010English

A Hybrid Model of Evolutionary Algorithms and Branch-And-Bound for Combinatorial Optimization Problems

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy