Person:293329: Difference between revisions

From MaRDI portal
Person:293329
Created automatically from import231006081045
 
m AuthorDisambiguator moved page Abraham P. Punnen to Abraham P. Punnen: Duplicate
 
(No difference)

Latest revision as of 20:56, 10 December 2023

Available identifiers

zbMath Open punnen.abraham-pMaRDI QIDQ293329

List of research outcomes

PublicationDate of PublicationType
Solving dynamic satellite image data downlink scheduling problem via an adaptive bi-objective optimization algorithm2023-11-13Paper
A three-phase matheuristic algorithm for the multi-day task assignment problem2023-09-13Paper
https://portal.mardi4nfdi.de/entity/Q58882482023-04-24Paper
Introduction to QUBO2022-11-15Paper
Complexity and Polynomially Solvable Special Cases of QUBO2022-11-15Paper
Mathematical Programming Models and Exact Algorithms2022-11-15Paper
Fast Heuristics and Approximation Algorithms2022-11-15Paper
The Bipartite QUBO2022-11-15Paper
QUBO Software2022-11-15Paper
The Rank-One Quadratic Assignment Problem2022-06-27Paper
The bipartite Boolean quadric polytope2022-06-09Paper
Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms2021-01-07Paper
A class of exponential neighbourhoods for the quadratic travelling salesman problem2020-07-29Paper
Combinatorial optimization with interaction costs: complexity and solvable cases2019-11-28Paper
Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems2019-10-18Paper
Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis2019-02-22Paper
The generalized vertex cover problem and some variations2019-01-14Paper
A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems2018-08-17Paper
The quadratic minimum spanning tree problem and its variations2018-08-17Paper
The Boolean quadratic programming problem with generalized upper bound constraints2018-07-11Paper
Clustered maximum weight clique problem: algorithms and empirical analysis2018-07-11Paper
Markov chain methods for the bipartite Boolean quadratic programming problem2018-05-29Paper
A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions2018-05-24Paper
A characterization of linearizable instances of the quadratic minimum spanning tree problem2018-03-01Paper
The bilinear assignment problem: complexity and polynomially solvable special cases2017-12-01Paper
On a linearization technique for solving the quadratic set covering problem and variations2017-11-09Paper
Quadratic bottleneck knapsack problems2017-06-27Paper
Experimental analysis of heuristics for the bottleneck traveling salesman problem2017-04-04Paper
The minimum cost perfect matching problem with conflict pair constraints2016-11-14Paper
The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis2016-11-10Paper
The bipartite quadratic assignment problem and extensions2016-10-07Paper
Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs2016-07-06Paper
A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph2016-06-09Paper
https://portal.mardi4nfdi.de/entity/Q55013132015-08-03Paper
The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases2015-07-24Paper
The quadratic balanced optimization problem2015-04-09Paper
Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms2014-12-22Paper
https://portal.mardi4nfdi.de/entity/Q28658652013-12-11Paper
Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs2013-08-16Paper
Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem2012-12-28Paper
Spanning cactus of a graph: Existence, extension, optimization, and approximation2012-11-22Paper
Heuristic algorithms for the bipartite unconstrained 0-1 quadratic programming problem2012-10-13Paper
The minimum spanning tree problem with conflict constraints and its variations2012-06-20Paper
An O(n4) Algorithm for the QAP Linearization Problem2012-05-24Paper
Three value TSP and linkages with the three value linear spanning 2-forests2012-03-19Paper
Strong and weak edges of a graph and linkages with the vertex cover problem2012-03-19Paper
https://portal.mardi4nfdi.de/entity/Q29987952011-05-10Paper
Quadratic bottleneck problems2011-04-14Paper
On generalized balanced optimization problems2011-03-02Paper
The balanced traveling salesman problem2010-12-23Paper
SC-Hamiltonicity and Its Linkages with Strong Hamiltonicity of a Graph2010-12-03Paper
SC-Hamiltonian graphs and digraphs: new necessary conditions and their impacts2010-10-19Paper
A simplex algorithm for network flow problems with piecewise linear fractional objective function2010-09-22Paper
On the Approximability of the Vertex Cover and Related Problems2010-07-20Paper
Bottleneck flows in unit capacity networks2010-06-16Paper
The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm2010-06-11Paper
An efficient heuristic algorithm for the bottleneck traveling salesman problem2010-03-15Paper
The bottleneck \(k\)-MST2009-12-04Paper
Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem2009-11-23Paper
Integer Programming: Optimization and Evaluation Are Equivalent2009-10-20Paper
An edge-reduction algorithm for the vertex cover problem2009-08-14Paper
A strongly polynomial simplex method for the linear fractional assignment problem2009-03-04Paper
Very large-scale variable neighborhood search for the generalized assignment problem2009-02-24Paper
Anti-stalling Pivot Rule for Linear Programs with Totally Unimodular Coefficient Matrix2008-12-01Paper
VLSN search algorithms for partitioning problems using matching neighbourhoods2008-07-29Paper
Minmax strongly connected subgraphs with node penalties2008-07-01Paper
On linear multiplicative programming.2008-01-25Paper
On cost matrices with two and three distinct values of Hamiltonian paths and cycles2007-11-16Paper
Learning multicriteria fuzzy classification method PROAFTN from data2007-02-19Paper
A simplex algorithm for piecewise-linear fractional programming problems2007-01-22Paper
Variations of the prize‐collecting Steiner tree problem2006-09-12Paper
Approximate Local Search in Combinatorial Optimization2005-02-21Paper
Lexicographic balanced optimization problems2004-07-01Paper
https://portal.mardi4nfdi.de/entity/Q44619032004-05-18Paper
https://portal.mardi4nfdi.de/entity/Q44619172004-05-18Paper
https://portal.mardi4nfdi.de/entity/Q44619182004-05-18Paper
On bottleneck assignment problems under categorization.2004-02-14Paper
Weighted graphs with all Hamiltonian cycles of the same length2003-09-25Paper
Improved estimators for the selected location parameters2003-08-31Paper
TSP heuristics: domination analysis and complexity2003-06-02Paper
A survey of very large-scale neighborhood search techniques2002-09-17Paper
Domination analysis of some heuristics for the traveling salesman problem2002-06-24Paper
On the nature of the binomial distribution2002-06-23Paper
The traveling salesman problem: new polynomial approximation algorithms and domination analysis2001-01-01Paper
Constrained balanced optimization problems2000-01-20Paper
Multiple bottleneck assignment problem1999-11-08Paper
An \(O(m\log n)\) algorithm for the max+sum spanning tree problem1999-05-05Paper
Optimal expansion of capacitated transshipment networks1998-10-07Paper
Minmax combinatorial optimization1998-08-16Paper
Minimum dispersion problems1998-03-04Paper
On locating a single path-like facility in a general graph1997-10-05Paper
The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms1997-08-07Paper
https://portal.mardi4nfdi.de/entity/Q48962831997-02-11Paper
Constrained matroidal bottleneck problems1996-09-29Paper
On \(k\)-sum optimization1996-08-01Paper
An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem1996-07-24Paper
A fast algorithm for a class of bottleneck problems1996-07-02Paper
Generalized Bottleneck Problems1996-06-23Paper
Minmax linear knapsack problem with grouped variables and gub1995-08-17Paper
Polynomial Algorithms for a Class of Discrete Minmax Linear Programming Problems1995-07-24Paper
A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem1995-06-12Paper
A Tabu Search Algorithm for the Resource-Constrained Assignment Problem1995-05-28Paper
Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem1994-11-08Paper
On combined minmax-minsum optimization1994-09-13Paper
Erratum on: Travelling salesman problem under categorization1994-03-24Paper
Categorized Assignment Scheduling: a Tabu Search Approach1994-01-02Paper
Group centre and group median of a tree1993-06-29Paper
Minimum perfect bipartite matchings and spanning trees under categorization1993-01-17Paper
Traveling salesman problem under categorization1993-01-16Paper
K-Sum Linear Programming1993-01-16Paper
A linear time algorithm for the maximum capacity path problem1991-01-01Paper
k-sum optimization problems1990-01-01Paper
Minmax linear programmes with grouped variables1989-01-01Paper
Group centre and group median of a network1989-01-01Paper
Minimum deviation problems1988-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Abraham P. Punnen