The following pages link to Frieda Granot (Q233532):
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)
- Structural and algorithmic properties for parametric minimum cuts (Q715078) (← links)
- Some proximity and sensitivity results in quadratic integer programming (Q751508) (← links)
- Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope (Q761350) (← links)
- Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm (Q909582) (← links)
- On competitive sequential location in a network with a decreasing demand intensity (Q976444) (← links)
- Multi-terminal maximum flows in node-capacitated networks (Q1085773) (← links)
- Non-linear integer programming: Sensitivity analysis for branch and bound (Q1099075) (← links)
- A parametric analysis of a nonlinear asset allocation management model (Q1196213) (← links)
- On the integral plane two-commodity flow problem (Q1197891) (← links)
- On polynomial solvability of the high multiplicity total weighted tardiness problem (Q1208472) (← links)
- A primal algorithm for interval linear-programming problems (Q1247801) (← links)
- On the equivalence of constrained and unconstrained flows (Q1339398) (← links)
- The reactive bargaining set of some flow games and of superadditive simple games (Q1358630) (← links)
- On the integral 4-packing of \(T\)-cuts (Q1896345) (← links)
- Naturally submodular digraphs and forbidden digraph configurations (Q1962020) (← links)
- Characterization sets for the nucleolus (Q1972591) (← links)
- On simultaneous approximation in quadratic integer programming (Q2314408) (← links)
- Polynomial algorithms for (integral) maximum two-flows in vertex\(\backslash\)edge-capacitated planar graphs (Q2563924) (← links)
- Qualitative Sensitivity Analysis in Monotropic Programming (Q2757560) (← links)
- Covering Relaxation for Positive 0-1 Polynomial Programs (Q3205016) (← links)
- Substitutes, Complements and Ripples in Network Flows (Q3698612) (← links)
- Technical Note—Generalized Covering Relaxation for 0-1 Programs (Q3893670) (← links)
- An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs (Q3932587) (← links)
- Note—Efficient Heuristic Algorithms for Positive 0-1 Polynomial Programming Problems (Q3941192) (← links)
- Duality and Pricing in Multiple Right-Hand Choice Linear Programming Problems (Q3964319) (← links)
- On Some Network Flow Games (Q4027792) (← links)
- Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem (Q4027794) (← links)
- (Q4085493) (← links)
- On Improving Bounds For Variables In Linear Integer Programs By Surrogate Constraints (Q4090118) (← links)
- Technical Note—Approximations for a Service System with Nonindependent Interarrival Times (Q4102558) (← links)
- On Solving Fractional (0, 1) Programs By Implicit Enumeration (Q4113594) (← links)
- (Q4114943) (← links)
- (Q4132256) (← links)
- A note on explicit solution in linear fractional programming (Q4132278) (← links)
- (Q4136950) (← links)
- (Q4147888) (← links)
- Technical Note—On Intersection Cuts in Interval Integer Linear Programming (Q4149223) (← links)
- An Algorithm for Solving Interval Linear Programming Problems (Q4165154) (← links)
- (Q4234146) (← links)
- Ripples, complements, and substitutes in singly constrained monotropic parametric network flow problems (Q4305123) (← links)
- (Q4395417) (← links)
- Substitutes, complements, and ripples in multicommodity flows on suspension graphs (Q4642469) (← links)
- A Parametric Analysis of a Constrained Nonlinear Inventory-production Model (Q4834359) (← links)
- (Q4887740) (← links)
- Monotonicity and conformality in multicommodity network‐flow problems (Q5241429) (← links)
- Dynamic pricing under first order Markovian competition (Q5300455) (← links)
- (Q5668612) (← links)
- Ripples, complements, and substitutes in generalized networks (Q5687895) (← links)
