Several numerical methods for solving nonlinear systems of equations assume that derivative information is available. Furthermore, these approaches usually do not consider the problem of finding all solutions to a nonlinear system. Rather, most methods output a single solution. In this paper, we...

The earliest approaches to the cell formation problem in group technology, dealing with a binary machine-part incidence matrix, were aimed only at minimizing the number of intercell moves (exceptional elements in the block-diagonalized matrix). Later on this goal was extended to simultaneous...

Graph coloring is an important tool in the study of optimization, computer science, network design, e.g., file transferring in a computer network, pattern matching, computation of Hessians matrix and so on. In this paper, we consider one important coloring, vertex coloring of a total graph,...

The inverse max + sum spanning tree (IMSST) problem is studied, which is the first inverse problem on optimization problems with combined minmax–minsum objective functions. Given an edge-weighted undirected network <InlineEquation ID="IEq3"> <EquationSource Format="TEX">$$G(V,E,c,w)$$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <mrow> <mi>G</mi> <mo stretchy="false">(</mo> <mi>V</mi> <mo>,</mo> <mi>E</mi> <mo>,</mo> <mi>c</mi> <mo>,</mo> <mi>w</mi> <mo stretchy="false">)</mo> </mrow> </math> </EquationSource> </InlineEquation>, the MSST problem is to find a...</equationsource></equationsource></inlineequation>