The following pages link to Daniel Granot (Q233531):
Displaying 50 items.
- On graphs which can or cannot induce Chinese Postman games with a non-empty core (Q442225) (← links)
- The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game (Q477339) (← links)
- The reactive bargaining set for cooperative games (Q532720) (← links)
- On Chinese postman games where residents of each road pay the cost of their road (Q550185) (← links)
- Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope (Q761350) (← links)
- On sequential commitment in the price-dependent newsvendor model (Q856285) (← links)
- On competitive sequential location in a network with a decreasing demand intensity (Q976444) (← links)
- The Pareto set of the partition bargaining problem (Q1192627) (← links)
- Training and job search in the labor market (Q1197884) (← links)
- A primal algorithm for interval linear-programming problems (Q1247801) (← links)
- On some optimization problems on \(k\)-trees and partial \(k\)-trees (Q1315461) (← links)
- The reactive bargaining set: Structure, dynamics and extension to NTU games (Q1357214) (← links)
- The reactive bargaining set of some flow games and of superadditive simple games (Q1358630) (← links)
- Voting for voters: the unanimity case (Q1414442) (← links)
- On the equivalence between some local and global Chinese postman and traveling salesman graphs (Q1421461) (← links)
- A tabu search algorithm for finding good forest harvest schedules satisfying green-up constraints (Q1609903) (← links)
- An auction with positive externality and possible application to overtime rules in football, soccer, and chess (Q1667164) (← links)
- A dynamic price-only contract: exact and asymptotic results (Q1728368) (← links)
- (Q1914095) (redirect page) (← links)
- The kernel/nucleolus of a standard tree game (Q1914097) (← links)
- On some balanced, totally balanced and submodular delivery games (Q1961984) (← links)
- Naturally submodular digraphs and forbidden digraph configurations (Q1962020) (← links)
- Characterization sets for the nucleolus (Q1972591) (← links)
- Spanning network games. (Q1972602) (← links)
- My referee and collaborator (Q2519458) (← links)
- Ordered optimal solutions and parametric minimum cut problems (Q2568331) (← links)
- On cost allocation in communication networks (Q3032107) (← links)
- Formation of Alliances in Internet-Based Supply Exchanges (Q3115435) (← links)
- Competition and Cooperation in Decentralized Push and Pull Assembly Systems (Q3117700) (← links)
- Covering Relaxation for Positive 0-1 Polynomial Programs (Q3205016) (← links)
- On the core and nucleolus of minimum cost spanning tree games (Q3329250) (← links)
- Application of Mathematical Programming to the Plywood Design and Manufacturing Problem (Q3342195) (← links)
- A new exchange property for matroids and its application to max-min-problems (Q3342227) (← links)
- A Note on the Room-Mates Problem and a Related Revenue Allocation Problem (Q3343811) (← links)
- NC Algorithms for Recognizing Partial 2-Trees and 3-Trees (Q3358764) (← links)
- (Q3374471) (← links)
- Price and Order Postponement in a Decentralized Newsvendor Model with Multiplicative and Price-Dependent Demand (Q3392160) (← links)
- On the effectiveness of returns policies in the price-dependent newsvendor model (Q3442915) (← links)
- A Three-Stage Model for a Decentralized Distribution System of Retailers (Q3637388) (← links)
- On market prices in linear production games (Q3688051) (← links)
- A generalized linear production model: A unifying model (Q3743164) (← links)
- The Role of Cost Allocation in Locational Models (Q3773669) (← links)
- Technical Note—Generalized Covering Relaxation for 0-1 Programs (Q3893670) (← links)
- Minimum cost spanning tree games (Q3911709) (← links)
- An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs (Q3932587) (← links)
- Duality and Pricing in Multiple Right-Hand Choice Linear Programming Problems (Q3964319) (← links)
- The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games (Q3964354) (← links)
- On Some Network Flow Games (Q4027792) (← links)
- Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem (Q4027794) (← links)
- On Improving Bounds For Variables In Linear Integer Programs By Surrogate Constraints (Q4090118) (← links)
