Gurobi

swMATH4105MaRDI QIDQ16292FDOQ16292

Author name not available (Why is that?)

Cited In (only showing first 100 items - show all)

• An alternative efficient representation for the project portfolio selection problem
• The Erdős-Ko-Rado theorem for 2-intersecting families of perfect matchings
• Robust Optimization for Electricity Generation
• On the \(S_{n}\)-invariant F-conjecture
• Production-process optimization algorithm: application to fed-batch bioprocess
• Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
• On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
• Sparse regression: scalable algorithms and empirical performance
• Mathematical programming models and exact algorithms
• New integer linear programming models for the vertex coloring problem
• A self-similar aperiodic set of 19 Wang tiles
• A scalable exact algorithm for the vertex \(p\)-center problem
• Cost-sensitive feature selection for support vector machines
• Nonstationary bandits with habituation and recovery dynamics
• A subgradient approach for constrained binary optimization via quantum adiabatic evolution
• Behavioral modeling in weight loss interventions
• Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling
• A heuristic for solving the maximum dispersion problem
• Approximating exact expected utility via portfolio efficient frontiers
• On biconnected and fragile subgraphs of low diameter
• Polyhedral approximations of the semidefinite cone and their application
• A new solver for the minimum weighted vertex cover problem
• Compact MILP models for optimal and Pareto-optimal LAD patterns
• Automatic security evaluation and (related-key) differential characteristic search: application to SIMON, PRESENT, Lblock, DES(L) and other bit-oriented block ciphers
• \(K\)-adaptability in two-stage robust binary programming
• A system to evaluate gas network capacities: concepts and implementation
• Maximising the weighted number of activity execution modes in project planning
• The integer nucleolus of directed simple games: a characterization and an algorithm
• A network simplex method for the budget-constrained minimum cost flow problem
• Integer-grid maps for reliable quad meshing
• New lower bounds for permutation arrays using contraction
• An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness
• Fabrication-adaptive optimization with an application to photonic crystal design
• Linearization technique with superior expressions for centralized planning problem with discount policy
• \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation
• A feasible active set method with reoptimization for convex quadratic mixed-integer programming
• Title not available (Why is that?)
• Multistage robust mixed-integer optimization with adaptive partitions
• Multistage adjustable robust mixed-integer optimization via iterative splitting of the uncertainty set
• Improved convex and concave relaxations of composite bilinear forms
• Computing project makespan distributions: Markovian PERT networks revisited
• Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem
• The \(m\)-ovoids of \(\mathcal{W}(5, 2)\) and their generalizations
• Penalty alternating direction methods for mixed-integer optimization: a new view on feasibility pumps
• Strong valid inequalities for Boolean logical pattern generation
• Estimation from nonlinear observations via convex programming with application to bilinear regression
• Coupled task scheduling with exact delays: literature review and models
• Presolve Reductions in Mixed Integer Programming
• An algorithm for single- and multiple-runway aircraft landing problem
• Adaptive total variation stable local timestepping for conservation laws
• A column generation heuristic for optimal wireless sensor network design with mobile sinks
• Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints
• Convergent Algorithms for a Class of Convex Semi-infinite Programs
• Selected applications of convex optimization
• Backdoors to tractable answer set programming
• Learning from non-random data in Hilbert spaces: an optimal recovery perspective
• Ascent with quadratic assistance for the construction of exact experimental designs
• On the convergence of steepest descent methods for multiobjective optimization
• An enhanced logical benders approach for linear programs with complementarity constraints
• Real-time scheduling with resource sharing on heterogeneous multiprocessors
• Improved cube-attack-like cryptanalysis of reduced-round Ketje-Jr and Keccak-MAC
• Towards railway traffic management using switching max-plus-linear systems, structure analysis and rescheduling
• Robust optimization of schedules affected by uncertain events
• Timetabling with passenger routing
• The potential of quantum annealing for rapid solution structure identification
• Continuous location under the effect of `refraction'
• Relational linear programming
• Convex quadratic relaxations for mixed-integer nonlinear programs in power systems
• On \(m\)-ovoids of regular near polygons
• Integer Programming
• Robust combinatorial optimization under convex and discrete cost uncertainty
• Practical integer-to-binary mapping for quantum annealers
• Fast algorithm for singly linearly constrained quadratic programs with box-like constraints
• Model predictive control with discrete actuators: theory and application
• A Lagrangian dual method for two-stage robust optimization with binary uncertainties
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
• Shift-and-propagate
• Optimization in engineering. Models and algorithms
• Greedy-like algorithms for dynamic assortment planning under multinomial logit preferences
• Solving the index tracking problem: a continuous optimization approach
• The minimum maximal k-partial-matching problem
• Modifications of the two-stage transportation problem and their applications
• Vertical hierarchical MPC for constrained linear systems
• Least costly energy management for extended-range electric vehicles: an economic optimization framework
• Cutting-Planes for Optimization of Convex Functions over Nonconvex Sets
• Validation of nominations in gas network optimization: models, methods, and solutions
• Efficient methods for the distance-based critical node detection problem in complex networks
• Fuzzy and robust approach for decision-making in disaster situations
• A comparison of Monte Carlo tree search and rolling horizon optimization for large-scale dynamic resource allocation problems
• Finding all solutions of separable systems of piecewise-linear equations using integer programming
• Stochastic optimization for power system configuration with renewable energy in remote areas
• Dominating sets in finite generalized quadrangles
• Surface subgroups from linear programming
• Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints
• Evaluating Gas Network Capacities
• Integer set reduction for stochastic mixed-integer programming
• The biclique \(k\)-clustering problem in bipartite graphs and its application in bioinformatics
• Weighted intriguing sets of finite generalised quadrangles
• Semidefinite programming lower bounds and branch-and-bound algorithms for the quadratic minimum spanning tree problem
• Substitutive structure of Jeandel-Rao aperiodic tilings

This page was built for software: Gurobi