The unsplittable stable marriage problem

The Gale-Shapley "propose/reject" algorithm is a wellknown procedure for solving the classical stable marriage problem. In this paper we study this algorithm in the context of the many-to-many stable marriage problem, also known as the stable allocation or ordinal transportation problem. W...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Dean, Brian C., Goemans, Michel X., Immorlica, Nicole
Formato:	Objeto de conferencia
Lenguaje:	Inglés
Publicado:	2006
Materias:	Ciencias Informáticas Gale- Shapley algorithm stable marriage problem Algorithms
Acceso en línea:	http://sedici.unlp.edu.ar/handle/10915/24374
Aporte de:	SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

Coupling REPMAC with FDA to solve highly imbalanced classification problems
por: Ahumada, Hernán César, et al.
Publicado: (2008)

A self-adaptive recombination method in evolutionary algorithms for solving epistatic problems
por: Stark, Natalia, et al.
Publicado: (2011)

The stable marriage problem : structure and algorithms /
por: Gusfield, Dan
Publicado: (1989)

Cellular memetic algorithms
por: Alba Torres, Enrique, et al.
Publicado: (2005)

An immune artificial algorithm for dynamic optimization problems: a case of study
por: Aragón, Victoria S., et al.
Publicado: (2009)

Hybrid evolutionary algorithms to solve scheduling problems
por: Minetti, Gabriela F., et al.
Publicado: (2002)

Adding problem-specific knowledge in evolutionary algorithms to solve W-T scheduling problems
por: San Pedro, María Eugenia de, et al.
Publicado: (2002)

Studs and immigrants in multirecombined evolutionary algorithm to face weighted tardiness scheduling problems
por: Pandolfi, Daniel, et al.
Publicado: (2001)

Algorithms to solve the dynamic weighted tardiness problem
por: Lasso, Marta Graciela, et al.
Publicado: (2002)

A randomized algorithm for solving the satisfiability problem
por: Cecchi, Laura
Publicado: (1997)

A note on the Cornaz-Jost transformation to solve the graph coloring problem
por: Bonomo, F., et al.

A note on the Cornaz-Jost transformation to solve the graph coloring problem
por: Bonomo, Flavia
Publicado: (2013)

Evolutionary algorithms whit studs and random immigrants to solve E/T scheduling problems
por: San Pedro, María Eugenia de, et al.
Publicado: (2001)

Solving the two dimensional cutting problem using evolutionary algorithms with penalty functions
por: Beraudo, Vanina, et al.
Publicado: (2005)

An efficient evolutionary algorithm for the deadline problem in project management
por: Galnare, Matías, et al.
Publicado: (2012)

Solving unrestricted parallel machine scheduling problems via evolutionary algorithms
por: Gatica, Claudia Ruth, et al.
Publicado: (2003)

Inserting problem-specific knowledge in multirecombined evolutionary algorithms
por: Pandolfi, Daniel, et al.
Publicado: (2002)

Solving the single machine scheduling problem with sequence-dependent set-up times as a TSP via evolutionary algorithms
por: Minetti, Gabriela F., et al.
Publicado: (2001)

Facing the job shop scheduling problem wih hybrid evolutionary algorithms
por: Salto, Carolina, et al.
Publicado: (2001)

Multirecombining random and seed immigrants in evolutionary algorithms to face the shop scheduling problem
por: Vilanova, Gabriela, et al.
Publicado: (2002)

Evolutionary algorithms to solve the school timetabling problem
por: Fernandez, Natalia, et al.
Publicado: (2002)

A comparison of recombination operators for capacitate vehicle routing problem
por: Graglia, Patricia, et al.
Publicado: (2008)

Marriage and family living
Publicado: (1941)

Incest prevention and multicore combinated evolutionary algorithms for the job shop scheduling problem
por: Salto, Carolina, et al.
Publicado: (2001)

A faster algorithm for the cluster editing problem on proper interval graphs
por: Lin, M.C., et al.

Heurística para TSP-2d euclideo y simétrico basadas en la triangulación de Delaunay y sus subgrafos
por: Krasnogor, Natalio
Publicado: (1997)

A Metaheuristic Compendium for Scheduling Problems
por: Bermúdez, Carlos, et al.
Publicado: (2017)

A faster algorithm for the cluster editing problem on proper interval graphs
Publicado: (2015)

A comparison of different recombination operators for the 2-dimensional strip packing problem
por: Salto, Carolina
Publicado: (2006)

Cellular memetic algorithms evaluated on SAT
por: Alba Torres, Enrique, et al.
Publicado: (2005)

Minimizing marriage marriage, morality, and the law /
por: Brake, Elizabeth
Publicado: (2012)

A study of genotype and phenotype distributions in hybrid evolutionary algorithms to solve the flow shop scheduling problem
por: Minetti, Gabriela F., et al.
Publicado: (2002)

Multi-PBil: an estimation distribution algorithm applied to multimodal optimization problems
por: Barbosa Filho, Rubens
Publicado: (2006)

Journal of marriage and the family
Publicado: (1964)

Two new feature selection algorithms with rough sets theory
por: Caballero, Yailé, et al.
Publicado: (2006)

Greedy seeding procedure for GAs solving a strip packing problem
por: Salto, Carolina, et al.
Publicado: (2007)

Evolutionary optimization in non-stationary environments
por: Trojanowski, Krzysztof, et al.
Publicado: (2000)

The ant colony metaphor for multiple knapsack problem
por: Cena, Marcelo Guillermo, et al.
Publicado: (2000)

Stable solutions for equations with a quadratic gradient term
por: Terra, J.

Stable solutions for equations with a quadratic gradient term
Publicado: (2016)