The following pages link to Ioannis Mourtos (Q266030):
Displaying 24 items.
- Cardinality constraints and systems of restricted representatives (Q266031) (← links)
- Pareto optimal matchings in many-to-many markets with ties (Q506537) (← links)
- On matroid parity and matching polytopes (Q777400) (← links)
- Efficiency decompositions for heterogeneous technologies (Q1042125) (← links)
- The stable \(b\)-matching polytope revisited (Q1801060) (← links)
- A hierarchical adaptive distributed algorithm for load balancing (Q1878706) (← links)
- (Un)stable matchings with blocking costs (Q2060342) (← links)
- Logic-based benders decomposition for an inter-modal transportation problem (Q2117232) (← links)
- The diameter of the stable marriage polytope: bounding from below (Q2305917) (← links)
- Pareto optimality in many-to-many matching problems (Q2339842) (← links)
- Fast separation for the three-index assignment problem (Q2398106) (← links)
- Blockers and antiblockers of stable matchings (Q2637344) (← links)
- Generalised 2-circulant inequalities for the max-cut problem (Q2670485) (← links)
- Stable allocations and partially ordered sets (Q2684044) (← links)
- Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem (Q2815443) (← links)
- Finding a minimum-regret many-to-many Stable Matching (Q2868914) (← links)
- Fast Separation Algorithms for Three-Index Assignment Problems (Q3167624) (← links)
- Pareto Optimal Matchings in Many-to-Many Markets with Ties (Q3449579) (← links)
- Tight LP-Relaxations of Overlapping Global Cardinality Constraints (Q4922926) (← links)
- Polyhedral Aspects of Stable Marriage (Q5244861) (← links)
- From One Stable Marriage to the Next: How Long Is the Way? (Q5246098) (← links)
- (Q5494214) (← links)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Q5713885) (← links)
- On Pareto optimal balanced exchanges (Q6564189) (← links)
