Search Results - (abstracts OR abstractss) computational complexity for mathematical programming problems

Accelerated gradient methods on the Grassmann and Stiefel manifolds

Authors: Xiaojing Zhu

Source: Japan Journal of Industrial and Applied Mathematics. 42:751-786

Subject Terms: Programming in abstract spaces, Stiefel manifold, Numerical mathematical programming methods, Nonlinear programming, accelerated gradient, global rate of convergence, Riemannian optimization, Abstract computational complexity for mathematical programming problems, Nonconvex programming, global optimization, Grassmann manifold

File Description: application/xml

Access URL: https://zbmath.org/8037191
https://doi.org/10.1007/s13160-025-00692-8

Strongly Convergent Inertial Proximal Point Algorithm Without On-line Rule: Strongly convergent inertial proximal point algorithm without on-line rule

Authors: Jolaoso, Lateef O. Shehu, Yekini Yao, Jen-Chih

Source: Journal of Optimization Theory and Applications. 200:555-584

Subject Terms: strong convergence, Hilbert spaces, Convex programming, Discrete approximations in optimal control, Nonlinear programming, Analysis of algorithms and problem complexity, Semidefinite programming, maximal monotone operators, two-point inertia, Abstract computational complexity for mathematical programming problems, proximal point algorithm

File Description: application/xml

Access URL: https://zbmath.org/7802200
https://doi.org/10.1007/s10957-023-02355-5

On the complexity of recognizing integrality and total dual integrality of the {0,1/2}-closure: On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure

Authors: Matthias Brugger Andreas S. Schulz

Source: Operations Research Letters. 50:16-19

Subject Terms: FOS: Computer and information sciences, computational complexity, Discrete Mathematics (cs.DM), integrality, \(\{0, 1 / 2 \}\)-cuts, 0211 other engineering and technologies, Integer programming, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Optimization and Control (math.OC), Gomory-chvátal cuts, Polyhedral combinatorics, branch-and-bound, branch-and-cut, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Abstract computational complexity for mathematical programming problems, Mathematics - Optimization and Control, total dual integrality, Computer Science - Discrete Mathematics

File Description: application/xml

Access URL: http://arxiv.org/pdf/2104.14486
http://arxiv.org/abs/2104.14486
https://arxiv.org/pdf/2104.14486
https://arxiv.org/abs/2104.14486
https://dblp.uni-trier.de/db/journals/corr/corr2104.html#abs-2104-14486
https://www.sciencedirect.com/science/article/pii/S0167637721001693

Embedding Complexity and Discrete Optimization II: A Dynamical Programming Approach to the Steiner-Tree Problem: Embedding complexity and discrete optimization. II: A dynamical programming approach to the Steiner-tree problem

Authors: Cieslik, D. Dress, A. Huber, K. T. et al.

Source: Annals of Combinatorics. 6:275-283

Subject Terms: dynamic programming, Extremal problems in graph theory, Combinatorial optimization, computational complexity, algorithmic complexity, Steiner's problem, structural complexity, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, Dynamic programming, 01 natural sciences, 7. Clean energy, Steiner minimal trees, Trees, embedding complexity, Graph theory (including graph drawing) in computer science, treewidth, divide and conquer, discrete optimization, Abstract computational complexity for mathematical programming problems

File Description: application/xml

Access URL: https://zbmath.org/1964604
https://doi.org/10.1007/s000260200003
http://core.ac.uk/display/2770606
https://link.springer.com/content/pdf/10.1007/s000260200003.pdf
https://link.springer.com/article/10.1007/s000260200003
https://ueaeprints.uea.ac.uk/id/eprint/23324/
https://research-portal.uea.ac.uk/en/publications/embedding-complexity-and-discrete-optimization-ii-a-dynamical-pro

Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints: Computational complexity of some maximum average weight problems with precedence constraints

Authors: Ulrich Faigle Walter Kern

Source: Operations Research. 42:688-693

Subject Terms: learning, tree-structured attributes, 0211 other engineering and technologies, Integer programming, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, Abstract computational complexity for mathematical programming problems, 01 natural sciences, maximum average weight, NP-complete

File Description: application/xml

Access URL: https://ris.utwente.nl/ws/files/6852520/Faigle94computational.pdf
https://zbmath.org/710922
https://doi.org/10.1287/opre.42.4.688
https://research.utwente.nl/en/publications/fcb5a027-eca4-46df-9ece-52f60505272b
https://doi.org/10.1287/opre.42.4.688

Computational Complexity of a Cost Allocation Approach to a Fixed Cost Spanning Forest Problem: Computational complexity of a cost allocation approach to a fixed cost spanning forest problem

Authors: Frieda Granot Daniel Granot

Source: Mathematics of Operations Research. 17:765-780

Subject Terms: facility location, 0211 other engineering and technologies, core, undirected connected graph, 02 engineering and technology, Programming involving graphs or networks, fixed cost spanning forest game, Resource and cost allocation (including fair division, apportionment, etc.), Discrete location and assignment, Other game-theoretic models, Cooperative games, fixed cost spanning forest problem, nucleolus, Abstract computational complexity for mathematical programming problems

File Description: application/xml

Access URL: https://zbmath.org/126117
https://doi.org/10.1287/moor.17.4.765
https://www.jstor.org/stable/3690069
https://ideas.repec.org/a/inm/ormoor/v17y1992i4p765-780.html
https://econpapers.repec.org/RePEc:inm:ormoor:v:17:y:1992:i:4:p:765-780
https://dblp.uni-trier.de/db/journals/mor/mor17.html#GranotG92
https://pubsonline.informs.org/doi/abs/10.1287/moor.17.4.765

The controlled rounding problem: Complexity and computational experience

Authors: Bruce L. Golden James P. Kelly Arjang A. Assad

Source: European Journal of Operational Research. 65:207-217

Subject Terms: statistical disclosure, 0211 other engineering and technologies, heuristics, 02 engineering and technology, Applications of statistics, 01 natural sciences, censoring, tree-dimensional problem, controlled rounding, Linear programming, Sampling theory, sample surveys, Deterministic network models in operations research, agencies, statistical enclosure, 0101 mathematics, Abstract computational complexity for mathematical programming problems, two- dimensional tables, binary search procedures, anonymity, government, Integer programming, Programming involving graphs or networks, data integrity, Applications of mathematical programming, simulated annealing, census organizations

File Description: application/xml

Access URL: https://zbmath.org/404922
https://doi.org/10.1016/0377-2217(93)90334-j
https://www.sciencedirect.com/science/article/pii/037722179390334J
http://www.sciencedirect.com/science/article/pii/037722179390334J
https://ideas.repec.org/a/eee/ejores/v65y1993i2p207-217.html

On the complexity of determining tolerances for ε-optimal solutions to min-max combinatorial optimization problems: On the complexity of determining tolerances for \(\varepsilon\)-optimal solutions to min-max combinatorial optimization problems

Authors: Ghosh, Diptesh Sierksma, G.

Source: Applicationes Mathematicae. 30:305-313

Subject Terms: Combinatorial optimization, Epsilon-Optimal Solutions, Tolerances, min-max, 01 natural sciences, sensitivity analysis, Optimaliseren, 31.12, Sensitivity, stability, parametric optimization, 0101 mathematics, Combinatieleer, Abstract computational complexity for mathematical programming problems, complexity, 0-1 combinatorial optimization problems

File Description: application/xml

Access URL: https://www.impan.pl/shop/publication/transaction/download/product/84031?download.pdf
https://zbmath.org/2120086
https://doi.org/10.4064/am30-3-5
https://research.rug.nl/en/publications/ffc140bc-5c73-4110-a7aa-b1eaa49742a1
https://hdl.handle.net/11370/ffc140bc-5c73-4110-a7aa-b1eaa49742a1
https://research.rug.nl/en/publications/04d94fad-a3bb-4c7a-ba39-5ca594fe8369
https://hdl.handle.net/11370/04d94fad-a3bb-4c7a-ba39-5ca594fe8369
https://pure.rug.nl/ws/files/3129277/00a35.pdf
https://research.rug.nl/en/publications/on-the-complexity-of-determining-tolerances-for-e-optimal-solutio
https://www.rug.nl/research/portal/publications/on-the-complexity-of-determining-tolerances-for-eoptimal-solutions-to-minmax-combinatorial-optimization-problems(ffc140bc-5c73-4110-a7aa-b1eaa49742a1)/export.html
http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.bwnjournal-article-doi-10_4064-am30-3-5
https://dialnet.unirioja.es/servlet/articulo?codigo=3450443
https://www.impan.pl/pl/wydawnictwa/czasopisma-i-serie-wydawnicze/applicationes-mathematicae/all/30/3/84031/on-the-complexity-of-determining-tolerances-for-varepsilon-optimal-solutions-to-min-max-combinatorial-optimization-problems
http://irs.ub.rug.nl/ppn/240570340

Augmented self-concordant barriers and nonlinear optimization problems with finite complexity

Authors: J.-Ph. Vial Yu. Nesterov

Source: Mathematical Programming. 99:149-174

Subject Terms: finite polynomial complexity, Nonlinear programming, 0211 other engineering and technologies, 02 engineering and technology, 0101 mathematics, Abstract computational complexity for mathematical programming problems, barrier function, nonlinear optimization, 01 natural sciences, central path

File Description: application/xml

Access URL: https://archive-ouverte.unige.ch/unige:5851/ATTACHMENT01
https://dial.uclouvain.be/handle/boreal:40497
http://www.optimization-online.org/DB_FILE/2001/06/346.pdf
https://dblp.uni-trier.de/db/journals/mp/mp99.html#NesterovV04
https://link.springer.com/article/10.1007/s10107-003-0392-8
https://archive-ouverte.unige.ch/unige:5851/ATTACHMENT01
https://archive-ouverte.unige.ch/unige:5851

Scheduling jobs of equal length: Complexity, facets and computational results

Authors: Crama, Yves Spieksma, Frits C.R.

Source: Lecture Notes in Computer Science ISBN: 9783540594086

Subject Terms: Business & economic sciences, computational complexity, Deterministic scheduling theory in operations research, single machine, automated assembly of printed circuit boards, 0211 other engineering and technologies, Quantitative methods in economics & management, 02 engineering and technology, polyhedral description, cutting plane algorithm, Méthodes quantitatives en économie & gestion, Polyhedral description, Production, distribution & gestion de la chaîne logistique, 8. Economic growth, scheduling, Production, distribution & supply chain management, Abstract computational complexity for mathematical programming problems, Sciences économiques & de gestion

File Description: application/xml

Access URL: https://link.springer.com/article/10.1007%2FBF02592090
https://dblp.uni-trier.de/db/journals/mp/mp72.html#CramaS96
https://orbi.uliege.be/handle/2268/202812
https://rd.springer.com/chapter/10.1007/3-540-59408-6_58
https://dblp.uni-trier.de/db/conf/ipco/ipco1995.html#CramaS95
https://link.springer.com/chapter/10.1007%2F978-3-642-80270-6_4
https://core.ac.uk/display/22086918
https://hdl.handle.net/2268/202812
https://doi.org/10.1007/BF02592090

Cardinality constrained minimum cut problems: complexity and algorithms: Cardinality constrained minimum cut problems: complexity and algorithms.

Authors: BRUGLIERI, MAURIZIO MAFFIOLI, FRANCESCO EHRGOTT M.

Source: Discrete Applied Mathematics. 137:311-341

Subject Terms: Combinatorial optimization, Cut problems, k-cardinality minimum cut, Cardinality constrained combinatorial optimization, Cardinality, Applied Mathematics, 0211 other engineering and technologies, Cardinality constrained combinatorial optimization, Integer programming, 0102 computer and information sciences, 02 engineering and technology, Cut problems, 01 natural sciences, Computational complexity, k-cardinality minimum cut, Discrete Mathematics and Combinatorics, Semidefinite programming, Abstract computational complexity for mathematical programming problems, constrained combinatorial optimization, \(k\)-cardinality minimum cut

File Description: application/xml; application/pdf

Access URL: https://www.sciencedirect.com/science/article/abs/pii/S0166218X03003585
https://www.sciencedirect.com/science/article/pii/S0166218X03003585
https://dblp.uni-trier.de/db/journals/dam/dam137.html#BruglieriME04
https://dl.acm.org/doi/10.1016/S0166-218X%2803%2900358-5
https://hdl.handle.net/11311/555764

Note on the computational complexity of least core concepts for min-cost spanning tree games: Note on the computational complexity of least core concepts for min-cost spanning tree games.

Authors: Faigle, U. Kern, W. Paulusma, Daniel

Source: Mathematical methods of operations research, 2000, Vol.52(1), pp.23-38 [Peer Reviewed Journal]

Subject Terms: Spanning tree, least core, 0211 other engineering and technologies, Nucleolus, IR-85186, 02 engineering and technology, NP-hard, 01 natural sciences, cooperative games, METIS-140627, Cooperative games, Least core, nucleolus, 0101 mathematics, Abstract computational complexity for mathematical programming problems, Cooperative game

File Description: application/xml; application/pdf

Access URL: http://dro.dur.ac.uk/6122/1/6122.pdf
https://zbmath.org/1972726
https://doi.org/10.1007/s001860000059
https://research.utwente.nl/en/publications/5d656242-ea14-44f5-b8bf-a17cb4119218
https://doi.org/10.1007/s001860000059

Complexity of the Gravitational Method for Linear Programming: Complexity of the gravitational method for linear programming

Authors: Z. Zhang Nagabhushana Prabhu T. L. Morin

Source: Lecture Notes in Computer Science ISBN: 9783540620341

Subject Terms: linear program, Linear programming, 4. Education, worst-case analysis, gravitational method, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Abstract computational complexity for mathematical programming problems, simplex method, complexity, 01 natural sciences

File Description: application/xml

Access URL: https://zbmath.org/1638133
https://doi.org/10.1023/a:1017591509792
https://rd.springer.com/chapter/10.1007%2F3-540-62034-6_51
https://dblp.uni-trier.de/db/conf/fsttcs/fsttcs96.html#MorinPZ96
https://link.springer.com/chapter/10.1007/3-540-62034-6_51
https://ideas.repec.org/a/spr/joptap/v108y2001i3d10.1023_a1017591509792.html
https://link.springer.com/article/10.1023/A:1017591509792
https://link.springer.com/content/pdf/10.1023/A:1017591509792.pdf

On the complexity of a class of combinatorial optimization problems with uncertainty

Authors: Igor Averbakh

Source: Mathematical Programming. 90:263-272

Subject Terms: Combinatorial optimization, computational complexity, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, Stochastic programming, robust optimization, 02 engineering and technology, minmax regret, Abstract computational complexity for mathematical programming problems

File Description: application/xml

A Complexity Analysis of a Smoothing Method Using CHKS-functions for Monotone Linear Complementarity Problems: A complexity analysis of a smoothing method using CHKS-functions for monotone linear complementarity problems

Authors: Keisuke Hotta Masatora Inaba Akiko Yoshise

Source: Computational Optimization and Applications. 17:183-201

Subject Terms: 0211 other engineering and technologies, complexity bound, Interior-point methods, 02 engineering and technology, Variational inequalities, Abstract computational complexity for mathematical programming problems, linear complementarity problem, monotonicity, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming), smoothing method

File Description: application/xml

Complexity of a Noninterior Path-Following Method for the Linear Complementarity Problem: Complexity of a noninterior path-following method for the linear complementarity problem

Authors: S. Xu J. Burke

Source: Journal of Optimization Theory and Applications. 112:53-76

Subject Terms: Linear complementarity, noninterior path-following methods, complexity of algorithms, 0211 other engineering and technologies, Interior-point methods, 02 engineering and technology, 0101 mathematics, Abstract computational complexity for mathematical programming problems, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming), 01 natural sciences

File Description: application/xml

Access URL: https://zbmath.org/1727011
https://doi.org/10.1023/a:1013040428127
https://ideas.repec.org/a/spr/joptap/v112y2002i1d10.1023_a1013040428127.html
https://link.springer.com/content/pdf/10.1023/A:1013040428127.pdf
https://link.springer.com/article/10.1023/A:1013040428127

On the complexity of the car sequencing problem: On the complexity of the car sequencing problem.

Authors: Tamás Kis

Source: Operations Research Letters. 32:331-335

Subject Terms: Computational complexity, Pseudo-polynomial algorithms, 0209 industrial biotechnology, Deterministic scheduling theory in operations research, Sequencing/scheduling, 0211 other engineering and technologies, Analysis of algorithms, 02 engineering and technology, Abstract computational complexity for mathematical programming problems

File Description: application/xml

Access URL: https://zbmath.org/2125890
https://doi.org/10.1016/j.orl.2003.09.003
https://dl.acm.org/doi/10.1016/j.orl.2003.09.003
http://www.sciencedirect.com/science/article/pii/S0167637703001160
https://www.sciencedirect.com/science/article/pii/S0167637703001160
https://dblp.uni-trier.de/db/journals/orl/orl32.html#Kis04
https://core.ac.uk/display/48286938

Studying the Complexity of Global Verification for NP-Hard Discrete Optimization Problems: Studying the complexity of global verification for NP-hard discrete optimization problems

Authors: Sheldon H. Jacobson Derek E. Armstrong

Source: Journal of Global Optimization. 27:83-96

Subject Terms: Combinatorial optimization, computational complexity, Analysis of algorithms and problem complexity, local search algorithms, 0211 other engineering and technologies, Complexity classes (hierarchies, relations among complexity classes, etc.), Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), 0102 computer and information sciences, 02 engineering and technology, NP-hard, Abstract computational complexity for mathematical programming problems, 01 natural sciences, discrete optimization problems

File Description: application/xml

Access URL: https://dl.acm.org/doi/10.1023/A%3A1024680908847
https://link.springer.com/article/10.1023/A%3A1024680908847
https://dblp.uni-trier.de/db/journals/jgo/jgo27.html#ArmstrongJ03
https://experts.illinois.edu/en/publications/studying-the-complexity-of-global-verification-for-np-hard-discre

On Complexity of the Translational-Cut Algorithm for Convex Minimax Problems: On complexity of the translational-cut algorithm for convex minimax problems

Authors: K. A. Ariyawansa P. L. Jiang

Source: Journal of Optimization Theory and Applications. 107:223-243

Subject Terms: interprior-point methods, Polyhedral combinatorics, branch-and-bound, branch-and-cut, 0211 other engineering and technologies, minimax optimization, analytic centers, 02 engineering and technology, 0101 mathematics, Abstract computational complexity for mathematical programming problems, complexity, Minimax problems in mathematical programming, 01 natural sciences, global Newton method

File Description: application/xml

Access URL: https://link.springer.com/article/10.1023/A%3A1026422013954
https://ideas.repec.org/a/spr/joptap/v107y2000i2d10.1023_a1026422013954.html

Some aspects of studying an optimization or decision problem in different computational models

Authors: Meer, K. Weber, G.W.

Source: Meer, K & Weber, G W 2002, ' Some aspects of studying an optimization or decision problem in different computational models ', European Journal of Operational Research, vol. 143(2), pp. 406-18 . https://doi.org/10.1016/s0377-2217(02)00269-2

Subject Terms: Structure of complexity classes, Algebraic models of computation, Linear and quadratic programming, Complexity theory, Complexity classes (hierarchies, relations among complexity classes, etc.), 0102 computer and information sciences, Models of computation (Turing machines, etc.), Saturation, 0101 mathematics, Abstract computational complexity for mathematical programming problems, 01 natural sciences

File Description: application/xml

Access URL: https://zbmath.org/1832953
https://doi.org/10.1016/s0377-2217(02)00269-2
https://ideas.repec.org/a/eee/ejores/v143y2002i2p406-418.html
https://dblp.uni-trier.de/db/journals/eor/eor143.html#MeerW02
https://EconPapers.repec.org/RePEc:eee:ejores:v:143:y:2002:i:2:p:406-418
https://www.sciencedirect.com/science/article/pii/S0377221702002692
http://www.sciencedirect.com/science/article/pii/S0377221702002692
https://portal.findresearcher.sdu.dk/da/publications/e6ed29d0-ba98-11dc-9626-000ea68e967b