Abraham P. Punnen

Jasdeep Dhahan

Algorithms, May, 2024

Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations.

[BibT_eX]

[DOI]

Navpreet Kaur

Discret. Optim., 2024

Revisiting some classical linearizations of the quadratic binary optimization problem.

[BibT_eX]

[DOI]

Navpreet Kaur

CoRR, 2024

Experimental analysis of algorithms for the independent quadratic assignment problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2024

2023

Solving dynamic satellite image data downlink scheduling problem via an adaptive bi-objective optimization algorithm.

[BibT_eX]

[DOI]

Comput. Oper. Res., December, 2023

A three-phase matheuristic algorithm for the multi-day task assignment problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., November, 2023

2022

The Bipartite Boolean Quadric Polytope.

[BibT_eX]

[DOI]

Tamon Stephen

Discret. Optim., 2022

Preface: Quadratic combinatorial optimization problems.

[BibT_eX]

[DOI]

Renata Sotirov

Discret. Optim., 2022

Multi-strip observation scheduling problem for ac-tive-imaging agile earth observation satellites.

[BibT_eX]

[DOI]

Zhongxiang Chang

Zhongbao Zhou

CoRR, 2022

An adaptive bi-objective optimization algorithm for the satellite image data downlink scheduling problem considering request split.

[BibT_eX]

[DOI]

Zhongxiang Chang

Zhongbao Zhou

CoRR, 2022

2021

The Rank-One Quadratic Assignment Problem.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2021

A Fast and Robust Heuristic Algorithm for the Minimum Weight Vertex Cover Problem.

[BibT_eX]

[DOI]

Yang Wang

Zhipeng Lü

IEEE Access, 2021

2020

A two-individual based path-relinking algorithm for the satellite broadcast scheduling problem.

[BibT_eX]

[DOI]

Knowl. Based Syst., 2020

A class of exponential neighbourhoods for the quadratic travelling salesman problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2020

2019

An effective multi-wave algorithm for solving the max-mean dispersion problem.

[BibT_eX]

[DOI]

J. Heuristics, 2019

Combinatorial optimization with interaction costs: Complexity and solvable cases.

[BibT_eX]

[DOI]

Stefan Lendl

Discret. Optim., 2019

Representations of quadratic combinatorial optimization problems: A case study using quadratic set covering and quadratic knapsack problems.

[BibT_eX]

[DOI]

Michael Friesen

Comput. Oper. Res., 2019

2018

A characterization of linearizable instances of the quadratic minimum spanning tree problem.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

Adaptive tabu search with strategic oscillation for the bipartite boolean quadratic programming problem with partitioned variables.

[BibT_eX]

[DOI]

Inf. Sci., 2018

The generalized vertex cover problem and some variations.

[BibT_eX]

[DOI]

Discret. Optim., 2018

The quadratic minimum spanning tree problem and its variations.

[BibT_eX]

[DOI]

Discret. Optim., 2018

Representations of quadratic combinatorial optimization problems: A case study using the quadratic set covering problem.

[BibT_eX]

[DOI]

CoRR, 2018

Very Large-Scale Neighborhood Search: Theory, Algrithms, and Applications.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2017

On a linearization technique for solving the quadratic set covering problem and variations.

[BibT_eX]

[DOI]

Optim. Lett., 2017

The bilinear assignment problem: complexity and polynomially solvable special cases.

[BibT_eX]

[DOI]

Math. Program., 2017

Markov Chain methods for the Bipartite Boolean Quadratic Programming Problem.

[BibT_eX]

[DOI]

Andrew J. Parkes

Eur. J. Oper. Res., 2017

A linear time algorithm for the -neighbour Travelling Salesman Problem on a Halin graph and extensions.

[BibT_eX]

[DOI]

Tamon Stephen

Discret. Optim., 2017

A characterization of Linearizable instances of the Quadratic Traveling Salesman Problem.

[BibT_eX]

[DOI]

CoRR, 2017

The boolean quadratic programming problem with generalized upper bound constraints.

[BibT_eX]

[DOI]

Yang Wang

Comput. Oper. Res., 2017

Clustered maximum weight clique problem: Algorithms and empirical analysis.

[BibT_eX]

[DOI]

Krishna Teja Malladi

Comput. Oper. Res., 2017

2016

Priority allocation rules for single machine total weighted linear and square tardiness problems.

[BibT_eX]

[DOI]

Aihua Yin

Dongping Hu

Prod. Eng., 2016

The bipartite quadratic assignment problem and extensions.

[BibT_eX]

[DOI]

Yang Wang

Eur. J. Oper. Res., 2016

Multi-component approach to the bipartite Boolean quadratic programming problem.

[BibT_eX]

[DOI]

Andrew J. Parkes

CoRR, 2016

2015

Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2015

The bipartite unconstrained 0-1 quadratic programming problem: Polynomially solvable cases.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

A Linear Time Algorithm for the $3$-Neighbour Traveling Salesman Problem on Halin graphs and extensions.

[BibT_eX]

[DOI]

Tamon Stephen

CoRR, 2015

A Network Model for the Hospital Routing Problem.

[BibT_eX]

Arash Rafiey

Vladyslav Sokol

Ramesh Krishnamurti

Krishna Teja Malladi

Proceedings of the ICORES 2015, 2015

2014

The quadratic balanced optimization problem.

[BibT_eX]

[DOI]

Discret. Optim., 2014

The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis.

[BibT_eX]

[DOI]

John Larusic

Comput. Oper. Res., 2014

2013

A reduced integer programming model for the ferry scheduling problem.

[BibT_eX]

[DOI]

Public Transp., 2013

Quadratic bottleneck knapsack problems.

[BibT_eX]

[DOI]

J. Heuristics, 2013

A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems.

[BibT_eX]

[DOI]

Discret. Optim., 2013

Spanning cactus of a graph: Existence, extension, optimization, and approximation.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

The minimum cost perfect matching problem with conflict pair constraints.

[BibT_eX]

[DOI]

Temel Öncan

Comput. Oper. Res., 2013

Domination Analysis of Algorithms for Bipartite Boolean Quadratic Programs.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

2012

Experimental analysis of heuristics for the bottleneck traveling salesman problem.

[BibT_eX]

[DOI]

John Larusic

Eric Aubanel

J. Heuristics, 2012

Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem.

[BibT_eX]

[DOI]

Discret. Optim., 2012

Strong and weak edges of a graph and linkages with the vertex cover problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

Three value TSP and linkages with the three value linear spanning 2-forests.

[BibT_eX]

[DOI]

Daniel K. Benvenuti

Discret. Appl. Math., 2012

Heuristic algorithms for the bipartite unconstrained 0-1 quadratic programming problem

[BibT_eX]

[DOI]

CoRR, 2012

An ejection-chain heuristic for the satellite downlink scheduling problem: A case study with RADARSAT-2

[BibT_eX]

[DOI]

Krishna T. Malladi

CoRR, 2012

2011

An O(n4) Algorithm for the QAP Linearization Problem.

[BibT_eX]

[DOI]

Math. Oper. Res., 2011

On generalized balanced optimization problems.

[BibT_eX]

[DOI]

Math. Methods Oper. Res., 2011

The minimum spanning tree problem with conflict constraints and its variations.

[BibT_eX]

[DOI]

Discret. Optim., 2011

The balanced traveling salesmanproblem.

[BibT_eX]

[DOI]

John Larusic

Comput. Oper. Res., 2011

Trioid: A generalization of matroid and the associated polytope.

[BibT_eX]

[DOI]

Algorithmic Oper. Res., 2011

2010

Variable Intensity Local Search.

[BibT_eX]

[DOI]

Proceedings of the Matheuristics - Hybridizing Metaheuristics and Mathematical Programming, 2010

SC-Hamiltonicity and Its Linkages with Strong Hamiltonicity of a Graph.

[BibT_eX]

[DOI]

Daniel K. Benvenuti

SIAM J. Discret. Math., 2010

SC-Hamiltonian graphs and digraphs: New necessary conditions and their impacts.

[BibT_eX]

[DOI]

Daniel K. Benvenuti

Discret. Math., 2010

The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm.

[BibT_eX]

[DOI]

Temel Öncan

Comput. Oper. Res., 2010

On the Approximability of the Vertex Cover and Related Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009

An edge-reduction algorithm for the vertex cover problem.

[BibT_eX]

[DOI]

Yinyu Ye

Oper. Res. Lett., 2009

Bottleneck flows in unit capacity networks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem.

[BibT_eX]

[DOI]

Discret. Optim., 2009

Integer Programming: Optimization and Evaluation Are Equivalent.

[BibT_eX]

[DOI]

James B. Orlin

Andreas S. Schulz

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

2008

A strongly polynomial simplex method for the linear fractional assignment problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2008

VLSN search algorithms for partitioning problems using matching neighbourhoods.

[BibT_eX]

[DOI]

J. Oper. Res. Soc., 2008

2007

Very Large-Scale Neighborhood Search.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

A simplex algorithm for piecewise-linear fractional programming problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2007

Bottleneck flows in networks

[BibT_eX]

[DOI]

CoRR, 2007

A polynomial time $\frac 3 2$ -approximation algorithm for the vertex cover problem on a class of graphs

[BibT_eX]

[DOI]

Yinyu Ye

CoRR, 2007

Learning multicriteria fuzzy classification method PROAFTN from data.

[BibT_eX]

[DOI]

Nabil Belacel

Hiral Bhasker Raval

Comput. Oper. Res., 2007

2006

On cost matrices with two and three distinct values of Hamiltonian paths and cycles.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2006

Variations of the prize-collecting Steiner tree problem.

[BibT_eX]

[DOI]

Olena Chapovska

Networks, 2006

The traveling salesman problem.

[BibT_eX]

[DOI]

Gregory Z. Gutin

Discret. Optim., 2006

2005

Preface.

[BibT_eX]

[DOI]

Adv. Decis. Sci., 2005

Minmax strongly connected subgraphs with node penalties.

[BibT_eX]

[DOI]

Adv. Decis. Sci., 2005

The bottleneck k-MST.

[BibT_eX]

[DOI]

Olena Chapovska

Inf. Process. Lett., 2005

2004

Approximate Local Search in Combinatorial Optimization.

[BibT_eX]

[DOI]

James B. Orlin

Andreas S. Schulz

SIAM J. Comput., 2004

Lexicographic balanced optimization problems.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2004

On bottleneck assignment problems under categorization.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2004

2003

Weighted graphs with all Hamiltonian cycles of the same length.

[BibT_eX]

[DOI]

Discret. Math., 2003

TSP Heuristics: Domination Analysis and Complexity.

[BibT_eX]

[DOI]

François Margot

Algorithmica, 2003

2002

Domination analysis of some heuristics for the traveling salesman problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

A survey of very large-scale neighborhood search techniques.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

1999

Multiple bottleneck assignment problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 1999

1998

A Linear Time Algorithm for the Bottleneck Traveling Salesman Problem on a Halin Graph.

[BibT_eX]

[DOI]

Jeffrey Mark Phillips

Inf. Process. Lett., 1998

1997

Minimum Dispersion Problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

1996

On k-sum optimization.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1996

An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem.

[BibT_eX]

[DOI]

K. P. K. Nair

INFORMS J. Comput., 1996

A Fast Algorithm for a Class of Bottleneck Problems.

[BibT_eX]

[DOI]

Computing, 1996

1995

Constrained Matroidal Bottleneck Problems.

[BibT_eX]

[DOI]

Igor Averbakh

Oded Berman

Discret. Appl. Math., 1995

1994

A Fast and Simple Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem.

[BibT_eX]

[DOI]

Kunhiraman Nair

Inf. Process. Lett., 1994

Improved Complexity Bound for the Maximum Cardinality Bottleneck Bipartite Matching Problem.

[BibT_eX]

[DOI]

Kunhiraman Nair

Discret. Appl. Math., 1994

On combined minmax-minsum optimization.

[BibT_eX]

[DOI]

Comput. Oper. Res., 1994

1993

On: Travelling salesman problem under categorization: Operations Research Letters 12 (1992) 89-95.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1993

1992

Traveling salesman problem under categorization.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1992

Minimum Perfect Bipartite Matchings and Spanning Trees under Categorization.

[BibT_eX]

[DOI]

Michael B. Richey