A Polynomial-Time Algorithm for a Stable Matching Problem With Linear Valuations and Bounded Side Payments

Japan Journal of Industrial and Applied Mathematics - Japan
doi 10.1007/bf03167514
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns

IEEE/ACM Transactions on Computational Biology and Bioinformatics
BiotechnologyApplied MathematicsGenetics
2004English

A Polynomial-Time Algorithm for the Paired-Domination Problem on Permutation Graphs

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2009English

A Polynomial Projection-Type Algorithm for Linear Programming

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
2014English

A Polynomial Algorithm for the Membership Problem With Categorial Grammars

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1996English

A Polynomial Time Algorithm to Compute Quantum Invariants of 3-Manifolds With Bounded First Betti Number.

2017English

A Polynomial Time Algorithm for Fault Diagnosability

1984English

Stable Matching With Uncertain Linear Preferences

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2019English

Realizing a Sub-Linear Time String-Matching Algorithm With a Hardware Accelerator Using Bloom Filters

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
HardwareElectronic EngineeringElectricalArchitectureSoftware
2009English

Bounded Primal Simplex Algorithm for Bounded Linear Programming With Fuzzy Cost Coefficients

International Journal of Operations Research and Information Systems
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy