Frieda Granot

Available identifiers

zbMath Open granot.friedaMaRDI QIDQ233532

List of research outcomes

Publication	Date of Publication	Type
Monotonicity and conformality in multicommodity network‐flow problems	2019-10-31	Paper
On simultaneous approximation in quadratic integer programming	2019-07-22	Paper
Substitutes, complements, and ripples in multicommodity flows on suspension graphs	2018-05-23	Paper
The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game	2014-12-03	Paper
Dynamic pricing under first order Markovian competition	2013-06-27	Paper
Structural and algorithmic properties for parametric minimum cuts	2012-10-15	Paper
On graphs which can or cannot induce Chinese Postman games with a non-empty core	2012-08-10	Paper
On competitive sequential location in a network with a decreasing demand intensity	2010-06-11	Paper
The vehicle routing problem with pickups and deliveries on some special graphs	2002-03-06	Paper
Qualitative Sensitivity Analysis in Monotropic Programming	2001-11-26	Paper
https://portal.mardi4nfdi.de/entity/Q4234146	2000-10-10	Paper
Naturally submodular digraphs and forbidden digraph configurations	2000-07-05	Paper
Characterization sets for the nucleolus	2000-04-11	Paper
https://portal.mardi4nfdi.de/entity/Q4395417	1998-12-02	Paper
Ripples, complements, and substitutes in generalized networks	1997-10-20	Paper
The reactive bargaining set of some flow games and of superadditive simple games	1997-07-03	Paper
Polynomial algorithms for (integral) maximum two-flows in vertex\(\backslash\)edge-capacitated planar graphs	1997-01-06	Paper
Forest Management: A Multicommodity Flow Formulation and Sensitivity Analysis	1997-01-06	Paper
https://portal.mardi4nfdi.de/entity/Q4887740	1996-08-05	Paper
On the integral 4-packing of \(T\)-cuts	1995-08-27	Paper
A Parametric Analysis of a Constrained Nonlinear Inventory-production Model	1995-05-28	Paper
Ripples, complements, and substitutes in singly constrained monotropic parametric network flow problems	1995-01-31	Paper
On the equivalence of constrained and unconstrained flows	1994-12-01	Paper
On polynomial solvability of the high multiplicity total weighted tardiness problem	1993-05-16	Paper
On Some Network Flow Games	1993-03-01	Paper
Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem	1993-03-01	Paper
On the integral plane two-commodity flow problem	1993-01-16	Paper
A parametric analysis of a nonlinear asset allocation management model	1992-12-17	Paper
Some proximity and sensitivity results in quadratic integer programming	1990-01-01	Paper
Towards a strongly polynomial algorithm for strictly convex quadratic programs: An extension of Tardos' algorithm	1990-01-01	Paper
Non-linear integer programming: Sensitivity analysis for branch and bound	1987-01-01	Paper
Multi-terminal maximum flows in node-capacitated networks	1986-01-01	Paper
Substitutes, Complements and Ripples in Network Flows	1985-01-01	Paper
Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope	1984-01-01	Paper
An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs	1982-01-01	Paper
Note—Efficient Heuristic Algorithms for Positive 0-1 Polynomial Programming Problems	1982-01-01	Paper
Duality and Pricing in Multiple Right-Hand Choice Linear Programming Problems	1982-01-01	Paper
Technical Note—Generalized Covering Relaxation for 0-1 Programs	1980-01-01	Paper
Covering Relaxation for Positive 0-1 Polynomial Programs	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4147888	1978-01-01	Paper
A primal algorithm for interval linear-programming problems	1977-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4132256	1977-01-01	Paper
Technical Note—On Intersection Cuts in Interval Integer Linear Programming	1977-01-01	Paper
An Algorithm for Solving Interval Linear Programming Problems	1977-01-01	Paper
On Solving Fractional (0, 1) Programs By Implicit Enumeration	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4114943	1976-01-01	Paper
A note on explicit solution in linear fractional programming	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4136950	1976-01-01	Paper
On Improving Bounds For Variables In Linear Integer Programs By Surrogate Constraints	1975-01-01	Paper
Technical Note—Approximations for a Service System with Nonindependent Interarrival Times	1975-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4085493	1974-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5668612	1972-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Frieda Granot