Suchergebnisse - (abstract OR astrally) computational complexity for mathematical programming problems

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

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

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

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-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

Autoren: Matthias Brugger Andreas S. Schulz

Quelle: Operations Research Letters. 50:16-19

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-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

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

Autoren: Ulrich Faigle Walter Kern

Quelle: Operations Research. 42:688-693

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-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

Stochastic Trust-Region Methods with Trust-Region Radius Depending on Probabilistic Models: Stochastic trust-region methods with trust-region radius depending on probabilistic models

Autoren: Wang, Xiaoyu Yuan, Yaxiang

Quelle: Journal of Computational Mathematics. 40:294-334

Schlagwörter: Numerical optimization and variational techniques, probabilistic models, Stochastic optimization, 0211 other engineering and technologies, 02 engineering and technology, stochastic optimization, Global convergence, trust-region methods, global convergence, trust-region radius, Numerical mathematical programming methods, Optimization and Control (math.OC), Trust-region methods, Trust- region radius, FOS: Mathematics, Probabilistic models, Abstract computational complexity for mathematical programming problems, Mathematics - Optimization and Control, 65K05, 65K10, 90C60

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/pdf/1904.03342
http://arxiv.org/abs/1904.03342

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

Autoren: Ghosh, Diptesh Sierksma, G.

Quelle: Applicationes Mathematicae. 30:305-313

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-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

Accelerated gradient methods on the Grassmann and Stiefel manifolds

Autoren: Xiaojing Zhu

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

Schlagwörter: 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

Dateibeschreibung: application/xml

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

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.

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

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

Schlagwörter: 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

Dateibeschreibung: application/xml; application/pdf

Zugangs-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

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

Autoren: Keisuke Hotta Masatora Inaba Akiko Yoshise

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

Schlagwörter: 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

Dateibeschreibung: application/xml

On the Computational Complexity of Consumer Decision Rules: On the computational complexity of consumer decision rules

Autoren: Norman, A Ahmed, A Chou, J et al.

Quelle: Computational Economics. 23:173-192

Schlagwörter: Computational complexity, decision rules, 0502 economics and business, 05 social sciences, 0501 psychology and cognitive sciences, market organization, Abstract computational complexity for mathematical programming problems, Decision theory

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/2128729
https://doi.org/10.1023/b:csem.0000021676.64701.12
https://ideas.repec.org/a/kap/compec/v23y2004i2p173-192.html
https://link.springer.com/article/10.1023/B%3ACSEM.0000021676.64701.12
https://link.springer.com/10.1023/B:CSEM.0000021676.64701.12
https://EconPapers.repec.org/RePEc:kap:compec:v:23:y:2004:i:2:p:173-192
https://ora.ox.ac.uk/objects/uuid:b8c18800-89e4-4ccd-a5c6-bc718dc0df12
https://doi.org/10.1023/b:csem.0000021676.64701.12

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

Autoren: Sheldon H. Jacobson Derek E. Armstrong

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

Schlagwörter: 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

Dateibeschreibung: application/xml

Zugangs-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

Complexity results for parallel machine problems with a single server

Autoren: Clarisse Dhaenens-Flipo Sigrid Knust Frank Werner et al.

Quelle: Journal of Scheduling. 5:429-457

Schlagwörter: complexity results, Deterministic scheduling theory in operations research, parallel machines, Analysis of algorithms and problem complexity, single server, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), 02 engineering and technology, Abstract computational complexity for mathematical programming problems

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1872732
https://doi.org/10.1002/jos.120
https://onlinelibrary.wiley.com/doi/abs/10.1002/jos.120

Computational Complexity Analysis of Single Machine Scheduling Problems with Job Release Dates Dependent on Resources: Computational complexity analysis of single machine scheduling problems with job release dates dependent on resources.

Autoren: Adam Janiak

Quelle: Operations Research Proceedings ISBN: 9783540626305

Schlagwörter: Deterministic scheduling theory in operations research, 8. Economic growth, Abstract computational complexity for mathematical programming problems

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1998806
https://link.springer.com/content/pdf/10.1007%2F978-3-642-60744-8_37.pdf
https://link.springer.com/chapter/10.1007%2F978-3-642-60744-8_37
https://rd.springer.com/chapter/10.1007/978-3-642-60744-8_37

On complexity of minimization and compression problems for models of sequential choice

Autoren: L. A. Sholomov

Quelle: Discrete Applied Mathematics. 135:281-300

Schlagwörter: Minimization problem, 0209 industrial biotechnology, Applied Mathematics, Sequential choice, Compression problem, Complexity, 02 engineering and technology, Decision theory, 01 natural sciences, Binary relations, local procedure for compression of a model, Discrete Mathematics and Combinatorics, equivalent transformation of a model, NP-hard problem, 0101 mathematics, Abstract computational complexity for mathematical programming problems, Choice models, Local algorithms

Dateibeschreibung: application/xml

Zugangs-URL: https://www.sciencedirect.com/science/article/pii/S0166218X02003128

On the Complexity of the Steiner Problem: On the complexity of the Steiner problem

Autoren: Marcus Brazil Doreen A. Thomas Jia F. Weng

Quelle: Journal of Combinatorial Optimization. 4:187-195

Schlagwörter: Combinatorial optimization, computational complexity, Graph algorithms (graph-theoretic aspects), 0211 other engineering and technologies, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), 0102 computer and information sciences, 02 engineering and technology, Abstract computational complexity for mathematical programming problems, 01 natural sciences, Steiner tree

Dateibeschreibung: application/xml

Zugangs-URL: https://rd.springer.com/article/10.1023/A%3A1009846620554
https://doi.org/10.1023/A:1009846620554
https://dblp.uni-trier.de/db/journals/jco/jco4.html#BrazilTW00
https://findanexpert.unimelb.edu.au/scholarlywork/1027485-on-the-complexity-of-the-steiner-problem
https://link.springer.com/content/pdf/10.1023/A:1009846620554.pdf

A note on the complexity of the transportation problem with a permutable demand vector

Autoren: Mihály Hujter Bettina Klinz Gerhard J. Woeginger

Quelle: Mathematical Methods of Operations Research. 50:9-16

Schlagwörter: transportation problem, computational complexity, 0211 other engineering and technologies, minimum weight \(f\)-factor problem, 0102 computer and information sciences, 02 engineering and technology, Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.), Abstract computational complexity for mathematical programming problems, 01 natural sciences, permutable demand vector

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1356499
https://dblp.uni-trier.de/db/journals/mmor/mmor50.html#HujterKW99
https://graz.pure.elsevier.com/en/publications/a-note-on-the-complexity-of-the-transportation-problem-with-a-per
https://link.springer.com/content/pdf/10.1007/PL00020923.pdf
https://econpapers.repec.org/article/sprmathme/v_3a50_3ay_3a1999_3ai_3a1_3ap_3a9-16.htm
https://ideas.repec.org/a/spr/mathme/v50y1999i1p9-16.html
https://EconPapers.repec.org/RePEc:spr:mathme:v:50:y:1999:i:1:p:9-16

A long-step primal–dual algorithm for the symmetric programming problem: A long-step primal--dual algorithm for the symmetric programming problem

Autoren: R. Arana Leonid Faybusovich

Quelle: Systems & Control Letters. 43:3-7

Schlagwörter: primal-dual interior-point algorithms, 0211 other engineering and technologies, Euclidean-Jordan algebras, Interior-point methods, 02 engineering and technology, complexity estimates, 0101 mathematics, Abstract computational complexity for mathematical programming problems, 01 natural sciences, Jordan algebras (algebras, triples and pairs)

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1635352
https://doi.org/10.1016/s0167-6911(01)00092-5
http://www.sciencedirect.com/science/article/pii/S0167691101000925
https://dblp.uni-trier.de/db/journals/scl/scl43.html#FaybusovichA01
https://www.sciencedirect.com/science/article/pii/S0167691101000925

An alternative to Ben-Or's lower bound for the knapsack problem complexity

Autoren: Valentin E. Brimkov Stefan S. Dantchev

Quelle: Applied Mathematics Letters. 15:187-191

Schlagwörter: Combinatorial optimization, Real number model, Complexity lower bounds, Applied Mathematics, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), 0102 computer and information sciences, 0101 mathematics, Abstract computational complexity for mathematical programming problems, 01 natural sciences, Knapsack problem, algebraic complexity of the knapsack problem

Dateibeschreibung: application/xml

Zugangs-URL: https://www.sciencedirect.com/science/article/abs/pii/S0893965901001161
https://dblp.uni-trier.de/db/journals/appml/appml15.html#BrimkovD02
https://www.sciencedirect.com/science/article/pii/S0893965901001161

An introduction to multi-parameter complexity analysis of discrete problems

Autoren: Sergey V. Sevastianov

Quelle: European Journal of Operational Research. 165:387-397

Schlagwörter: Combinatorial optimization, Deterministic scheduling theory in operations research, Scheduling, Complexity theory, Parameterized family of subproblems, 0211 other engineering and technologies, Coloring, 0102 computer and information sciences, 02 engineering and technology, Abstract computational complexity for mathematical programming problems, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: https://econpapers.repec.org/article/eeeejores/v_3a165_3ay_3a2005_3ai_3a2_3ap_3a387-397.htm
https://ideas.repec.org/a/eee/ejores/v165y2005i2p387-397.html
https://www.sciencedirect.com/science/article/abs/pii/S0377221704002474
https://doi.org/10.1016/j.ejor.2004.04.009
https://dblp.uni-trier.de/db/journals/eor/eor165.html#Sevastianov05

Complexity results for flow-shop problems with a single server

Autoren: Peter Brucker Guoqing Wang Sigrid Knust

Quelle: European Journal of Operational Research. 165:398-407

Schlagwörter: Setup times, Flow-shop, 0209 industrial biotechnology, Deterministic scheduling theory in operations research, Single server, 0211 other engineering and technologies, 02 engineering and technology, Abstract computational complexity for mathematical programming problems, Complexity results

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/2160295
https://doi.org/10.1016/j.ejor.2004.04.010
https://www.sciencedirect.com/science/article/pii/S0377221704002486
https://ideas.repec.org/a/eee/ejores/v165y2005i2p398-407.html
https://dblp.uni-trier.de/db/journals/eor/eor165.html#BruckerKW05
http://www.sciencedirect.com/science/article/pii/S0377221704002486
https://www.sciencedirect.com/science/article/abs/pii/S0377221704002486#!

On the complexity of the continuous unbounded knapsack problem with uncertain coefficients

Autoren: Eduardo Conde

Quelle: Operations Research Letters. 33:481-485

Schlagwörter: 0209 industrial biotechnology, Combinatorial optimization, Minmax regret optimization, Polynomial algorithm, 0211 other engineering and technologies, Complexity, 02 engineering and technology, Abstract computational complexity for mathematical programming problems

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/2198532
https://doi.org/10.1016/j.orl.2004.11.003
https://dblp.uni-trier.de/db/journals/orl/orl33.html#Conde05
https://www.sciencedirect.com/science/article/abs/pii/S0167637704001506