Browse
We’re here to help

Find guidance on Author Services

Search
Browse
We’re here to help

Find guidance on Author Services

Home
All Journals
Optimization Methods and Software
List of Issues
Volume 36, Issue 4

Optimization Methods and Software

Search in:

Advanced search Citation search

Citation search

Ready to submit?
Start a new submission or continue a submission in progress
Go to submission site
Instructions for authors
Editorial policies
Editing services site

About this journalAbout

Latest articles
Current issue
All volumes & issues
Special issues
Collections
Open access articles
Most read articles
Most cited articles

New content alerts
RSS

Subscription options & pricing

Buy a subscription

Your download is now in progress and you may close this window

Did you know that with a free Taylor & Francis Online account you can gain access to the following benefits?

Choose new content alerts to be informed about new research of interest to you
Easy remote access to your institution's subscriptions on any device, from any location
Save your searches and schedule alerts to send you new results
Export your search results into a .csv file to support your research

Have an account?
Login now Don't have an account?
Register for free

Login or register to access this feature

Have an account?
Login now Don't have an account?
Register for free

Choose new content alerts to be informed about new research of interest to you
Easy remote access to your institution's subscriptions on any device, from any location
Save your searches and schedule alerts to send you new results
Export your search results into a .csv file to support your research

Optimization Methods and Software, Volume 36, Issue 4 (2021)

Browse this journal

Latest articles
Current issue
List of issues
Special issues
Collections
Open access articles
Most read articles
Most cited articles

Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days

Optimization Methods and Software, Volume 36, Issue 4 (2021)

See all volumes and issues

Vol 39, 2024 Vol 38, 2023 Vol 37, 2022 Volume 36, 2021 Vol 35, 2020 Vol 34, 2019 Vol 33, 2018 Vol 32, 2017 Vol 31, 2016 Vol 30, 2015 Vol 29, 2014 Vol 28, 2013 Vol 27, 2012 Vol 26, 2011 Vol 25, 2010 Vol 24, 2009 Vol 23, 2008 Vol 22, 2007 Vol 21, 2006 Vol 20, 2005 Vol 19, 2004 Vol 18, 2003 Vol 17, 2002 Vol 16, 2001 Vol 15, 2001 Vol 14, 2000-2001 Vol 13, 2000 Vol 11, 1999 Vol 10, 1998-1999 Vol 9, 1998 Vol 8, 1997-1998 Vol 7, 1996-1997 Vol 6, 1995-1996 Vol 5, 1995 Vol 4, 1994 Vol 3, 1994 Vol 2, 1993 Vol 1, 1992

Select to download all citations or PDFs

Download citations Download PDFs Download issue

Browse by section (All)

Display order (Default)
Published online date
Page number
Section A-Z
Most read
Most cited

Special Issue: OPTIMA 2018. Guest edited by: Milojica Jaćimović, Michael Khachay, Yury Kochetov and Mikhail Posypkin

Preface

Milojica Jaćimović, Michael Khachay, Yury Kochetov & Mikhail Posypkin

Page: 671

Published online: 31 May 2022

CitationforPreface | Full Text | PDF (150.3 KB) | EPUB

185 Views
0 CrossRef citations
0Altmetric

Free Access

Articles

Article

On black-box optimization in divide-and-conquer SAT solving

O. S. Zaikin & S. E. Kochemazov

Pages: 672-696

Published online: 11 Nov 2019

AbstractforOn black-box optimization in divide-and-conquer SAT solving | Full Text | References | PDF (2.2 MB) | EPUB

183 Views
7 CrossRef citations
0Altmetric

Article

GLS and VNS based heuristics for conflict-free minimum-latency aggregation scheduling in WSN

Roman Plotnikov, Adil Erzin & Vyacheslav Zalyubovskiy

Pages: 697-719

Published online: 08 Jan 2020

AbstractforGLS and VNS based heuristics for conflict-free minimum-latency aggregation scheduling in WSN | Full Text | References | PDF (2.2 MB) | EPUB

99 Views
2 CrossRef citations
0Altmetric

Article

Composite optimization for the resource allocation problem

Anastasiya Ivanova, Pavel Dvurechensky, Alexander Gasnikov & Dmitry Kamzolov

Pages: 720-754

Published online: 12 Feb 2020

AbstractforComposite optimization for the resource allocation problem | Full Text | References | PDF (3.5 MB) | EPUB

274 Views
5 CrossRef citations
0Altmetric

Article

Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance

Van Huy Pham, Kien Trung Nguyen & Tran Thu Le

Pages: 755-772

Published online: 15 Jan 2020

AbstractforInverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance | Full Text | References | PDF (1.4 MB) | EPUB

53 Views
2 CrossRef citations
0Altmetric

Article

Primal–dual accelerated gradient methods with small-dimensional relaxation oracle

Yurii Nesterov, Alexander Gasnikov, Sergey Guminov & Pavel Dvurechensky

Pages: 773-810

Published online: 02 Mar 2020

AbstractforPrimal–dual accelerated gradient methods with small-dimensional relaxation oracle | Full Text | References | PDF (2.9 MB) | EPUB

546 Views
12 CrossRef citations
0Altmetric

Article

New perspective on some classical results in analysis and optimization

Olga Brezhneva, Yuri G. Evtushenko & Alexey A. Tret'yakov

Pages: 811-820

Published online: 17 Mar 2020

AbstractforNew perspective on some classical results in analysis and optimization | Full Text | References | PDF (804.3 KB) | EPUB

88 Views
0 CrossRef citations
0Altmetric

Article

Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass

I. D. Chernykh & E. V. Lgotina

Pages: 821-841

Published online: 09 Mar 2020

AbstractforTwo-machine routing open shop on a tree: instance reduction and efficiently solvable subclass | Full Text | References | PDF (2 MB) | EPUB

94 Views
6 CrossRef citations
0Altmetric

Article

Optimization of triangular networks with spatial constraints

Valentin R. Koch & Hung M. Phan

Pages: 842-868

Published online: 25 Apr 2019

AbstractforOptimization of triangular networks with spatial constraints | Full Text | References | PDF (3.2 MB) | EPUB

84 Views
0 CrossRef citations
0Altmetric

Article

A generic framework for approximation analysis of greedy algorithms for star bicoloring

David W. Juedes & Jeffrey S. Jones

Pages: 869-890

Published online: 07 Aug 2019

AbstractforA generic framework for approximation analysis of greedy algorithms for star bicoloring | Full Text | References | PDF (1.8 MB) | EPUB

52 Views
0 CrossRef citations
0Altmetric

Explore articles

Latest
Open access
Most read
Most cited
Trending

Explore the most recently published articles

Matrix extreme points and free extreme points of free spectrahedra

Aidan Epperly et al.

Article | Published online: 29 Jul 2024

A trust-region scheme for constrained multi-objective optimization problems with superlinear convergence property

Nantu Kumar Bisui et al.

Article | Published online: 29 Jul 2024

Numerical methods for distributed stochastic compositional optimization problems with aggregative structure

Shengchao Zhao et al.

Article | Published online: 25 Jul 2024

A new spectral conjugate subgradient method with application in computed tomography image reconstruction

M. Loreto et al.

Article | Published online: 24 Jul 2024

View all latest articles

Download citations

Choose format

RIS (ProCit, Reference Manager)
BibTeX
RefWorks Direct Export

Download citations

Optimization Methods and Software (Vol.36, Iss.4, 2021)

Special Issue: OPTIMA 2018. Guest edited by: Milojica Jaćimović, Michael Khachay, Yury Kochetov and Mikhail Posypkin

Special Issue: OPTIMA 2018. Guest edited by: Milojica Jaćimović, Michael Khachay, Yury Kochetov and Mikhail Posypkin

Access Rights

Only articles that you have access rights to view will be downloaded. The green tick (full access) and orange padlock (open access) icons indicate that you have full access.

Do you want to proceed?