Jadranka Skorin-Kapov

Available identifiers

zbMath Open skorin-kapov.jadrankaMaRDI QIDQ751507

List of research outcomes

Publication	Date of Publication	Type
On simultaneous approximation in quadratic integer programming	2019-07-22	Paper
A note on Steiner tree games	2012-06-18	Paper
https://portal.mardi4nfdi.de/entity/Q5294064	2007-07-23	Paper
Threshold based discounting networks: the cost allocation provided by the nucleolus	2005-06-01	Paper
Genetic algorithm for network cost minimization using threshold based discounting	2005-04-05	Paper
https://portal.mardi4nfdi.de/entity/Q4780560	2003-03-12	Paper
https://portal.mardi4nfdi.de/entity/Q4432421	2003-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4783479	2002-12-04	Paper
Network cost minimization using threshold-based discounting	2002-06-16	Paper
On delay versus congestion in designing rearrangeable multihop lightware networks	2002-01-30	Paper
Training artificial neural networks: Backpropagation via nonlinear optimization	2001-11-19	Paper
https://portal.mardi4nfdi.de/entity/Q4835590	2000-07-06	Paper
https://portal.mardi4nfdi.de/entity/Q4250428	1999-09-15	Paper
Tight linear programming relaxations of uncapacitated \(p\)-hub median problems	1999-04-22	Paper
https://portal.mardi4nfdi.de/entity/Q4383982	1998-04-13	Paper
https://portal.mardi4nfdi.de/entity/Q5688123	1997-03-11	Paper
On minimum congestion routing in rearrangeable multihop lightwave networks	1996-09-01	Paper
Lower Bounds for the Hub Location Problem	1996-01-07	Paper
Extensions of a tabu search adaptation to the quadratic assignment problem	1995-05-15	Paper
https://portal.mardi4nfdi.de/entity/Q4321553	1995-01-23	Paper
A Constructive Method for Improving Lower Bounds for a Class of Quadratic Assignment Problems	1995-01-12	Paper
On tabu search for the location of interacting hub facilities	1994-07-26	Paper
Massively parallel tabu search for the quadratic assignment problem	1993-08-16	Paper
On polynomial solvability of the high multiplicity total weighted tardiness problem	1993-05-16	Paper
Tabu Search Applied to the Quadratic Assignment Problem	1993-01-16	Paper
A connectionist approach to the quadratic assignment problem	1993-01-16	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

Research outcomes over time

This page was built for person: Jadranka Skorin-Kapov