European Journal of Operational Research, ISSN 0377-2217, 09/2019

Journal Article

Mathematical Programming, ISSN 0025-5610, 09/2003, Volume 98, Issue 1, pp. 23 - 47

The availability of effective exact or heuristic solution methods for general Mixed-Integer Programs (MIPs) is of paramount importance for practical...

heuristic | Mathematics | Mixed integer program | branch-and-bound | local search | Branch-and-bound | Local search | Heuristic | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | SEARCH | mixed integer program

heuristic | Mathematics | Mixed integer program | branch-and-bound | local search | Branch-and-bound | Local search | Heuristic | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | SEARCH | mixed integer program

Journal Article

Discrete Optimization, ISSN 1572-5286, 11/2016, Volume 22, pp. 183 - 194

Support Vector Machines (SVM’s) are ubiquitous and attracted a huge interest in the last years. Their training involves the definition of a suitable...

Mixed-integer programming | Classification | Support vector machine | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE

Mixed-integer programming | Classification | Support vector machine | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE

Journal Article

Operations Research, ISSN 0030-364X, 8/2006, Volume 54, Issue 4, pp. 756 - 766

Mixed-integer programs (MIPs) involving logical implications modeled through big-M coefficients are notoriously among the hardest to solve. In this paper, we...

mixed-integer programs | computational analysis | branch and cut | Benders' decomposition | Integers | Algorithms | Statistical analysis | Objective functions | Linear inequalities | Heuristics | Linear programming | Continuous variables | Slaves | Incumbents | Mixed-integer programs | Computational analysis | Branch and cut | TRAVELING SALESMAN PROBLEM | BRANCH | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | MODELS | DECOMPOSITION | FEASIBLE SUBSYSTEM PROBLEM | TIME WINDOWS | OPTIMIZATION | Analysis | Studies | Integer programming | Mathematical analysis | Optimization

mixed-integer programs | computational analysis | branch and cut | Benders' decomposition | Integers | Algorithms | Statistical analysis | Objective functions | Linear inequalities | Heuristics | Linear programming | Continuous variables | Slaves | Incumbents | Mixed-integer programs | Computational analysis | Branch and cut | TRAVELING SALESMAN PROBLEM | BRANCH | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | MODELS | DECOMPOSITION | FEASIBLE SUBSYSTEM PROBLEM | TIME WINDOWS | OPTIMIZATION | Analysis | Studies | Integer programming | Mathematical analysis | Optimization

Journal Article

TOP, ISSN 1134-5764, 07/2017, Volume 25, Issue 2, pp. 237 - 238

Journal Article

Operations Research, ISSN 0030-364X, 2/2014, Volume 62, Issue 1, pp. 114 - 122

High sensitivity to initial conditions is generally viewed as a drawback of tree search methods because it leads to erratic behavior to be mitigated somehow....

restart | mixed integer programming | enumerative algorithms | Restart | Mixed integer programming | Enumerative algorithms | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | MANAGEMENT | Integer programming | Mathematical optimization | Analysis | Self-denial | Studies | Optimization algorithms | Random variables

restart | mixed integer programming | enumerative algorithms | Restart | Mixed integer programming | Enumerative algorithms | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | MANAGEMENT | Integer programming | Mathematical optimization | Analysis | Self-denial | Studies | Optimization algorithms | Random variables

Journal Article

2007, Lecture notes in computer science, ISBN 9783540727910, Volume 4513

Web Resource

2007, Lecture notes in computer science, ISBN 3540727922, Volume 4513

Web Resource

European Journal of Operational Research, ISSN 0377-2217, 09/2016, Volume 253, Issue 3, pp. 557 - 569

Benders is one of the most famous decomposition tools for Mathematical Programming, and it is the method of choice e.g., in mixed-integer stochastic...

Benders decomposition | Congested capacitated facility location | Branch-and-cut | Perspective reformulation | Mixed-integer convex programming | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | CONGESTION | MODELS | CUTTING-PLANE | ALGORITHM | Mathematical optimization | Analysis | Convex programming | Decomposition method | Studies | Location analysis | Decision making models | Facilities planning | Optimization algorithms | Mathematical programming | Heuristic | Operations research | Site selection | Computation | Mathematical analysis | Programming | Bending machines | Mathematical models | Decomposition

Benders decomposition | Congested capacitated facility location | Branch-and-cut | Perspective reformulation | Mixed-integer convex programming | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | CONGESTION | MODELS | CUTTING-PLANE | ALGORITHM | Mathematical optimization | Analysis | Convex programming | Decomposition method | Studies | Location analysis | Decision making models | Facilities planning | Optimization algorithms | Mathematical programming | Heuristic | Operations research | Site selection | Computation | Mathematical analysis | Programming | Bending machines | Mathematical models | Decomposition

Journal Article

Computers and Operations Research, ISSN 0305-0548, 05/2018, Volume 93, pp. 101 - 112

is a simple static mechanism to convert a sequential tree-search code into a parallel one. In this paradigm, tree-search is distributed among a set of...

Parallel computing | Computational analysis | Mixed-integer programming | Enumerative algorithms | BOUND ALGORITHMS | BRANCH | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | OPTIMIZATION | ENGINEERING, INDUSTRIAL | COMMUNICATION | Integer programming | Parallel processing | Solvers | Linear programming | Algorithms

Parallel computing | Computational analysis | Mixed-integer programming | Enumerative algorithms | BOUND ALGORITHMS | BRANCH | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | OPTIMIZATION | ENGINEERING, INDUSTRIAL | COMMUNICATION | Integer programming | Parallel processing | Solvers | Linear programming | Algorithms

Journal Article

Mathematical Programming, ISSN 0025-5610, 11/2011, Volume 130, Issue 1, pp. 153 - 176

We discuss an implementation of the lexicographic version of Gomory’s fractional cutting plane method for ILP problems and of two heuristics mimicking the...

Cutting plane methods | Degeneracy in linear programming | Theoretical, Mathematical and Computational Physics | Mathematics | Lexicographic dual simplex | 90C49 Extreme-point and pivoting methods | Mathematical Methods in Physics | 90C10 Integer programming | Computational analysis | Calculus of Variations and Optimal Control; Optimization | Mathematics of Computing | 90C05 Linear programming | Numerical Analysis | Combinatorics | Gomory cuts | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | PROGRAMS | CLOSURE | Analysis | Algorithms | Studies | Linear programming | Cutting | Planes | Mathematical analysis | Battery | Exact solutions | Radicals | Standards

Cutting plane methods | Degeneracy in linear programming | Theoretical, Mathematical and Computational Physics | Mathematics | Lexicographic dual simplex | 90C49 Extreme-point and pivoting methods | Mathematical Methods in Physics | 90C10 Integer programming | Computational analysis | Calculus of Variations and Optimal Control; Optimization | Mathematics of Computing | 90C05 Linear programming | Numerical Analysis | Combinatorics | Gomory cuts | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | PROGRAMS | CLOSURE | Analysis | Algorithms | Studies | Linear programming | Cutting | Planes | Mathematical analysis | Battery | Exact solutions | Radicals | Standards

Journal Article

Transportation Science, ISSN 0041-1655, 2/2012, Volume 46, Issue 1, pp. 124 - 133

Finding robust yet efficient solutions to optimization problems is a major practical issue that received large attention in recent years. Starting with...

robustness | train timetabling | Lagrangian heuristics | computational analysis | railway optimization | Railway systems | Objective functions | Heuristics | Transportation | Railroad trains | Efficiency objectives | Lagrangian function | Stopping distances | Pareto efficiency | Propagation delay | Robustness | Computational analysis | Railway optimization | Train timetabling | RAILWAY TIMETABLES | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | TRANSPORTATION | TRANSPORTATION SCIENCE & TECHNOLOGY | Robust statistics | Usage | Mathematical optimization | Analysis | Stochastic programming | Studies | Trains | Scheduling | Stochastic models | Heuristic | Timetabling | Lagrange, Joseph Louis

robustness | train timetabling | Lagrangian heuristics | computational analysis | railway optimization | Railway systems | Objective functions | Heuristics | Transportation | Railroad trains | Efficiency objectives | Lagrangian function | Stopping distances | Pareto efficiency | Propagation delay | Robustness | Computational analysis | Railway optimization | Train timetabling | RAILWAY TIMETABLES | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | TRANSPORTATION | TRANSPORTATION SCIENCE & TECHNOLOGY | Robust statistics | Usage | Mathematical optimization | Analysis | Stochastic programming | Studies | Trains | Scheduling | Stochastic models | Heuristic | Timetabling | Lagrange, Joseph Louis

Journal Article

Transportation Science, ISSN 0041-1655, 08/2009, Volume 43, Issue 3, pp. 321 - 335

The train timetabling problem (TTP) consists of finding a train schedule on a railway network that satisfies some operational constraints and maximizes some...

robustness | timetabling | integer programming | stochastic programming | robust optimization | Mathematical robustness | Approximation | Efficiency loss | Objective functions | Transportation | Delay lines | Railroad trains | Stochastic models | Geometric lines | Rail lines | Integer programming | Robustness | Timetabling | Robust optimization | Stochastic programming | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | TRANSPORTATION | TRANSPORTATION SCIENCE & TECHNOLOGY | Railroads | Services | Analysis | Transportation schedules | Management | Mathematical optimization | Studies | Linear programming | Scheduling | Railway networks | Efficiency | Trains | Networks | Railway engineering | Mathematical analysis | Railways | Programming | Mathematical models | Trenitalia

robustness | timetabling | integer programming | stochastic programming | robust optimization | Mathematical robustness | Approximation | Efficiency loss | Objective functions | Transportation | Delay lines | Railroad trains | Stochastic models | Geometric lines | Rail lines | Integer programming | Robustness | Timetabling | Robust optimization | Stochastic programming | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | TRANSPORTATION | TRANSPORTATION SCIENCE & TECHNOLOGY | Railroads | Services | Analysis | Transportation schedules | Management | Mathematical optimization | Studies | Linear programming | Scheduling | Railway networks | Efficiency | Trains | Networks | Railway engineering | Mathematical analysis | Railways | Programming | Mathematical models | Trenitalia

Journal Article

European Journal of Operational Research, ISSN 0377-2217, 11/2017, Volume 263, Issue 1, pp. 258 - 264

At a planning level, train scheduling consists of optimizing the routing and scheduling for a set of trains on a railway network. In real-time operations,...

Real-time optimization | Train rescheduling | Combinatorial optimization | Mixed-Integer Linear Programming | Railways optimization | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ALGORITHM | CONSTRAINTS | Problem solving | Linear programming | Analysis | Railroads | Scheduling (Management) | Usage | Management

Real-time optimization | Train rescheduling | Combinatorial optimization | Mixed-Integer Linear Programming | Railways optimization | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ALGORITHM | CONSTRAINTS | Problem solving | Linear programming | Analysis | Railroads | Scheduling (Management) | Usage | Management

Journal Article

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2018, Volume 10848, pp. 232 - 244

Conference Proceeding

Mathematical Programming, ISSN 0025-5610, 11/2018, Volume 172, Issue 1, pp. 77 - 103

We address a generic mixed-integer bilevel linear program (MIBLP), i.e., a bilevel optimization problem where all objective functions and constraints are...

Mathematical Methods in Physics | 90C11 Mixed integer programming | Calculus of Variations and Optimal Control; Optimization | Mathematics of Computing | Numerical Analysis | Theoretical, Mathematical and Computational Physics | 65K05 Mathematical programming methods | Mathematics | Combinatorics | 90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut | COMPUTER SCIENCE, SOFTWARE ENGINEERING | PROGRAMMING PROBLEM | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ALGORITHM | Computational geometry | Feasibility studies | Linear programming | Convexity | Continuity (mathematics) | Optimization | Convergence | Linear functions | Computer Science | Operations Research

Mathematical Methods in Physics | 90C11 Mixed integer programming | Calculus of Variations and Optimal Control; Optimization | Mathematics of Computing | Numerical Analysis | Theoretical, Mathematical and Computational Physics | 65K05 Mathematical programming methods | Mathematics | Combinatorics | 90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut | COMPUTER SCIENCE, SOFTWARE ENGINEERING | PROGRAMMING PROBLEM | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ALGORITHM | Computational geometry | Feasibility studies | Linear programming | Convexity | Continuity (mathematics) | Optimization | Convergence | Linear functions | Computer Science | Operations Research

Journal Article

Mathematical Programming, ISSN 0025-5610, 09/2005, Volume 104, Issue 1, pp. 91 - 104

In this paper we consider the NP-hard problem of finding a feasible solution (if any exists) for a generic MIP problem of the form min{cTx:Ax≥b,xj integer ∀j ∈...

Numerical and Computational Methods | Mathematical and Computational Physics | 90C06 | Mathematics | 90C59 | 90C27 | Optimization | 90C10 | Mathematical Methods in Physics | Mathematics of Computing | Numerical Analysis | Operations Research/Decision Theory | 90C11 | Calculus of Variations and Optimal Control | Combinatorics | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | Studies | Software | Mathematical programming

Numerical and Computational Methods | Mathematical and Computational Physics | 90C06 | Mathematics | 90C59 | 90C27 | Optimization | 90C10 | Mathematical Methods in Physics | Mathematics of Computing | Numerical Analysis | Operations Research/Decision Theory | 90C11 | Calculus of Variations and Optimal Control | Combinatorics | COMPUTER SCIENCE, SOFTWARE ENGINEERING | MATHEMATICS, APPLIED | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | Studies | Software | Mathematical programming

Journal Article

Constraints, ISSN 1383-7133, 7/2018, Volume 23, Issue 3, pp. 296 - 309

Deep Neural Networks (DNNs) are very popular these days, and are the subject of a very intense investigation. A DNN is made up of layers of internal units (or...

Deep learning | Deep neural networks | Operations Research/Decision Theory | Mixed-integer programming | Computer Science | Artificial Intelligence (incl. Robotics) | Computing Methodologies | Computational experiments | Mathematical optimization | Optimization | COMPUTER SCIENCE, THEORY & METHODS | COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE | Data mining | Neural networks | Neurons | Artificial intelligence | Analysis | Mixed integer | Linear programming | Computation | Continuity (mathematics)

Deep learning | Deep neural networks | Operations Research/Decision Theory | Mixed-integer programming | Computer Science | Artificial Intelligence (incl. Robotics) | Computing Methodologies | Computational experiments | Mathematical optimization | Optimization | COMPUTER SCIENCE, THEORY & METHODS | COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE | Data mining | Neural networks | Neurons | Artificial intelligence | Analysis | Mixed integer | Linear programming | Computation | Continuity (mathematics)

Journal Article

Mathematical Programming Computation, ISSN 1867-2949, 2009, Volume 1, Issue 2-3, pp. 201 - 222

Journal Article

Operations Research, ISSN 0030-364X, 09/2002, Volume 50, Issue 5, pp. 851 - 861

The train timetabling problem aims at determining a periodic timetable for a set of trains that does not violate track capacities and satisfies some...

Transportation: train timetabling, railway | Programming algorithms: Lagrangian relaxation, heuristics | Integers | Mathematical intervals | Heuristics | Iterative solutions | Railroad trains | Scheduling | Lagrangian function | Departure time | Arrivals and departures | Incumbents | Transportation: train timetabling | Railway | Programming algorithms: Lagrangian relaxation | OPERATIONS | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | Railroads | Services | Operations research | Algorithms | Analysis | Studies | Trains | Transportation | Linear programming | Heuristic

Transportation: train timetabling, railway | Programming algorithms: Lagrangian relaxation, heuristics | Integers | Mathematical intervals | Heuristics | Iterative solutions | Railroad trains | Scheduling | Lagrangian function | Departure time | Arrivals and departures | Incumbents | Transportation: train timetabling | Railway | Programming algorithms: Lagrangian relaxation | OPERATIONS | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | Railroads | Services | Operations research | Algorithms | Analysis | Studies | Trains | Transportation | Linear programming | Heuristic

Journal Article

No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.