On an Improvement to the Next-step Procedure

In this paper, we address a next-step procedure for solving nonsmooth integer programming problems, where the objective function is given as a maximum and the constraints include both equalities and inequalities. We propose two modifications of the original procedure aimed at significantly reducing the number of operations required to obtain a solution.

Authors

Institutions

Publication Details

Published
2025-07-04
DOI
https://doi.org/10.47350/iccs-de.2025.20
Primary Topic
Vehicle Routing Optimization Methods
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On an Improvement to the Next-step Procedure

N. Kosyanov
Vehicle Routing Optimization Methods
article

On an Improvement to the Next-step Procedure

N. Kosyanov
article en

Abstract

In this paper, we address a next-step procedure for solving nonsmooth integer programming problems, where the objective function is given as a maximum and the constraints include both equalities and inequalities. We propose two modifications of the original procedure aimed at significantly reducing the number of operations required to obtain a solution.

Institute for System Dynamics and Control Theory (RU)
Ministry of Education and Science of the Russian Federation
Openalex Percentile: Top 73%
Vehicle Routing Optimization Methods
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

On an Improvement to the Next-step Procedure — N. Kosyanov · (2025) | TGRS Research Map | TGRS