Finding 3-Swap-Optimal Independent Sets and Dominating Sets is Hard: Finding 3-swap-optimal independent sets and dominating sets is hard

Συγγραφείς: Christian Komusiewicz, Nils Morawietz

Συνεισφορές: Christian Komusiewicz and Nils Morawietz

Πηγή: ACM Transactions on Computation Theory. 17:1-31

Θεματικοί όροι: vertex deletion problems, Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.), Graph problems, PLS-completeness, Local Search, Graph theory (including graph drawing) in computer science, local search, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), ddc:004, swap neighborhood, 3-swap neighborhood, Approximation methods and heuristics in mathematical programming

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: https://zbmath.org/8029723
https://doi.org/10.1145/3700642
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.66

Production coordination of local and cloud orders in shared manufacturing: a bi-objective pre-scheduling approach

Συγγραφείς: Weidong Lei, Liu Yang, Pengyu Yan, Chengbin Chu, Jie Yang

Πηγή: Annals of Operations Research. 345:207-245

Θεματικοί όροι: production coordination, robotic cells scheduling, Deterministic scheduling theory in operations research, Mixed integer programming, bi-objective optimization, shared manufacturing, Approximation methods and heuristics in mathematical programming, Multi-objective and goal programming

Περιγραφή αρχείου: application/xml

Stochastic Vehicle Routing With Delivery Choice: Stochastic vehicle routing with delivery choice

Συγγραφείς: Venkateshan, Prahalad, Mathur, Kamlesh

Πηγή: Naval Research Logistics (NRL). 72:502-519

Θεματικοί όροι: dynamic programming, Combinatorial optimization, Transportation, logistics and supply chain management, 05 social sciences, 0211 other engineering and technologies, transportation/logistics, 02 engineering and technology, Dynamic programming, Approximation methods and heuristics in mathematical programming, Discrete location and assignment, Applications of mathematical programming, applications of mathematical programming, 0502 economics and business, network models/stochastic, combinatorial optimization

Περιγραφή αρχείου: application/xml

Robust approximation of chance constrained optimization with polynomial perturbation

Συγγραφείς: Bo Rao, Liu Yang, Suhan Zhong, Guangming Zhou

Πηγή: Computational Optimization and Applications. 89:977-1003

Θεματικοί όροι: 0209 industrial biotechnology, Polynomial optimization, semidefinite relaxation, chance constrained optimization, 0211 other engineering and technologies, Stochastic programming, robust optimization, 02 engineering and technology, Robustness in mathematical programming, Approximation methods and heuristics in mathematical programming, Optimization and Control (math.OC), FOS: Mathematics, Semidefinite programming, nonnegative polynomial, Mathematics - Optimization and Control

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2211.13395
https://zbmath.org/7948917
https://doi.org/10.1007/s10589-024-00602-7

Exploring two new iterative methods for solving absolute value equations

Συγγραφείς: Ali, Rashid, Zhang, Zhao

Πηγή: Journal of Applied Mathematics and Computing. 70:6245-6258

Θεματικοί όροι: MGGS method, Numerical methods of relaxation type, AVEs, Approximation methods and heuristics in mathematical programming, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming), matrix decomposition, fixed point method, convergence analysis

Περιγραφή αρχείου: application/xml

Mathematical models and an effective exact algorithm for unrelated parallel machine scheduling with family setup times and machine cost

Συγγραφείς: Kai Li, Fulong Xie, Jianfu Chen, Wei Xiao, Tao Zhou

Πηγή: OR Spectrum. 47:129-176

Θεματικοί όροι: family setup times, Deterministic scheduling theory in operations research, branch-and-price algorithm, Polyhedral combinatorics, branch-and-bound, branch-and-cut, Integer programming, scheduling, machine cost, Dynamic programming, unrelated parallel machines, Approximation methods and heuristics in mathematical programming

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/8029127
https://doi.org/10.1007/s00291-024-00778-8

Identification of the Hammerstein nonlinear system with noisy output measurements

Συγγραφείς: Zha, Qiming, Li, Feng, Liu, Ranran

Πηγή: Control Theory and Technology. 22:203-212

Θεματικοί όροι: auto-regressive with extra input, Nonlinear systems in control theory, System identification, signal combination, Approximation methods and heuristics in mathematical programming, Hammerstein nonlinear system, improved particle swarm optimization

Περιγραφή αρχείου: application/xml

Designing tractable piecewise affine policies for multi-stage adjustable robust optimization

Συγγραφείς: Simon Thomä, Grit Walther, Maximilian Schiffer

Πηγή: Mathematical programming 208(1/2), 661-716 (2024). doi:10.1007/s10107-023-02053-0

Θεματικοί όροι: 0209 industrial biotechnology, adjustable optimization, 05 social sciences, 0211 other engineering and technologies, robust optimization, 02 engineering and technology, Minimax problems in mathematical programming, Approximation methods and heuristics in mathematical programming, 90C47, 90C57, 90C59, 49K35, ddc, Optimization and Control (math.OC), multi-stage problem, 0502 economics and business, Polyhedral combinatorics, branch-and-bound, branch-and-cut, FOS: Mathematics, Full Length Paper, Robust optimization, Multi-stage problem, Adjustable optimization, Approximation bounds, 90C47, 90C57, 90C59, 49K35, approximation bounds, Mathematics - Optimization and Control

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2207.00403
https://zbmath.org/7940332
https://doi.org/10.1007/s10107-023-02053-0
https://mediatum.ub.tum.de/doc/1770766/document.pdf
https://publications.rwth-aachen.de/record/979796

A hybrid method to solve reliability-cost-oriented bi-objective machine configuration problem for a flow shop system

Συγγραφείς: Cheng-Ta Yeh, Louis Cheng-Lu Yeng, Yi-Kuei Lin, Yu-Lun Chao

Πηγή: Annals of Operations Research. 340:643-669

Θεματικοί όροι: production reliability, absorptive Markov chain, nondominated sorting genetic algorithm II (NSGA-II), 0209 industrial biotechnology, Reliability, availability, maintenance, inspection in operations research, Deterministic scheduling theory in operations research, 0211 other engineering and technologies, technique for order preference by similarity to an ideal solution, 02 engineering and technology, bi-objective, Approximation methods and heuristics in mathematical programming, multistate flow shop network, Multi-objective and goal programming

Περιγραφή αρχείου: application/xml

A heuristic algorithm for the drone rural postman problem

Συγγραφείς: Xie, Ailing, Miyagawa, Keigo, Wu, Wei, Yagiura, Mutsunori

Πηγή: Journal of Industrial and Management Optimization. 20:1951-1966

Θεματικοί όροι: Combinatorial optimization, Transportation, logistics and supply chain management, heuristic algorithm, drone routing, Integer programming, combinatorial optimization, drone rural postman problem, Approximation methods and heuristics in mathematical programming, rural postman problem

Περιγραφή αρχείου: application/xml

First order asymptotics of the sample average approximation method to solve risk averse stochastic programs

Συγγραφείς: Volker Krätschmer

Πηγή: Mathematical Programming. 208:209-242

Θεματικοί όροι: risk averse stochastic program, Probability (math.PR), 0211 other engineering and technologies, Stochastic programming, divergence risk measures, covering numbers, Central limit and other weak theorems, 02 engineering and technology, absolute semideviations, Approximation methods and heuristics in mathematical programming, 01 natural sciences, Optimization and Control (math.OC), Mathematik, sample average approximation, FOS: Mathematics, 0101 mathematics, Mathematics - Optimization and Control, Mathematics - Probability

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2107.13863

Hardness and approximation of submodular minimum linear ordering problems

Συγγραφείς: Majid Farhadi, Swati Gupta, Shengding Sun, Prasad Tetali, Michael C. Wigal

Πηγή: Mathematical Programming. 208:277-318

Θεματικοί όροι: FOS: Computer and information sciences, Combinatorial optimization, principal partitions, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), Approximation methods and heuristics in mathematical programming, 01 natural sciences, submodular, Computer Science - Computational Complexity, minimum linear ordering problem, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), complexity, approximation

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2108.00914
https://zbmath.org/7940321
https://doi.org/10.1007/s10107-023-02038-z

Algorithms for the bin packing problem with scenarios

Συγγραφείς: Yulle G. F. Borges, Vinícius L. de Lima, Flávio K. Miyazawa, Lehilton L. C. Pedrosa, Thiago A. de Queiroz, Rafael C. S. Schouery

Πηγή: Journal of Combinatorial Optimization. 48

Θεματικοί όροι: FOS: Computer and information sciences, Combinatorial optimization, scenarios, variable-neighborhood search, Approximation methods and heuristics in mathematical programming, bin packing, branch-and-price algorithm, Optimization and Control (math.OC), Computer Science - Data Structures and Algorithms, Polyhedral combinatorics, branch-and-bound, branch-and-cut, FOS: Mathematics, Data Structures and Algorithms (cs.DS), Mathematics - Optimization and Control, approximation algorithm

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2305.15351
https://zbmath.org/7952421
https://doi.org/10.1007/s10878-024-01221-y

Efficient heuristics to compute minimal and stable feedback arc sets

Συγγραφείς: Claudia Cavallaro, Vincenzo Cutello, Mario F. Pavone

Πηγή: Journal of Combinatorial Optimization. 48

Θεματικοί όροι: Linear arrangement of vertices, Experimental analysis, Directed graphs (digraphs), tournaments, linear arrangement of vertices, heuristics, Programming involving graphs or networks, minimal feedback arc set, experimental analysis, Approximation methods and heuristics in mathematical programming, Graph theory (including graph drawing) in computer science, Heuristics, Minimal feedback arc set, Optimization problem, optimization problem

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/7952418
https://doi.org/10.1007/s10878-024-01209-8
https://hdl.handle.net/20.500.11769/640511
https://doi.org/10.1007/s10878-024-01209-8

The Bright Side of Simple Heuristics for the TSP: The bright side of simple heuristics for the TSP

Συγγραφείς: Frieze, Alan, Pegden, Wesley

Πηγή: The Electronic Journal of Combinatorics. 31

Θεματικοί όροι: Computational Geometry (cs.CG), FOS: Computer and information sciences, Combinatorial optimization, Discrete Mathematics (cs.DM), FOS: Mathematics, Computer Science - Computational Geometry, Mathematics - Combinatorics, Combinatorics (math.CO), Approximation methods and heuristics in mathematical programming, Computer Science - Discrete Mathematics

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2310.03222

Unified Representation of the Classical Ellipsoid Method: Unified representation of the classical ellipsoid method

Συγγραφείς: Stetsyuk, P. I., Fischer, A., Khomiak, O. M.

Πηγή: Cybernetics and Systems Analysis. 59:784-793

Θεματικοί όροι: saddle point, Convex programming, ellipsoid method, space dilation, Approximation methods and heuristics in mathematical programming, convex programming

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/7765739
https://doi.org/10.1007/s10559-023-00614-x

Optimal and heuristic policies for production and inventory controls in dual supply chains with fluctuating demands

Συγγραφείς: Bing Lin, Shaoxiang Chen, Rohit Bhatnagar

Πηγή: Naval Research Logistics (NRL). 70:708-734

Θεματικοί όροι: supply chain management, 05 social sciences, 0211 other engineering and technologies, Stochastic programming, Inventory, storage, reservoirs, 02 engineering and technology, Dynamic programming, Approximation methods and heuristics in mathematical programming, Markov-modulated demand, stochastic dynamic program, 0502 economics and business, inventory control, Production models, transshipment

Περιγραφή αρχείου: application/xml

A hybrid grey wolf optimizer for engineering design problems

Συγγραφείς: Shuilin Chen, Jianguo Zheng

Πηγή: Journal of Combinatorial Optimization. 47

Θεματικοί όροι: dimension learning-based, Halton sequence, Nonlinear programming, Cauchy mutation strategy, hybrid grey wolf optimizer, Approximation methods and heuristics in mathematical programming, engineering design problems, crisscross strategy

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/7950899
https://doi.org/10.1007/s10878-024-01189-9

A local search algorithm for the k-path partition problem: A local search algorithm for the \(k\)-path partition problem

Συγγραφείς: Shiming Li, Wei Yu, Zhaohui Liu

Πηγή: Optimization Letters. 18:279-290

Θεματικοί όροι: Combinatorial optimization, local search, path partition, 0211 other engineering and technologies, set covering, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, Approximation methods and heuristics in mathematical programming, 01 natural sciences, approximation algorithm

Περιγραφή αρχείου: application/xml

Machine learning based integrated scheduling and rescheduling for elective and emergency patients in the operating theatre

Συγγραφείς: Masoud Eshghali, Devika Kannan, Navid Salmanzadeh-Meydani, Amir Mohammad Esmaieeli Sikaroudi

Πηγή: Ann Oper Res

Θεματικοί όροι: Deterministic scheduling theory in operations research, rescheduling, operating room planning, 0211 other engineering and technologies, elective and emergency patients, 02 engineering and technology, Approximation methods and heuristics in mathematical programming, 3. Good health, Rescheduling, Operating room planning, machine learning, Machine learning, Elective and emergency patients, 0202 electrical engineering, electronic engineering, information engineering, operating theater scheduling, Operating theater scheduling, Original Research

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://pubmed.ncbi.nlm.nih.gov/36694896
https://zbmath.org/7905469
https://doi.org/10.1007/s10479-023-05168-x