The following pages link to Abraham P. Punnen (Q293329):
Displaying 50 items.
- A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph (Q293330) (← links)
- The bipartite quadratic assignment problem and extensions (Q322542) (← links)
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis (Q336878) (← links)
- The minimum cost perfect matching problem with conflict pair constraints (Q340285) (← links)
- The minimum spanning tree problem with conflict constraints and its variations (Q429679) (← links)
- Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms (Q482289) (← links)
- Experimental analysis of heuristics for the bottleneck traveling salesman problem (Q519098) (← links)
- The balanced traveling salesman problem (Q614063) (← links)
- On generalized balanced optimization problems (Q627450) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- SC-Hamiltonian graphs and digraphs: new necessary conditions and their impacts (Q710581) (← links)
- Three value TSP and linkages with the three value linear spanning 2-forests (Q765337) (← links)
- Strong and weak edges of a graph and linkages with the vertex cover problem (Q765356) (← links)
- A class of exponential neighbourhoods for the quadratic travelling salesman problem (Q782742) (← links)
- A linear time algorithm for the maximum capacity path problem (Q809905) (← links)
- An edge-reduction algorithm for the vertex cover problem (Q833573) (← links)
- A simplex algorithm for piecewise-linear fractional programming problems (Q859908) (← links)
- Learning multicriteria fuzzy classification method PROAFTN from data (Q868128) (← links)
- (Q916567) (redirect page) (← links)
- k-sum optimization problems (Q916568) (← links)
- Minmax strongly connected subgraphs with node penalties (Q930773) (← links)
- The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm (Q976040) (← links)
- Bottleneck flows in unit capacity networks (Q976109) (← links)
- A strongly polynomial simplex method for the linear fractional assignment problem (Q1003483) (← links)
- Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem (Q1040083) (← links)
- The bottleneck \(k\)-MST (Q1041824) (← links)
- Minimum deviation problems (Q1104246) (← links)
- Minmax linear programmes with grouped variables (Q1122476) (← links)
- Group centre and group median of a network (Q1123113) (← links)
- Minmax combinatorial optimization (Q1130081) (← links)
- Traveling salesman problem under categorization (Q1200771) (← links)
- Minimum perfect bipartite matchings and spanning trees under categorization (Q1201102) (← links)
- Optimal expansion of capacitated transshipment networks (Q1266668) (← links)
- An \(O(m\log n)\) algorithm for the max+sum spanning tree problem (Q1266709) (← links)
- Erratum on: Travelling salesman problem under categorization (Q1317013) (← links)
- A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem (Q1329426) (← links)
- On combined minmax-minsum optimization (Q1333027) (← links)
- Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem (Q1337676) (← links)
- Minimum dispersion problems (Q1363766) (← links)
- Improved estimators for the selected location parameters (Q1402940) (← links)
- Weighted graphs with all Hamiltonian cycles of the same length (Q1408871) (← links)
- On bottleneck assignment problems under categorization. (Q1422389) (← links)
- Lexicographic balanced optimization problems (Q1433654) (← links)
- (Q1566376) (redirect page) (← links)
- TSP heuristics: domination analysis and complexity (Q1566378) (← links)
- Domination analysis of some heuristics for the traveling salesman problem (Q1602706) (← links)
- The Boolean quadratic programming problem with generalized upper bound constraints (Q1652009) (← links)
- Clustered maximum weight clique problem: algorithms and empirical analysis (Q1652358) (← links)
- A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems (Q1662098) (← links)
- The quadratic minimum spanning tree problem and its variations (Q1662110) (← links)
